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