Linear programming duality for geometers

From MaRDI portal

MaRDI QIDQ6242802zbMATH OpenFDO

Authors Gergely Ambrus

Publication date 20 June 2013


Mathematics Subject Classification ID

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


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.














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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Linear_programming_duality_for_geometers&oldid=98969480"
Powered by MediaWiki