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