The corner points of the bounded feasible region for a linear programming problem (LPP) are (0, 3/2), (1, 2) and (4, 0). If the objective function is Z = ax + by, where 'a' and 'b' are positive, then the condition on 'a' and 'b' so that the maximum of Z occurs at (1, 2) and (4, 0) is:
The corner points of the bounded feasible region for a linear programming problem (LPP) are (0, 3/2), (1, 2) and (4, 0). If the objective function is Z = ax + by, where 'a' and 'b' are positive, then the condition on 'a' and 'b' so that the maximum of Z occurs at (1, 2) and (4, 0) is:
Solution
For the maximum of Z to occur at both points (1, 2) and (4, 0) simultaneously, both points must give the same maximum value.
The value of Z at each corner point:
At (0, 3/2):
At (1, 2):
At (4, 0):
For maximum to occur at both (1, 2) and (4, 0), these two points must have equal Z values:
When , the value
Since , this confirms the condition for maximum.
Therefore, the condition is .
Related questions:
2022: 25 May Shift 1
2026: 26 May Shift 2
2025: 3 June Shift 1
2026: 25 May Shift 1
2025: 3 June Shift 2