Reshma wishes to mix two types of food $P$ and $Q$ in such a way that the vitamin contents of the mixture contain at least $8$ $units$ of vitamin $A$ and $11$ $units$ of vitamin $B$. Food $P$ costs Rs $60/kg$ and Food $Q$ costs Rs $80/kg$. Food $P$ contains $3$ $units/kg$ of Vitamin $A$ and $5$ $units/kg$ of Vitamin $B$ while food $Q$ contains $4$ $units/kg$ of Vitamin $A$ and $2$ $units/kg$ of vitamin $B$. Determine the minimum cost of the mixture. Let the mixture contain $x$ kg of food $P$ and $y$ kg of food $Q$. Therefore,$x \geq 0$ and $y \geq 0$. The given information can be compiled in a table as follows:

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(A) Let the mixture contain $x$ kg of food $P$ and $y$ kg of food $Q$. Therefore,$x \geq 0$ and $y \geq 0$. The given information is compiled in the table below:
FoodVitamin $A$ (units/kg)Vitamin $B$ (units/kg)Cost (Rs/kg)
$P$$3$$5$$60$
$Q$$4$$2$$80$
Requirement$8$$11$-

The constraints are:
$3x + 4y \geq 8$
$5x + 2y \geq 11$
$x, y \geq 0$
Objective function to minimize: $Z = 60x + 80y$.
The corner points of the feasible region are $A(\frac{8}{3}, 0)$,$B(2, \frac{1}{2})$,and $C(0, \frac{11}{2})$.
Evaluating $Z$ at corner points:
Corner Point$Z = 60x + 80y$
$A(\frac{8}{3}, 0)$$60(\frac{8}{3}) + 80(0) = 160$
$B(2, \frac{1}{2})$$60(2) + 80(\frac{1}{2}) = 120 + 40 = 160$
$C(0, \frac{11}{2})$$60(0) + 80(\frac{11}{2}) = 440$

Since the feasible region is unbounded,we check if $60x + 80y < 160$ has any common points with the feasible region. The line $3x + 4y < 8$ does not intersect the feasible region. Thus,the minimum cost is Rs $160$ at any point on the line segment joining $A$ and $B$.

Explore More

Similar Questions

$A$ manufacturing company produces two items,$A$ and $B$. Each item must be processed by two machines,$I$ and $II$. Machine $I$ can be operated for a maximum of $10$ hours $40$ minutes ($640$ minutes). It takes $20$ minutes for an item $A$ and $15$ minutes for an item $B$. Machine $II$ can be operated for a maximum of $8$ hours $20$ minutes ($500$ minutes). It takes $5$ minutes for an item $A$ and $8$ minutes for an item $B$. The profit per item of $A$ is ₹ $25$ and per item of $B$ is ₹ $18$. The formulation of an $L.P.P.$ to maximize the profit (where $x$ is the number of items $A$ and $y$ is the number of items $B$) is . . . . . . .

$A$ wholesale merchant wants to start a cereal business with $Rs \ 24000$. Wheat costs $Rs \ 400$ per quintal and rice costs $Rs \ 600$ per quintal. He has a storage capacity of $200$ quintals of cereal. He earns a profit of $Rs \ 25$ per quintal on wheat and $Rs \ 40$ per quintal on rice. If he stores $x$ quintals of rice and $y$ quintals of wheat,then for maximum profit,the objective function is:

The vertices of the feasible region for the constraints $x+y \leq 4$,$x \leq 2$,$y \leq 1$,$x+y \geq 1$,$x, y \geq 0$ are

The solution set of the constraints $2x + 3y \leq 6$,$x + 4y \leq 4$,$x \geq 0$,and $y \geq 0$ includes the point $\ldots$ as a corner point.

The point,at which the maximum value of $10x + 6y$ subject to the constraints $x + y \leq 12$,$2x + y \leq 20$,$x \geq 0$,$y \geq 0$ occurs,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