The duality theorem of linear programming: an intuitive approach

Abstract

The duality theorem of linear programming is shown to be geometrically and algebraically intuitive when the vertex at which the optimal occurs is simple, i.e. the number of independent hyperplanes intersecting there is exactly the dimension of the space. The result is then extended to the general case using the order properties of the reals. Only the proof may be new.