-Solve True or False

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).

17. T / F - For a standard form LP with n variables and m constraints, the direction of unboundedness is a vector with n-m elements.

18. T / F - Row 0 coefficients, while applying the simplex algorithm to a maximization problem, are known as reduced price.