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