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