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