Geometric Linear Programming
This chapter is devoted entirely to the solution of linear programming problems by graphical and/or geometrical methods. We introduce linear programming problems, provide a rudimentary procedure for solving linear programming problems, and motivate the need for a better, more efficient algorithm to be discussed in Chapter 2.
KeywordsLine Segment Extreme Point Canonical Form Linear Programming Problem Shade Region
Unable to display preview. Download preview PDF.