Consider the following Linear Programming Problem (LPP).Maximise Z = x1 + 2x2Subject to:x1 ≤ 2x2 ≤ 2x1 + x2 ≤ 2x1, x2 ≥ 0 (i.e. +ve decision variables)What is the optimal solution to the above LPP?

Consider the following Linear Programming Problem (LPP).Maximise Z = x

1.	Consider the following Linear Programming Problem (LPP).Maximise Z = x1 + 2x2Subject to:x1 ≤ 2x2 ≤ 2x1 + x2 ≤ 2x1, x2 ≥ 0 (i.e. +ve decision variables)What is the optimal solution to the above LPP?
A.	2, 2
B.	0, 2
C.	2, 0
D.	0, 0
Answer» C. 2, 0