Practicing Success
Let R be the feasible region for a Linear Programming Problem and let z = ax + by be the objective function. If R is bounded, then the objective function z has : |
only maximum value of R only minimum value of R Both maximum and minimum values on R Neither maximum nor minimum values on R |
Both maximum and minimum values on R |