$A$ company makes $3$ models of calculators: $A, B$ and $C$ at factory $I$ and factory $II.$ The company has orders for at least $6400$ calculators of model $A, 4000$ calculators of model $B$ and $4800$ calculators of model $C.$ At factory $I, 50$ calculators of model $A, 50$ of model $B$ and $30$ of model $C$ are made every day; at factory $II, 40$ calculators of model $A, 20$ of model $B$ and $40$ of model $C$ are made every day. It costs $Rs. 12000$ and $Rs. 15000$ each day to operate factory $I$ and $II,$ respectively. Find the number of days each factory should operate to minimize the operating costs and still meet the demand.

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(B) Let factory $I$ operate for $x$ days and factory $II$ operate for $y$ days.
At factory $I, 50$ calculators of model $A$ and at factory $II, 40$ calculators of model $A$ are made every day. The company has orders for at least $6400$ calculators of model $A$.
$\therefore 50x + 40y \geq 6400 \Rightarrow 5x + 4y \geq 640$
At factory $I, 50$ calculators of model $B$ and at factory $II, 20$ calculators of model $B$ are made every day. The company has orders for at least $4000$ calculators of model $B$.
$\therefore 50x + 20y \geq 4000 \Rightarrow 5x + 2y \geq 400$
At factory $I, 30$ calculators of model $C$ and at factory $II, 40$ calculators of model $C$ are made every day. The company has orders for at least $4800$ calculators of model $C$.
$\therefore 30x + 40y \geq 4800 \Rightarrow 3x + 4y \geq 480$
Also,$x \geq 0, y \geq 0.$
We have to minimize the cost $Z = 12000x + 15000y$ subject to the constraints:
$5x + 4y \geq 640$
$5x + 2y \geq 400$
$3x + 4y \geq 480$
$x, y \geq 0$
The feasible region is unbounded with corner points $A(160, 0), B(80, 60), C(32, 120),$ and $D(0, 200).$
Corner pointsValue of $Z = 12000x + 15000y$
$(160, 0)$$1920000$
$(80, 60)$$1860000$ (Minimum)
$(32, 120)$$2184000$
$(0, 200)$$3000000$

To verify the minimum,we plot $12000x + 15000y < 1860000$ or $4x + 5y < 620.$ As shown in the figure,there are no common points with the feasible region,so the minimum value is $1860000.$
Thus,factory $I$ should operate for $80$ days and factory $II$ should operate for $60$ days.

Explore More

Similar Questions

The constraints $-x_{1} + x_{2} \leq 1$,$-x_{1} + 3x_{2} \leq 9$,$x_{1}, x_{2} \geq 0$ define:

The optimal solution of the $L$.$P$.$P$. Maximize $Z = 8x + 3y$ subject to the constraints $x + y \leq 3, 4x + y \leq 6, x \geq 0, y \geq 0$ is

$A$ factory makes tennis rackets and cricket bats. $A$ tennis racket takes $1.5 \text{ hours}$ of machine time and $3 \text{ hours}$ of craftsman's time in its making,while a cricket bat takes $3 \text{ hours}$ of machine time and $1 \text{ hour}$ of craftsman's time. In a day,the factory has the availability of not more than $42 \text{ hours}$ of machine time and $24 \text{ hours}$ of craftsman's time. If the profit on a racket and on a bat is $Rs. 20$ and $Rs. 10$ respectively,find the maximum profit of the factory when it works at full capacity.

Difficult
View Solution

$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

The minimum value for the $LPP$ $Z = 6x + 2y$,subject to $2x + y \geq 16$,$x \geq 6$,$y \geq 1$ 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