A dietician has to develop a special diet usi | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(A) Let the diet contain $x$ and $y$ packets of foods $P$ and $Q$ respectively. The objective is to maximize $Z = 6x + 3y$. The constraints are: $12x

Vedclass · Accepted Answer

$40$ packets of $P$ and $15$ packets of $Q$; Maximum vitamin $A = 285$ units

Vedclass · Answer

(A) Let the diet contain $x$ and $y$ packets of foods $P$ and $Q$ respectively. The objective is to maximize $Z = 6x + 3y$. The constraints are: $12x + 3y \geq 240 \implies 4x + y \geq 80$ $4x + 20y \geq 460 \implies x + 5y \geq 115$ $6x + 4y \leq 300 \implies 3x + 2y \leq 150$ $x, y \geq 0$. Solving the intersection points of the lines: $4x + y = 80$ and $x + 5y = 115$ gives $A(15, 20)$. $4x + y = 80$ and $3x + 2y = 150$ gives $B(2, 72)$. $x + 5y = 115$ and $3x + 2y = 150$ gives $C(40, 15)$. Evaluating $Z = 6x + 3y$ at corner points: Corner Point$Z = 6x + 3y$$A(15, 20)$$6(15) + 3(20) = 150$$B(2, 72)$$6(2) + 3(72) = 228$$C(40, 15)$$6(40) + 3(15) = 285$ The maximum value is $285$ at $(40, 15)$. Thus,$40$ packets of $P$ and $15$ packets of $Q$ are required.

Similar Questions

For the $LPP$,maximize $z=x+4y$ subject to the constraints $x+2y \leq 2$,$x+2y \geq 8$,$x, y \geq 0$.

The feasible region of the $L$.$P$.$P$. (Linear Programming Problem) to maximize $z = 70x + 50y$ subject to the constraints $8x + 5y \leq 60$,$4x + 5y \leq 40$ and $x \geq 0, y \geq 0$ is:

The maximum value of $2x + y$ subject to $3x + 5y \leq 26$ and $5x + 3y \leq 30, x \geq 0, y \geq 0$ is

The $L$.$P$.$P$. to maximize $Z = x + y$,subject to $x + y \leq 1$,$2x + 2y \geq 6$,$x \geq 0$,$y \geq 0$ has

Vedclass Test Series

Exam Paper Generator

Online Exam Module