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