One kind of cake requires $200 \,g$ of flour and $25 \,g$ of fat,and another kind of cake requires $100 \,g$ of flour and $50 \,g$ of fat. Find the maximum number of cakes which can be made from $5 \,kg$ of flour and $1 \,kg$ of fat,assuming that there is no shortage of the other ingredients used in making the cakes.

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(30) Let $x$ be the number of cakes of the first kind and $y$ be the number of cakes of the second kind.
Therefore,$x \geq 0$ and $y \geq 0$.
The given information can be summarized in the following table:
Type of Cake Flour $(g)$ Fat $(g)$
First kind $(x)$ $200$ $25$
Second kind $(y)$ $100$ $50$
Availability $5000$ $1000$

Constraints:
$200x + 100y \leq 5000 \Rightarrow 2x + y \leq 50$
$25x + 50y \leq 1000 \Rightarrow x + 2y \leq 40$
Objective function: Maximize $Z = x + y$.
The feasible region is determined by the constraints $2x + y \leq 50$,$x + 2y \leq 40$,$x \geq 0$,and $y \geq 0$. The corner points of the feasible region are $O(0, 0)$,$A(25, 0)$,$B(20, 10)$,and $C(0, 20)$.
Evaluating $Z = x + y$ at corner points:
Corner Point $Z = x + y$
$O(0, 0)$ $0$
$A(25, 0)$ $25$
$B(20, 10)$ $30$ (Maximum)
$C(0, 20)$ $20$

Thus,the maximum number of cakes that can be made is $30$ ($20$ of the first kind and $10$ of the second kind).

Explore More

Similar Questions

$A$ company manufactures two types of novelty souvenirs made of plywood. Souvenirs of type $A$ require $5 \text{ minutes}$ each for cutting and $10 \text{ minutes}$ each for assembling. Souvenirs of type $B$ require $8 \text{ minutes}$ each for cutting and $8 \text{ minutes}$ each for assembling. There are $3 \text{ hours } 20 \text{ minutes}$ available for cutting and $4 \text{ hours}$ for assembling. The profit is $Rs. 5$ each for type $A$ and $Rs. 6$ each for type $B$ souvenirs. How many souvenirs of each type should the company manufacture in order to maximise the profit?

Difficult
View Solution

For the linear programming problem, $x + 2y \leq 10$, $3x + y \leq 12$, $x, y \geq 0$, the maximum value of $z = 5x + 10y$ occurs at every point on the line segment joining the points..

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

$A$ manufacturer of electronic circuits has a stock of $200$ resistors,$120$ transistors and $150$ capacitors and is required to produce two types of circuits $A$ and $B$. Type $A$ requires $20$ resistors,$10$ transistors and $10$ capacitors. Type $B$ requires $10$ resistors,$20$ transistors and $30$ capacitors. If the profit on type $A$ circuit is $Rs. 50$ and that on type $B$ circuit is $Rs. 60$,formulate this problem as a $LPP$ so that the manufacturer can maximize his profit.

Difficult
View Solution

The difference between the maximum value and minimum value of the objective function $z = 3x + 5y$ subject to the constraints $x + 3y \leqslant 60$,$x + y \geqslant 10$,$x - y = 0$,and $x, y \geqslant 0$ 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