$A$ company manufactures two types of sweaters: type $A$ and type $B.$ It costs $Rs. 360$ to make a type $A$ sweater and $Rs. 120$ to make a type $B$ sweater. The company can make at most $300$ sweaters and spend at most $Rs. 72000$ a day. The number of sweaters of type $B$ cannot exceed the number of sweaters of type $A$ by more than $100.$ The company makes a profit of $Rs. 200$ for each sweater of type $A$ and $Rs. 120$ for every sweater of type $B.$ Formulate this problem as a $LPP$ to maximize the profit to the company.

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(A) Let the company manufacture $x$ number of type $A$ sweaters and $y$ number of type $B$ sweaters.
The company spends at most $Rs. 72000$ a day. Therefore,$360x + 120y \leq 72000$.
Dividing by $120$,we get $3x + y \leq 600 \dots (i)$.
The company can make at most $300$ sweaters in total. Therefore,$x + y \leq 300 \dots (ii)$.
The number of sweaters of type $B$ cannot exceed the number of sweaters of type $A$ by more than $100$. This means $y - x \leq 100$,which can be written as $-x + y \leq 100 \dots (iii)$.
The company makes a profit of $Rs. 200$ for each type $A$ sweater and $Rs. 120$ for each type $B$ sweater. The objective function to maximize profit is $Z = 200x + 120y$.
Thus,the $LPP$ formulation is:
Maximize $Z = 200x + 120y$
Subject to constraints:
$3x + y \leq 600$
$x + y \leq 300$
$-x + y \leq 100$
$x \geq 0, y \geq 0$

Explore More

Similar Questions

The shaded area in the given figure is a solution set for some system of inequations. The maximum value of the function $z=10x+25y$ subject to the linear constraints given by the system is

The objective function $z=x_1+x_2$,subject to $x_1+x_2 \leq 10, -2x_1+3x_2 \leq 15, x_1 \leq 6, x_1, x_2 \geq 0$,has a maximum value at:

The cost function $Z$ is given by $Z = 4x + 6y$. It is to be minimized. The feasible region for this function $Z$ is the shaded region represented in the following figure. Then the minimum value of $Z$ is and occurs at the point:

$A$ manufacturer produces nuts and bolts. It takes $1\, hour$ of work on machine $A$ and $3\, hours$ on machine $B$ to produce a package of nuts. It takes $3\, hours$ on machine $A$ and $1\, hour$ on machine $B$ to produce a package of bolts. He earns a profit of $Rs.\,17.50$ per package on nuts and $Rs.\,7$ per package on bolts. How many packages of each should be produced each day so as to maximise his profit,if he operates his machines for at the most $12\, hours$ a day?

Difficult
View Solution

The shaded area in the figure below is the solution set for a certain linear programming problem. The linear constraints are given by:

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