$A$ manufacturer produces two models of bikes: Model $X$ and Model $Y$. Model $X$ takes $6$ man-hours to make per unit,while Model $Y$ takes $10$ man-hours per unit. There is a total of $450$ man-hours available per week. Handling and marketing costs are $Rs. 2000$ and $Rs. 1000$ per unit for Models $X$ and $Y$ respectively. The total funds available for these purposes are $Rs. 80,000$ per week. Profits per unit for Models $X$ and $Y$ are $Rs. 1000$ and $Rs. 500$ respectively. How many bikes of each model should the manufacturer produce so as to yield a maximum profit? Find the maximum profit.

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(A) Let the manufacturer produce $x$ number of Model $X$ bikes and $y$ number of Model $Y$ bikes.
Model $X$ takes $6$ man-hours and Model $Y$ takes $10$ man-hours per unit. Total man-hours available per week is $450$.
$\therefore 6x + 10y \leq 450 \Rightarrow 3x + 5y \leq 225$
Handling and marketing costs are $Rs. 2000$ and $Rs. 1000$ per unit respectively,with total funds of $Rs. 80,000$ per week.
$\therefore 2000x + 1000y \leq 80000 \Rightarrow 2x + y \leq 80$
Also,$x \geq 0, y \geq 0$.
We need to maximize the profit function $Z = 1000x + 500y$ subject to the constraints:
$3x + 5y \leq 225$
$2x + y \leq 80$
$x \geq 0, y \geq 0$
The feasible region is determined by the corner points $(0,0), (40,0), (25,30),$ and $(0,45)$.
Corner PointsValue of $Z = 1000x + 500y$
$(0,0)$$0$
$(40,0)$$1000(40) + 500(0) = 40000$
$(25,30)$$1000(25) + 500(30) = 25000 + 15000 = 40000$
$(0,45)$$1000(0) + 500(45) = 22500$

The maximum profit is $Rs. 40,000$. This occurs at any point on the line segment joining $(40,0)$ and $(25,30)$. Thus,the manufacturer can produce $40$ units of Model $X$ and $0$ units of Model $Y$,or $25$ units of Model $X$ and $30$ units of Model $Y$ to achieve the maximum profit.

Explore More

Similar Questions

The minimum value for the $LPP$ $Z = 6x + 2y$,subject to $2x + y \geq 16$,$x \geq 6$,$y \geq 1$ is

For the following shaded region,the linear constraints are:

$A$ diet of a sick person must contain at least $4000$ units of vitamins,$50$ units of proteins,and $1400$ calories. Two foods $A$ and $B$ are available at a cost of ₹ $4$ and ₹ $3$ per unit respectively. If one unit of $A$ contains $200$ units of vitamins,$1$ unit of protein,and $40$ calories,while one unit of food $B$ contains $100$ units of vitamins,$2$ units of protein,and $40$ calories,formulate the problem so that the diet is the cheapest.

The solution set of the constraints $x+2y \leq 2000$,$x+y \leq 1500$,$y \leq 600$ and $x \geq 0$ does not include the point

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

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