$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.

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(A) Let $x$ be the number of large vans and $y$ be the number of small vans.
The objective is to minimize the total cost $Z$. The cost of one large van is $Rs. 400$ and one small van is $Rs. 200$. Thus,the objective function is $Z = 400x + 200y$.
Constraints:
$1$. Total packages to be transported is at least $1200$: $200x + 80y \geq 1200$,which simplifies to $5x + 2y \geq 30$.
$2$. Total cost cannot exceed $Rs. 3000$: $400x + 200y \leq 3000$,which simplifies to $2x + y \leq 15$.
$3$. Number of large vans cannot exceed the number of small vans: $x \leq y$.
$4$. Non-negativity constraints: $x \geq 0, y \geq 0$.
Thus,the $LPP$ is:
Minimize $Z = 400x + 200y$
Subject to:
$5x + 2y \geq 30$
$2x + y \leq 15$
$x \leq y$
$x, y \geq 0$

Explore More

Similar Questions

$A$ dietician wishes to mix together two kinds of food $X$ and $Y$ in such a way that the mixture contains at least $10$ units of vitamin $A$,$12$ units of vitamin $B$,and $8$ units of vitamin $C$. The vitamin contents of one $kg$ of food are given below:
Food Vitamin $A$ Vitamin $B$ Vitamin $C$
$X$ $1$ $2$ $3$
$Y$ $2$ $2$ $1$

One $kg$ of food $X$ costs $Rs. 16$ and one $kg$ of food $Y$ costs $Rs. 20$. Find the least cost of the mixture which will produce the required diet?

Difficult
View Solution

The production of item $A$ is $x$ and the production of item $B$ is $y$. If the corner points of the bounded feasible region are $(1,0), (2,0), (0,2)$ and $(0,1)$,then the maximum profit $z = 2000x + 5000y$ is $\ldots \ldots$

The feasible region for the constraints $x-y \geqslant 0$,$x-5y \leqslant -5$,$x \geqslant 0$,$y \geqslant 0$ is shown by the figure:

The difference between the maximum and minimum values of the objective function $Z = 3x + 5y$, subject to the constraints $x + 3y \leq 60$, $x + y \geq 10$, $x - y \leq 0$, and $x, y \geq 0$ is

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..

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