engineering recuitment BMC Sub Engineer Mock Test 2024 Industrial Engineering Operations Research Linear Programming
A linear programming problem is as follows:
Maximize Z = 30x - 18y
subject to the constraints,
3x + 4y ≤ 60
5x - 3y ≥ 20
x, y ≥ 0
In the feasible region, the maximum value of Z occurs at
1
Two points
2
One point
3
Infinite number of points
4
More than one of the above
5
None of the above