engineering recuitment AAI ATC Junior Executive 2025 Mock Test Series Mathematics Linear Programmig Problem Optimal Feasible Solution
Consider the following Linear Programming problem:
Maximise Z = 40x1 + 50x2
subject to the constraints
x1 + 2x2 ≤ 40,
4x1 + 3x2 ≤ 120,
x1, x2 ≥ 0.
Then the optimal solution is:
1
Z = 1600 for x1 = 30, x2 = 8
2
Z = 1360 for x1 = 24, x2 = 8
3
Z = 1460 for x1 = 24, x2 = 10
4
Z = 1360 for x1 = 19, x2 = 12