Choose true or false for each question.

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.

19. For an LP with two decision variables, alternative solutions are all located on the same ________.

20. A maximization problem can be converted to a minimization problem by _______________________________.