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