  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.
