Q. The linear programming problem Maximize $z = x_{1} + x_{2}$ Subject to constraints $x_{1} + 2x_{2} \leq 2000$ $x_{1} + x_{2} \leq 1500$ $x_{2} \leq 600$ $x_{1} \geq 0$has

A) No feasible solution
B) Unique optimal solution
C) A finite number of optimal solutions
D) Infinite number of optimal solutions
Explanation

(d)
Given constraints are
$x_{1} + 2x_{2} \leq 2000,\ x_{1} + x_{2} \leq 1500,\ x_{2} \leq 600$ and $x_{1} \geq 0$
The feasible region is $OACDEO$
[image:12_image26.jpeg]
At $O(0,\ 0),\ z = 0 + 0 = 0$
At $A\ (1500,\ 0),\ z = 1500 + 0 = 1500$
At $C(1000,\ 500),\ z = 1000 + 500 = 1500$
At $D(800,\ 600),\ z = 800 + 600 = 1400$
At $E(0,\ 600),\ z = 0 + 600 = 600$
Here, $z$ is maximum on the segment $AC$
Hence, there are infinite optimal solutions

Dr. Abubacker
Reviewed by Dr. Abubacker

Physics Educator & NEET/JEE Specialist

Ph.D. in Physics with 19+ years of teaching experience.