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

The difference between the maximum value and the minimum value of the objective function $z = 3x + y$ subject to the constraints $2x + 3y \leq 6$, $x + y \geq 1$, $x \geq 0$, $y \geq 0$ is....

In the following figure, the shaded region represents the system of constraints:

The maximum value of $z=3x+4y$,subject to the constraints $x+y \leq 40$,$x+2y \leq 60$ and $x, y \geq 0$ is

The minimum value of the objective function $z = 4x + 6y$ subject to the constraints $x + 2y \geq 80$,$3x + y \geq 75$,and $x, y \geq 0$ is:

Cake-$A$ requires $200\, g$ of flour and $25\, g$ of fat. Cake-$B$ 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. The mathematical form of this $LPP$ 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