Define the Linear programming problem (LPP).
Consider the following linear programming problem:
Maximize subject to:
12x + 10 Y
4X + 3Y ≤ 480
2X + 3Y ≤ 360
all variables ≥ 0
The most possible value for the objective function is
1. 360
2. 480
3. 1520
4. 1550
5. None of these.