

MCQOPTIONS
Saved Bookmarks
1. |
Let x be a non-optimal feasible solution of a linear programming maximization problem and y a dual feasible solution, then |
A. | the primal objective value of x is greater than the dual objective value at y |
B. | the primal objective value at x can be equal to the dual objective value at y |
C. | the primal objective value at x is less than the dual objective value at y |
D. | the dual can be unbounded |
Answer» D. the dual can be unbounded | |