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