Minimize the objective function $Z = 3x + 2y$ subject to the constraints: $x + y \geq 8$,$x + y \leq 5$,$x \geq 0$,$y \geq 0$.

  • A
    $15$
  • B
    $6$
  • C
    $24$
  • D
    Feasible region is not possible.

Explore More

Similar Questions

The maximum value of $z = 3x + 5y$ subject to the constraints $3x + 2y \leq 18$,$x \leq 4$,$y \leq 6$,$x, y \geq 0$,is

$A$ factory makes tennis rackets and cricket bats. $A$ tennis racket takes $1.5 \text{ hours}$ of machine time and $3 \text{ hours}$ of craftsman's time in its making,while a cricket bat takes $3 \text{ hours}$ of machine time and $1 \text{ hour}$ of craftsman's time. In a day,the factory has the availability of not more than $42 \text{ hours}$ of machine time and $24 \text{ hours}$ of craftsman's time. If the profit on a racket and on a bat is $Rs. 20$ and $Rs. 10$ respectively,find the maximum profit of the factory when it works at full capacity.

Difficult
View Solution

The maximum value of $z = 5x + 3y$ subject to constraints $3x + 5y \leq 15, x \geq 0, y \geq 0$ is :

The function to be maximized is given by $Z=3x+2y$. The feasible region for this function is the shaded region shown in the figure. The linear constraints for this region are given by:

For the following shaded region,the linear constraints are:

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