Choose true or false for each question.

13. T / F - A constraint is said to be binding if removing it changes the shape of the feasible region.

14. T / F - A constraint is non-binding if the corresponding slack variable has a positive value defined by an optimal solution of the LP.

15. T / F - Simplex algorithm finds and evaluates the objective function value of all extreme points.

16. T / F - A standard form LP with n variables and m constraints yields a n by m technology matrix (denoted by A).