Consider the following Linear Programming Problem $($LPP$)$:
Maximize $z=x_1+x_2$
Subject to the constraints:
$x_1+2x_2\le 2000$
$x_1+x_2\le 1500$
$x_2\le 600$
and $x_1,x_2\ge 0$
The solution of the above LPP is:
$x_1=1000,\ x_2=500$
Now,
$x_1+2x_2=1000+2(500)=2000\le 2000$
$x_1+x_2=1000+500=1500\le 1500$
$x_2=500\le 600$
Also,
$z=x_1+x_2=1000+500=1500$
So, all constraints are satisfied.
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
Online Test Series, Information About Examination,
Syllabus, Notification
and More.