{"schema_version":"ocme-public-explorer-results-v1","locale":"zh-Hant","filters":{"q":"q-20261015-advance-20261115-r04-linear-program-duality-0037"},"total":1,"page":1,"page_count":1,"question_state":"candidate","english_state":"ai_candidate","canonical_truth_promotion":false,"entries":[{"question_id":"q-20261015-advance-20261115-r04-linear-program-duality-0037","number":25862,"title":{"zh-Hant":"第 25862 題：線性規劃對偶","en":"Question 25862: Both Feasibility Checks Precede the Weak-Duality Inequality Chain"},"family_id":"qf-mod46-lpdual-weak-duality-chain","batch_id":"batch-20261015-advance-20261115-r04-linear-program-duality-foundations","mko_ids":["mko-linear-program-duality"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"f9076fc735d2a8d7a7fc408984cb5172c14999ada7e2209bcf62cc3f1fbddce5","derivation_sha256":"b6b6e10f9a631c0d4a525361e379e51bdec2fa4ef513f0182c943091d5e10c56"}]}