Linear Programming: Theory and Applications

← Back to document page

LinearProgramming:TheoryandApplicationsC atherineLewisMay 11, 20081Contents1 Introductionto a linearprogram?. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . LinearProgrammingProblem. . . . . . . . . . . LinearProgramming. . . . . . . . . . . . SetsandDirections. . . . . . . . . . . . . . . . . . . . .82 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .163 nitions. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .194 AnOutlineof theProof205 ExamplesWithConvex SetsandExtremePoints Precursorsto theSimplexMethod.

plore an outline of the proof of the GRT and in Section 5 we work through a few examples related to the GRT. After learning the theory behind linear programs, we will focus methods of solving them. Section 6 introduces concepts necessary for introducing the Simplex algorithm, which we explain in Section 7. In Section 8, we explore

  Programming, Linear programming, Linear, Outline, Theory