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