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