{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261015-advance-20261115-r04-linear-program-duality-0028"},"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-0028","number":25853,"title":{"zh-Hant":"第 25853 題：線性規劃對偶","en":"Question 25853: 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":"331c18fa0c462b2e5cea1e41d0da1456523c09154c199f8dcf345d6897725b47","derivation_sha256":"4704880b4b203f47fc5ef0021bc117973f0e874ebf6269176994429887004489"}]}