Advertisements
Advertisements
Question
A cottage industry manufactures pedestal lamps and wooden shades, each requiring the use of grinding/cutting machine and sprayer. It takes 2 hours on the grinding/cutting machine and 3 hours on the sprayer to manufacture a pedestal lamp while it takes 1 hour on the grinding/cutting machine and 2 hours on the sprayer to manufacture a shade. On any day, the sprayer is available for at most 20 hours and the grinding/cutting machine for at most 12 hours. The profit from the sale of a lamp is ₹5.00 and a shade is ₹3.00. Assuming that the manufacturer sell all the lamps and shades that he produces, how should he schedule his daily production in order to maximise his profit?
Solution
Suppose x units of pedestal lamps and y units of wooden shades are produced on a day to maximise the profit.
Since a pedestal lamp requires 2 hours on the grinding/cutting machine and a wooden shade requires 1 hour on the grinding/cutting machine, therefore, the total hours required for grinding/cutting x units of pedestal lamps and y units of wooden shades are (2x + y). But, the grinding/cutting machine is available for at most 12 hours on a day.
∴ 2x + y ≤ 12
Similarly, a pedestal lamp requires 3 hours on the sprayer and a wooden shade requires 2 hours on the sprayer, therefore, the total hours required for spraying x units of pedestal lamps and y units of wooden shades are (3x + 2y). But, the sprayer is available for at most 20 hours on a day.
∴ 3x + 2y ≤ 20
The profit from the sale of a pedestal lamp is ₹5.00 and a wooden shade is ₹3.00. Therefore, the total profit from the sale of x units of pedestal lamps and y units of wooden shades is ₹(5x + 3y).
Thus, the given linear programming problem is
Maximise Z = 5x + 3y
subject to the constraints
2x + y ≤ 12
3x + 2y ≤ 20
x, y ≥ 0
The feasible region determined by the given constraints can be diagrammatically represented as,
The coordinates of the corner points of the feasible region are O(0, 0), A(6, 0), B(4, 4) and C(0, 10).
The value of the objective function at these points are given in the following table.
| Corner Point | Z = 5x + 3y |
| (0, 0) | 5 × 0 + 3 × 0 = 0 |
| (6, 0) | 5 × 6 + 3 × 0 = 30 |
| (4, 4) | 5 × 4 + 3 × 4 = 32 → Maximum |
| (0, 10) | 5 × 0 + 3 × 10 = 30 |
The maximum value of Z is 32 at x = 4, y = 4.
Hence, the manufacturer should produce 4 pedestal lamps and 4 wooden shades to maximise his profit. The maximum profit of the manufacturer is ₹32 on a day.
APPEARS IN
RELATED QUESTIONS
Solve the following L.P.P. graphically:
Minimise Z = 5x + 10y
Subject to x + 2y ≤ 120
Constraints x + y ≥ 60
x – 2y ≥ 0 and x, y ≥ 0
Solve the following L.P.P. graphically Maximise Z = 4x + y
Subject to following constraints x + y ≤ 50
3x + y ≤ 90,
x ≥ 10
x, y ≥ 0
Maximize Z = 9x + 3y
Subject to
\[2x + 3y \leq 13\]
\[ 3x + y \leq 5\]
\[ x, y \geq 0\]
Maximize Z = 50x + 30y
Subject to
\[2x + y \leq 18\]
\[3x + 2y \leq 34\]
\[ x, y \geq 0\]
Minimize Z = 30x + 20y
Subject to
\[x + y \leq 8\]
\[ x + 4y \geq 12\]
\[5x + 8y = 20\]
\[ x, y \geq 0\]
Maximize Z = 3x1 + 4x2, if possible,
Subject to the constraints
\[x_1 - x_2 \leq - 1\]
\[ - x_1 + x_2 \leq 0\]
\[ x_1 , x_2 \geq 0\]
Find the minimum value of 3x + 5y subject to the constraints
− 2x + y ≤ 4, x + y ≥ 3, x − 2y ≤ 2, x, y ≥ 0.
To maintain one's health, a person must fulfil certain minimum daily requirements for the following three nutrients: calcium, protein and calories. The diet consists of only items I and II whose prices and nutrient contents are shown below:
| Food I | Food II | Minimum daily requirement | |
| Calcium Protein Calories |
10 5 2 |
4 6 6 |
20 20 12 |
| Price | Rs 0.60 per unit | Rs 1.00 per unit |
Find the combination of food items so that the cost may be minimum.
A hospital dietician wishes to find the cheapest combination of two foods, A and B, that contains at least 0.5 milligram of thiamin and at least 600 calories. Each unit of Acontains 0.12 milligram of thiamin and 100 calories, while each unit of B contains 0.10 milligram of thiamin and 150 calories. If each food costs 10 paise per unit, how many units of each should be combined at a minimum cost?
Reshma wishes to mix two types of food P and Q in such a way that the vitamin contents of the mixture contains at least 8 units of vitamin A and 11 units of vitamin B. Food P costs ₹60/kg and food Q costs ₹80/kg. Food P contains 3 units/kg of vitamin A and 5 units/kg of vitamin B while food Q contains 4 units/kg of vitamin A and 2 units/kg of vitamin B. Determine the minimum cost of the mixture.
A dietician has to develop a special diet using two foods P and Q. Each packet (containing 30 g) of food P contains 12 units of calcium, 4 units of iron, 6 units of cholesterol and 6 units of vitamin A. Each packet of the same quantity of food Q contains 3 units of calcium, 20 units of iron, 4 units of cholesterol and 3 units of vitamin A. The diet requires atleast 240 units of calcium, atleast 460 units of iron and at most 300 units of cholesterol. How many packets of each food should be used to minimise the amount of vitamin A in the diet? What is the minimum of vitamin A.
A farmer mixes two brands P and Q of cattle feed. Brand P, costing ₹250 per bag, contains 2 units of nutritional element A, 2.5 units of element B and 2 units of element C. Brand Q costing ₹200 per bag contains 1.5 units of nutritional element A, 11.25 units of element B and 3 units of element C. The minimum requirements of nutrients A, B and C are 18 units, 45 units and 24 units respectively. Determine the number of bags of each brand which should be mixed in order to produce a mixture having a minimum cost per bag? What is the minimum cost of the mixture per bag?
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 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 ₹16 and one kg of food Y costs ₹20. Find the least cost of the mixture which will produce the required diet?
A firm manufacturing two types of electric items, A and B, can make a profit of Rs 20 per unit of A and Rs 30 per unit of B. Each unit of A requires 3 motors and 4 transformers and each unit of B requires 2 motors and 4 transformers. The total supply of these per month is restricted to 210 motors and 300 transformers. Type B is an export model requiring a voltage stabilizer which has a supply restricted to 65 units per month. Formulate the linear programing problem for maximum profit and solve it graphically.
A firm manufactures headache pills in two sizes A and B. Size A contains 2 grains of aspirin, 5 grains of bicarbonate and 1 grain of codeine; size B contains 1 grain of aspirin, 8 grains of bicarbonate and 66 grains of codeine. It has been found by users that it requires at least 12 grains of aspirin, 7.4 grains of bicarbonate and 24 grains of codeine for providing immediate effects. Determine graphically the least number of pills a patient should have to get immediate relief. Determine also the quantity of codeine consumed by patient.
A company manufactures two articles A and B. There are two departments through which these articles are processed: (i) assembly and (ii) finishing departments. The maximum capacity of the first department is 60 hours a week and that of other department is 48 hours per week. The product of each unit of article A requires 4 hours in assembly and 2 hours in finishing and that of each unit of B requires 2 hours in assembly and 4 hours in finishing. If the profit is Rs 6 for each unit of A and Rs 8 for each unit of B, find the number of units of A and B to be produced per week in order to have maximum profit.
A firm makes items A and B and the total number of items it can make in a day is 24. It takes one hour to make an item of A and half an hour to make an item of B. The maximum time available per day is 16 hours. The profit on an item of A is Rs 300 and on one item of B is Rs 160. How many items of each type should be produced to maximize the profit? Solve the problem graphically.
A factory makes tennis rackets and cricket bats. A tennis racket takes 1.5 hours of machine time and 3 hours of craftman's time in its making while a cricket bat takes 3 hours of machine time and 1 hour of craftman's time. In a day, the factory has the availability of not more than 42 hours of machine time and 24 hours of craftman's time.
(i) What number of rackets and bats must be made if the factory is to work at full capacity?
(ii) 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.
A merchant plans to sell two types of personal computers a desktop model and a portable model that will cost Rs 25,000 and Rs 40,000 respectively. He estimates that the total monthly demand of computers will not exceed 250 units. Determine the number of units of each type of computers which the merchant should stock to get maximum profit if he does not want to invest more than Rs 70 lakhs and his profit on the desktop model is Rs 4500 and on the portable model is Rs 5000.
There are two factories located one at place P and the other at place Q. From these locations, a certain commodity is to be delivered to each of the three depots situated at A, B and C. The weekly requirements of the depots are respectively 5, 5 and 4 units of the commodity while the production capacity of the factories at P and Q are respectively 8 and 6 units. The cost of transportation per unit is given below:
| From \ To | Cost (in ₹) | ||
| A | B | C | |
| P | 160 | 100 | 150 |
| Q | 100 | 120 | 100 |
How many units should be transported from each factory to each depot in order that the transportation cost is minimum. What will be the minimum transportation cost?
A manufacturer produces two products A and B. Both the products are processed on two different machines. The available capacity of first machine is 12 hours and that of second machine is 9 hours per day. Each unit of product A requires 3 hours on both machines and each unit of product B requires 2 hours on first machine and 1 hour on second machine. Each unit of product A is sold at ₹7 profit and that of B at a profit of ₹4. Find the production level per day for maximum profit graphically.
Tow godowns, A and B, have grain storage capacity of 100 quintals and 50 quintals respectively. They supply to 3 ration shops, D, E and F, whose requirements are 60, 50 and 40 quintals respectively. The cost of transportation per quintal from the godowns to the shops are given in the following table:
| Transportation cost per quintal(in Rs.) | ||
| From-> | A | B |
| To | ||
| D | 6.00 | 4.00 |
| E | 3.00 | 2.00 |
| F | 2.50 | 3.00 |
How should the supplies be transported in order that the transportation cost is minimum?
The value of objective function is maximum under linear constraints ______.
A manufacturer has employed 5 skilled men and 10 semi-skilled men and makes two models A and B of an article. The making of one item of model A requires 2 hours of work by a skilled man and 2 hours work by a semi-skilled man. One item of model B requires 1 hour by a skilled man and 3 hours by a semi-skilled man. No man is expected to work more than 8 hours per day. The manufacturer's profit on an item of model A is ₹ 15 and on an item of model B is ₹ 10. How many items of each model should be made per day in order to maximize daily profit? Formulate the above LPP and solve it graphically and find the maximum profit.
Draw the graph of inequalities x ≤ 6, y −2 ≤ 0, x ≥ 0, y ≥ 0 and indicate the feasible region
The minimum value of z = 2x + 9y subject to constraints x + y ≥ 1, 2x + 3y ≤ 6, x ≥ 0, y ≥ 0 is ______.
The feasible region of an LPP is shown in the figure. If z = 3x + 9y, then the minimum value of z occurs at ______.
For the LPP, maximize z = x + 4y subject to the constraints x + 2y ≤ 2, x + 2y ≥ 8, x, y ≥ 0 ______.
The constraints of an LPP are 7 ≤ x ≤ 12, 8 ≤ y ≤ 13. Determine the vertices of the feasible region formed by them.
The point which provides the solution to the linear programming problem: Max P = 2x + 3y subject to constraints: x ≥ 0, y ≥ 0, 2x + 2y ≤ 9, 2x + y ≤ 7, x + 2y ≤ 8, is ______
In Corner point method for solving a linear programming problem the first step is to ____________.
A feasible solution to a linear programming problem
The maximum value of Z = 3x + 4y subjected to contraints x + y ≤ 40, x + 2y ≤ 60, x ≥ 0 and y ≥ 0 is ____________.
The solution set of the inequality 3x + 5y < 4 is ______.
The objective function Z = x1 + x2, subject to the constraints are x1 + x2 ≤ 10, – 2x1 + 3x2 ≤ 15, x1 ≤ 6, x1, x2 ≥ 0, has maximum value ______ of the feasible region.
Solve the following Linear Programming Problem graphically:
Minimize: z = x + 2y,
Subject to the constraints: x + 2y ≥ 100, 2x – y ≤ 0, 2x + y ≤ 200, x, y ≥ 0.
If x – y ≥ 8, x ≥ 3, y ≥ 3, x ≥ 0, y ≥ 0 then find the coordinates of the corner points of the feasible region.
