Generalization to the n-var
case: the ``geometry'' of the LP feasible region and the Fundamental Theorem of
Linear Programming
In this section we generalize the geometry of the 2-var LP's, presented in
the previous section, to LP's with n decision variables. The study of the
``geometric'' properties of the LP feasible region for this general case, will
eventually lead to the Fundamental Theorem of Linear Programming, which
is at the basis of the Simplex algorithm.
|
