Problem
1. Construct a linear program consisting of N inequalities on two variables for which the simplex algorithm requires at least N /2 pivots.
2. Give a three-dimensional linear-programming problem that illustrates the difference between the greatest-increment and steepest-descent column-selection methods.
3. Modify the implementation given in the text to write out the coordinates of the optimal solution point.