True/False Questions (21 through 30): 21. Every LP problem that has a feasible solution, may have an optimal or unbounded solution. 22. Every LP problem will have at least one redundant constraint 23. In an L.P problem, the optimal solution may occurs at many of the interior points of the feasible region 24. An LP problem which is infeasible, may have an unbounded solution. 25. A feasible solution of an LP must always satisfy the upper and lower bound conditions. 26. A feasible solution need not always satisfy the non-negativity conditions. 27. The range of optimality for a coefficient in the objective function is the range of values over which it may vary without causing any change in the values of the decision variables in the optimal solution, 28. The value of a slack variable denotes the amount of a resource that is needed to produce more outputs, 29. In a minimization problem, it is sometimes possible to have a feasible solution which yields an objective function value less than that of the optimal solution. 30. In a maximization problem, it is sometimes possible to have a feasible solution which yields an objective function value greater than that of the optimal solution