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