Minimize $Z = 13x - 15y$ subject to the constraints: $x + y \leq 7$,$2x - 3y + 6 \geq 0$,$x \geq 0$,$y \geq 0$.

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(C) We need to minimize $Z = 13x - 15y$ subject to the constraints $x + y \leq 7$,$2x - 3y + 6 \geq 0$,$x \geq 0$,and $y \geq 0$. The feasible region is determined by these inequalities as shown in the figure.
The shaded region is a polygon with vertices $O(0, 0)$,$A(7, 0)$,$B(3, 4)$,and $C(0, 2)$.
Corner Point Value of $Z = 13x - 15y$
$O(0, 0)$ $13(0) - 15(0) = 0$
$A(7, 0)$ $13(7) - 15(0) = 91$
$B(3, 4)$ $13(3) - 15(4) = 39 - 60 = -21$
$C(0, 2)$ $13(0) - 15(2) = -30$

Comparing the values of $Z$ at these corner points,the minimum value of $Z$ is $-30$ at the point $(0, 2)$.

Explore More

Similar Questions

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)$

The solution set of the constraints $x + 2y \geq 11$,$3x + 4y \leq 30$,$2x + 5y \leq 30$,$x \geq 0$,$y \geq 0$ includes the point:

The objective function of a Linear Programming Problem $(LPP)$ is

For a linear programming problem, the objective function is $z = px + qy$, where $p, q > 0$. If at the corner points $(0, 10)$ and $(5, 5)$ the values of $z$ are $90$ and $60$ respectively, then the relation between $p$ and $q$ is . . . . . . .

The objective function of a Linear Programming Problem $(L.P.P.)$ defined over a convex set attains its optimum value at

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