Q. Let be the feasible region (convex polygon) for a linear programming problem and be the objective function. Then, which of the following statements is false?

 420  161 Linear Programming Report Error

Solution:

(a) Let be the feasible region (convex polygon) for a linear programming problem and let be the objective function. When has an optimal value (maximum or minimum), where the variables and are subject to constraints described by linear inequalities, this optimal value must occur at a comer point (vertex) of the feasible region.
(b) Let be the feasible region for a linear programming problem and let be the objective function. If is bounded, then the objective function has both a maximum and a minimum value on and each of these occurs at a corner point (vertex) of .
(c) If is unbounded, then a maximum or a minimum value of the objective function may not exist.
(d) If the maximum or a minimum value of exists, it must occur at a corner point of .