Question Error Report

Thank you for reporting, we will resolve it shortly

Back to Question

Q. For $L.P.P$, maximize $z = 4x_{1}+ 2x_{2}$ subject to $3x_{1} + 2x_{2} \ge 9, x_{1} - x_{2} \le 3, x_{1} \ge 0, x_{2} \ge 0$ has .........

MHT CETMHT CET 2019

Solution:

We have, maximise $z=4 x_{1}+2 x_{2}$
Subject to constracts, $3 x_{1}+2 x_{2} \geq 9, x_{1}-x_{2} \leq 3$
$x_{1} \geq 0, x_{2} \geq 0$
On taking given constraints as equation, we get the following graphs
image
Here, we get feasible region Is unbounded.