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