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