Correct option is C
Let R be the feasible region for a Linear Programming problem and let z=zx+by be the objective function. If R is bounded, then the objective function z has both maximum and minimum values on R.
Let R be the feasible region for a Linear Programming problem and let z=zx+by be the objective function. If R is bounded, then the objective function z has both maximum and minimum values on R.