Practicing Success
The programming problem Max Z = 2x + 3y subject to the conditions $0 \leq x \leq 3,0 \leq y \leq 4$ is : |
not an LPP an LPP, with unbounded feasible region and no solution an LPP, and Max Z = 18, at x = 3, y = 4 an LPP, and Max Z = 12, at x = 0, y = 4 |
an LPP, and Max Z = 18, at x = 3, y = 4 |
Objective f → Z = 2x + 3y constraints : 0 ≤ x ≤ 3 0 ≤ y ≤ 4
|