Two godowns $A$ and $B$ have grain capacity of $100$ quintals and $50$ quintals respectively. They supply to $3$ ration shops,$D$,$E$ and $F$ whose requirements are $60, 50$ and $40$ quintals respectively. The cost of transportation per quintal from the godowns to the shops are given in the following table:
Transportation cost per quintal (in $Rs$)
From/To $A$ $B$
$D$ $6$ $4$
$E$ $3$ $2$
$F$ $2.50$ $3$

How should the supplies be transported in order that the transportation cost is minimum? What is the minimum cost?

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(D) Let godown $A$ supply $x$ and $y$ quintals of grain to the shops $D$ and $E$ respectively. Then,$(100-x-y)$ will be supplied to shop $F$.
The requirement at shop $D$ is $60$ quintals. Since $x$ quintals are transported from godown $A$,the remaining $(60-x)$ quintals will be transported from godown $B$.
Similarly,$(50-y)$ quintals and $40-(100-x-y) = (x+y-60)$ quintals will be transported from godown $B$ to shop $E$ and $F$ respectively.
Total transportation cost $z$ is given by:
$z = 6x + 3y + 2.5(100-x-y) + 4(60-x) + 2(50-y) + 3(x+y-60)$
$z = 6x + 3y + 250 - 2.5x - 2.5y + 240 - 4x + 100 - 2y + 3x + 3y - 180$
$z = 2.5x + 1.5y + 410$
The problem is to minimize $z = 2.5x + 1.5y + 410$ subject to:
$x+y \leq 100, x \leq 60, y \leq 50, x+y \geq 60, x, y \geq 0$.
The corner points of the feasible region are $A(60, 0), B(60, 40), C(50, 50),$ and $D(10, 50)$.
Corner point$z = 2.5x + 1.5y + 410$
$A(60, 0)$$560$
$B(60, 40)$$620$
$C(50, 50)$$610$
$D(10, 50)$$510$ (Minimum)

The minimum value of $z$ is $510$ at $(10, 50)$.
Thus,the amount of grain transported from $A$ to $D, E, F$ is $10, 50, 40$ quintals respectively,and from $B$ to $D, E, F$ is $50, 0, 0$ quintals respectively.

Explore More

Similar Questions

If $Z=10x+25y$ subject to $0 \leq x \leq 3, 0 \leq y \leq 3, x+y \leq 5, x \geq 0, y \geq 0$,then $Z$ is maximum at the point:

Find the maximum value of $z = 2x + 6y$ subject to the constraints $-x + y \leq 1$,$2x + y \leq 2$,$x \geq 0$,and $y \geq 0$.

$A$ dietician has to develop a special diet using two foods $P$ and $Q$. Each packet (containing $30 \, g$) of food $P$ contains $12$ units of calcium,$4$ units of iron,$6$ units of cholesterol and $6$ units of vitamin $A$. Each packet of the same quantity of food $Q$ contains $3$ units of calcium,$20$ units of iron,$4$ units of cholesterol and $3$ units of vitamin $A$. The diet requires at least $240$ units of calcium,at least $460$ units of iron and at most $300$ units of cholesterol. How many packets of each food should be used to minimise the amount of vitamin $A$ in the diet? What is the minimum amount of vitamin $A$?

Difficult
View Solution

The feasible region of an $LPP$ is shown in the figure. If $z = 3x + 9y$,then the minimum value of $z$ occurs at

$A$ firm has to transport $1200$ packages using large vans which can carry $200$ packages each and small vans which can take $80$ packages each. The cost for engaging each large van is $Rs. 400$ and each small van is $Rs. 200$. Not more than $Rs. 3000$ is to be spent on the job and the number of large vans cannot exceed the number of small vans. Formulate this problem as an $LPP$ given that the objective is to minimize cost.

Difficult
View Solution

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