Question 11 1 pts The simplex method for solving linear programming problems is partially based on the solution of simultaneous equations and matrix algebra. False True Question 12 1 pts Because it provides an optimal solution, sensitivity analysis is not an important component to linear programming. False True Question 16 1 pts In linear programming extreme points are variables representing unused resources variables representing an excess above a resource requirement all the points that simultaneously satisfy all the constraints of the model corner points on the boundary of the feasible solution space Question 17 1 pts The optimal solution in a linear programming model will always be a slack variable always be a surplus variable always occur at an extreme point always be outside the feasible solution space