{"schema_version":"ocme-site-results-v1","locale":"zh-Hant","page_type":"derivations","facts":{"questions":36000,"reviewed":36000,"display_candidates":0,"knowledge":302,"guides":299,"paths":59,"batches":360,"families":1441,"atlas":302,"core":80,"evidence":9,"formal_evidence":5,"formal_subjects":4,"lean_files":6,"lean_toolchain":"leanprover/lean4:v4.30.0","question_state":"candidate","english_state":"ai_candidate","question_Lean":"NOT_RUN","canonical_truth_promotion":false},"filters":{"q":"mko-linear-program-duality"},"kind":"guides","total":1,"pages":1,"page":1,"entries":[{"id":"derivation-mko-linear-program-duality-01","title":{"zh-Hant":"弱對偶鏈與零間隙最優證書","en":"The weak-duality chain and a zero-gap optimality certificate"},"summary":{"zh-Hant":"完整構造對偶，核 x=(1,3)、y=(1,1) 可行並由零間隙證雙最優。","en":"Construct the full dual, check feasibility of x=(1,3), y=(1,1), and certify both optimal by zero gap."},"mko_ids":["mko-linear-program-duality"]}],"title":"概念推導導讀"}