Advertisements
Advertisements
Question
A company makes 3 model 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 calculator of model B and 4800 calculator 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 everyday. 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 minimise the operating costs and still meet the demand.
Advertisements
Solution
Let factory I be operated for x days and II for y days.
At factory I: 50 calculators of model A and at factory II, 40 calculators of model A are made everyday.
Company has orders of atleast 6400 calculators of model A.
∴ 50x + 40y ≥ 6400
⇒ 5x + 4y ≥ 640
Also, at factory I, 50 calculators of model B and at factory II, 20 calculators of model B are made everyday
Company has the orders of atleast 4000 of calculators of model B.
∴ 50x + 20y ≥ 4000
⇒ 5x + 2y ≥ 4000
Similarly for model C,
30x + 40y ≥ 4800
⇒ 3x + 4y ≥ 480
And x ≥ 0, y ≥ 0
It costs ₹ 12,000 and ₹ 15000 to operate the factories I and II each day.
∴ Required LPP is
Minimise Z = 12000x + 15000y subject to the constraints
5x + 4y ≥ 640 ......(i)
5x + 2y ≥ 400 .......(ii)
3x + 4y ≥ 480 .......(iii)
x ≥ 0, y ≥ 0 .......(iv)
Table for (i) equation 5x + 4y = 640
| x | 0 | 128 |
| y | 160 | 0 |
Table for (ii) equation 5x + 2y = 400
| x | 0 | 80 |
| y | 200 | 0 |
Table for (iii) equation 3x + 4y = 480
| x | 0 | 160 |
| y | 120 | 0 |
On solving equation (i) and (iii), we get
x = 80, y = 60
On solving equation (i) and (ii) we get
x = 32 and y = 120
From the graph, we see that the feasible region ABCD is open unbounded whose corners are A(160, 0), B(80, 60), C(32, 120) and D(0, 200).
Let us find the values of Z.
| Corner points | Value of Z = 12000x + 15000y | |
| A(160, 0) | Z = 12000(160) + 0 = 1920000 | |
| B(80, 60) | Z = 12000(80) + 15000(60) = 1860000 | ← Minimum |
| C(32, 120) | Z = 12000(32) + 15000(120) = 2184000 | |
| D(0, 200) | Z = 0 + 15000(200) = 3000000 |
From the above table, it is clear that the value of Z = 1860000 may or may not be minimum for an open unbounded region.
Now, to decide this, we draw a graph of 12000x + 15000y < 1860000
⇒ 4x + 5y < 620
And we have to check whether there is a common point in this feasible region or not.
So, from the graph, there is no common point.
∴ Z = 12000x + 15000y has minimum value 1860000 at (80, 60).
Factory I: 80 days
Factory II: 60 days.
APPEARS IN
RELATED QUESTIONS
Solve the following Linear Programming Problems graphically:
Maximise Z = 3x + 4y
subject to the constraints : x + y ≤ 4, x ≥ 0, y ≥ 0.
Solve the following Linear Programming Problems graphically:
Maximise Z = 3x + 2y
subject to x + 2y ≤ 10, 3x + y ≤ 15, x, y ≥ 0.
Show that the minimum of Z occurs at more than two points.
Minimise and Maximise Z = x + 2y
subject to x + 2y ≥ 100, 2x – y ≤ 0, 2x + y ≤ 200; x, y ≥ 0.
Refer to Example 9. How many packets of each food should be used to maximize the amount of vitamin A in the diet? What is the maximum amount of vitamin A in the diet?
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 content of one kg food is 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?
A manufacturer makes two types of toys A and B. Three machines are needed for this purpose and the time (in minutes) required for each toy on the machines is given below:
| Type of toy | Machines | ||
| I | II | III | |
| A | 12 | 18 | 6 |
| B | 6 | 0 | 9 |
Each machine is available for a maximum of 6 hours per day. If the profit on each toy of type A is Rs 7.50 and that on each toy of type B is Rs 5, show that 15 toys of type A and 30 of type B should be manufactured in a day to get maximum profit.
A small firm manufactures necklaces and bracelets. The total number of necklaces and bracelets that it can handle per day is at most 24. It takes one hour to make a bracelet and half an hour to make a necklace. The maximum number of hours available per day is 16. If the profit on a necklace is Rs 100 and that on a bracelet is Rs 300. Formulate on L.P.P. for finding how many of each should be produced daily to maximize the profit?
It is being given that at least one of each must be produced.
The feasible region for a LPP is shown in Figure. Find the minimum value of Z = 11x + 7y
Refer to Exercise 7 above. Find the maximum value of Z.
In figure, the feasible region (shaded) for a LPP is shown. Determine the maximum and minimum value of Z = x + 2y.
Refer to question 14. How many sweaters of each type should the company make in a day to get a maximum profit? What is the maximum profit.
Refer to question 15. Determine the maximum distance that the man can travel.
The feasible solution for a LPP is shown in Figure. Let Z = 3x – 4y be the objective function. Minimum of Z occurs at ______.
Refer to Question 27. Maximum of Z occurs at ______.
The feasible region for an LPP is shown in the figure. Let F = 3x – 4y be the objective function. Maximum value of F is ______.
Refer to Question 30. Minimum value of F is ______.
Corner points of the feasible region for an LPP are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5). Let F = 4x + 6y be the objective function. The Minimum value of F occurs at ______.
Refer to Question 32, Maximum of F – Minimum of F = ______.
In a LPP, the linear inequalities or restrictions on the variables are called ____________.
If the feasible region for a LPP is unbounded, maximum or minimum of the objective function Z = ax + by may or may not exist.
Maximum value of the objective function Z = ax + by in a LPP always occurs at only one corner point of the feasible region.
In a LPP, the minimum value of the objective function Z = ax + by is always 0 if the origin is one of the corner point of the feasible region.
The maximum value of the object function Z = 5x + 10 y subject to the constraints x + 2y ≤ 120, x + y ≥ 60, x - 2y ≥ 0, x ≥ 0, y ≥ 0 is ____________.
Z = 7x + y, subject to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0. The minimum value of Z occurs at ____________.
In Corner point method for solving a linear programming problem, one finds the feasible region of the linear programming problem, determines its corner points, and evaluates the objective function Z = ax + by at each corner point. Let M and m respectively be the largest and smallest values at corner points. In case the feasible region is unbounded, m is the minimum value of the objective function.
Maximize Z = 3x + 5y, subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0.
Maximize Z = 4x + 6y, subject to 3x + 2y ≤ 12, x + y ≥ 4, x, y ≥ 0.
Maximize Z = 10 x1 + 25 x2, subject to 0 ≤ x1 ≤ 3, 0 ≤ x2 ≤ 3, x1 + x2 ≤ 5.
Maximize Z = 10×1 + 25×2, subject to 0 ≤ x1 ≤ 3, 0 ≤ x2 ≤ 3, x1 + x2 ≤ 5.
