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