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