engineering recuitment AAI JE Technical Mock Test 2020-21 Industrial Engineering Operations Research Linear Programming
Consider the following Linear Programming Problem (LPP).
Maximise Z = x1 + 2x2
Subject to:
x1 ≤ 2
x2 ≤ 2
x1 + x2 ≤ 2
x1, x2 ≥ 0 (i.e. +ve decision variables)
What is the optimal solution to the above LPP?
1
2, 2
2
0, 2
3
2, 0
4
0, 0