Minimise $Z = 3x + 2y$ subject to the constraints:
$x + y \geqslant 8$ ... $(1)$
$3x + 5y \leqslant 15$ ... $(2)$
$x \geqslant 0, y \geqslant 0$ ... $(3)$

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(N/A) Let us graph the inequalities $(1)$ to $(3)$.
For the constraint $x + y \geqslant 8$,the region is on or above the line passing through $(8, 0)$ and $(0, 8)$.
For the constraint $3x + 5y \leqslant 15$,the region is on or below the line passing through $(5, 0)$ and $(0, 3)$.
Since $x \geqslant 0$ and $y \geqslant 0$,we are restricted to the first quadrant.
Observing the graph,the region defined by $x + y \geqslant 8$ lies away from the origin,while the region defined by $3x + 5y \leqslant 15$ lies towards the origin.
There is no common region that satisfies all the given constraints simultaneously.
Therefore,the problem has no feasible region and consequently no feasible solution.

Explore More

Similar Questions

The corner points of the feasible region determined by the system of linear constraints are $(2, 72)$,$(15, 20)$,and $(40, 15)$. Let $Z = 6x + 3y$ be the objective function. The minimum value of $Z$ occurs at:

The solution for minimizing the function $z = x + y$ under an $L$.$P$.$P$. with constraints $x + y \geqslant 2$,$x + 2y \leqslant 8$,$y \leqslant 3$,$x, y \geqslant 0$ is

The constraints $-x_{1} + x_{2} \leq 1$,$-x_{1} + 3x_{2} \leq 9$,and $x_{1}, x_{2} \geq 0$ define:

The coordinates of the corner points of the bounded feasible region are $(0, 10)$,$(5, 5)$,$(15, 15)$,and $(0, 20)$. The minimum value of the objective function $z = 3x + 9y$ is . . . . . . .

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo