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