Linear programming duality for geometers

arXiv1306.4850MaRDI QIDQ6242802FDOQ6242802

Authors: Gergely Ambrus 

Publication date: 20 June 2013

Abstract: We present a geometric proof for the duality theorem of linear programming. Besides being self-contained and simple, the present approach also provides a transparent way for understanding this fundamental result.

Mathematics Subject Classification ID

Linear programming (90C05) Convex functions and convex programs in convex geometry (52A41)

This page was built for publication: Linear programming duality for geometers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6242802)