The number of solutions in a linear programming model to maximize the objective function 5x + 4y subject to the constraints,
x - 2y ≥ 2,
2x - 4y ≤ - 3,
x, y ≥ 0 will be,
1
One
2
Two
3
Infinite
4
Zero
The number of solutions in a linear programming model to maximize the objective function 5x + 4y subject to the constraints,
x - 2y ≥ 2,
2x - 4y ≤ - 3,
x, y ≥ 0 will be,