{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261015-advance-20261115-r04-linear-program-duality-0066"},"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-0066","number":25891,"title":{"zh-Hant":"第 25891 題：線性規劃對偶","en":"Question 25891: A Feasible Zero-Gap Pair Certifies Both Primal and Dual Optimality"},"family_id":"qf-mod46-lpdual-zero-gap-certificate","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":"3ea171f27842e152844207250cb557a39e30b2d023414f47b6d0b367d5bacf0a","derivation_sha256":"8d9421761d28f47640a91c5622c1e21b85ebdcee8499efbb9ae4c48628eaeb9c"}]}