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