1. Does the simplex algorithm use the same number of steps if the rows of the input matrix are permuted?
2. Give a linear programming formulation of the example for the knapsack problem in Chapter 42.
3. How many pivot steps are required to solve the linear program “Maximize subject to the constraints