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