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