Linear programming duality for geometers

TL;DR

This paper offers a geometric proof of the linear programming duality theorem, making the fundamental concept more accessible and easier to understand through a clear, self-contained approach.

Contribution

It introduces a new geometric proof for linear programming duality, enhancing conceptual understanding and simplicity compared to traditional algebraic methods.

Findings

Provides a transparent geometric proof of duality theorem

Simplifies understanding of linear programming duality

Self-contained approach accessible to learners

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.