Advertisements
Advertisements
Question
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. Make an LPP and solve it graphically.
Advertisements
Solution
Let x and y be the number of desktop model and portable model respectively.
Number of desktop model and portable model cannot be negative.
Therefore, x ≥ 0 , y ≥ 0 ,
It is given that the monthly demand will not exist 250 units.
∴ \[x + y \leq 250\]
Cost of desktop and portable model is Rs 25,000 and Rs 40,000 respectively.
Therefore, cost of x desktop model and y portable model is Rs 25,000 and Rs 40,000 respectively and he does not want to invest more than Rs 70 lakhs.
\[25000x + 40000y \leq 7000000\]
Profit on the desktop model is Rs 4500 and on the portable model is Rs 5000. Therefore, profit made by x desktop model and y portable model is Rs 4500x and Rs 5000y respectively.
Total profit = Z = 4500x + 5000y
The mathematical form of the given LPP is:
Maximize Z = 4500x + 5000y
Subject to constraints: \[x + y \leq 250\]
x + y = 250, 25000x + 40000y = 7000000, x = 0 and y = 0
Region represented by x + y ≤ 250:
The line x + y = 250 meets the coordinate axes at A(250, 0) and \[B\left( 0, 250 \right)\] respectively. By joining these points we obtain the line x + y = 250. Clearly (0,0) satisfies the x + y = 250. So, the region which contains the origin represents the solution set of the inequation x + y ≤ 250.
Region represented by 25000x + 40000y ≤ 7000000:
The line 25000x + 40000y = 7000000 meets the coordinate axes at C(280, 0) and \[D\left( 0, 175 \right)\] respectively. By joining these points we obtain the line 25000x + 40000y = 7000000. Clearly (0,0) satisfies the inequation 25000x + 40000y ≤ 7000000. So,the region which contains the origin represents the solution set of the inequation 25000x + 40000y ≤ 7000000.
Region represented by x ≥ 0 and y ≥ 0:
Since, every point in the first quadrant satisfies these inequations. So, the first quadrant is the region represented by the inequations x ≥ 0, and y ≥ 0.
The feasible region determined by the system of constraints x + y ≤ 250, 25000x + 40000y ≤ 7000000, x ≥ 0 and y ≥ 0 are as follows.
The corner points are O(0, 0), D(0, 175), E(200, 50) and A(250, 0).
The values of the objective function Z at corner points of the feasible region are given in the following table:
|
Corner Points |
Z = 4500x + 5000y |
|
| O(0, 0) | 0 | |
|
D(0, 175) |
875000 |
|
|
E(200, 50) |
1150000 |
← Maximum |
|
A(250, 0) |
1125000 |
Clearly, Z is maximum at x = 200 and y = 50 and the maximum value of Z at this point is 1150000.
Thus, 200 desktop models and 50 portable units should be sold to maximize the profit.
APPEARS IN
RELATED QUESTIONS
Minimize `z=4x+5y ` subject to `2x+y>=7, 2x+3y<=15, x<=3,x>=0, y>=0` solve using graphical method.
Minimize :Z=6x+4y
Subject to : 3x+2y ≥12
x+y ≥5
0 ≤x ≤4
0 ≤ y ≤ 4
A manufacturing company makes two types of teaching aids A and B of Mathematics for class XII. Each type of A requires 9 labour hours for fabricating and 1 labour hour for finishing. Each type of B requires 12 labour hours for fabricating and 3 labour hours for finishing. For fabricating and finishing, the maximum labour hours available per week are 180 and 30, respectively. The company makes a profit of Rs 80 on each piece of type A and Rs 120 on each piece of type B. How many pieces of type A and type B should be manufactured per week to get maximum profit? Make it as an LPP and solve graphically. What is the maximum profit per week?
Solve the following L. P. P. graphically:Linear Programming
Minimize Z = 6x + 2y
Subject to
5x + 9y ≤ 90
x + y ≥ 4
y ≤ 8
x ≥ 0, y ≥ 0
Maximise Z = x + 2y subject to the constraints
`x + 2y >= 100`
`2x - y <= 0`
`2x + y <= 200`
Solve the above LPP graphically
Maximize Z = 2x + 3y
Subject to
\[x + y \geq 1\]
\[10x + y \geq 5\]
\[x + 10y \geq 1\]
\[ x, y \geq 0\]
Solved the following linear programming problem graphically:
Maximize Z = 60x + 15y
Subject to constraints
\[x + y \leq 50\]
\[3x + y \leq 90\]
\[ x, y \geq 0\]
A diet for a sick person must contain at least 4000 units of vitamins, 50 units of minerals and 1400 of calories. Two foods A and B, are available at a cost of Rs 4 and Rs 3 per unit respectively. If one unit of A contains 200 units of vitamin, 1 unit of mineral and 40 calories and one unit of food B contains 100 units of vitamin, 2 units of minerals and 40 calories, find what combination of foods should be used to have the least cost?
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 manufacturer has three machines installed in his factory. machines I and II are capable of being operated for at most 12 hours whereas Machine III must operate at least for 5 hours a day. He produces only two items, each requiring the use of three machines. The number of hours required for producing one unit each of the items on the three machines is given in the following table:
| Item | Number of hours required by the machine | ||
A B |
I | II | III |
| 1 2 |
2 1 |
1 5/4 |
|
He makes a profit of Rs 6.00 on item A and Rs 4.00 on item B. Assuming that he can sell all that he produces, how many of each item should he produces so as to maximize his profit? Determine his maximum profit. Formulate this LPP mathematically and then solve it.
A factory uses three different resources for the manufacture of two different products, 20 units of the resources A, 12 units of B and 16 units of C being available. 1 unit of the first product requires 2, 2 and 4 units of the respective resources and 1 unit of the second product requires 4, 2 and 0 units of respective resources. It is known that the first product gives a profit of 2 monetary units per unit and the second 3. Formulate the linear programming problem. How many units of each product should be manufactured for maximizing the profit? 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 manufacturer makes two products A and B. Product A sells at Rs 200 each and takes 1/2 hour to make. Product B sells at Rs 300 each and takes 1 hour to make. There is a permanent order for 14 of product A and 16 of product B. A working week consists of 40 hours of production and weekly turnover must not be less than Rs 10000. If the profit on each of product A is Rs 20 and on product B is Rs 30, then how many of each should be produced so that the profit is maximum. Also, find the maximum profit.
A manufacturer produces two types of steel trunks. He has two machines A and B. For completing, the first types of the trunk requires 3 hours on machine A and 3 hours on machine B, whereas the second type of the trunk requires 3 hours on machine A and 2 hours on machine B. Machines A and B can work at most for 18 hours and 15 hours per day respectively. He earns a profit of Rs 30 and Rs 25 per trunk of the first type and the second type respectively. How many trunks of each type must he make each day to make maximum profit?
A man owns a field of area 1000 sq.m. He wants to plant fruit trees in it. He has a sum of Rs 1400 to purchase young trees. He has the choice of two types of trees. Type A requires 10 sq.m of ground per tree and costs Rs 20 per tree and type B requires 20 sq.m of ground per tree and costs Rs 25 per tree. When fully grown, type A produces an average of 20 kg of fruit which can be sold at a profit of Rs 2.00 per kg and type B produces an average of 40 kg of fruit which can be sold at a profit of Rs. 1.50 per kg. How many of each type should be planted to achieve maximum profit when the trees are fully grown? What is the 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 company sells two different products, A and B. The two products are produced in a common production process, which has a total capacity of 500 man-hours. It takes 5 hours to produce a unit of A and 3 hours to produce a unit of B. The market has been surveyed and company officials feel that the maximum number of unit of A that can be sold is 70 and that for B is 125. If the profit is Rs 20 per unit for the product A and Rs 15 per unit for the product B, how many units of each product should be sold to maximize profit?
A cooperative society of farmers has 50 hectares of land to grow two crops X and Y. The profits from crops X and Y per hectare are estimated as ₹10,500 and ₹9,000 respectively. To control weeds, a liquid herbicide has to be used for crops X and Y at the rate of 20 litres and 10 litres per hectare, respectively. Further not more than 800 litres of herbicide should be used in order to protect fish and wildlife using a pond which collects drainage from this land. How much land should be allocated to each crop so as to maximise the total profit of the society?
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.
There are two types of fertilizers F1 and F2. F1 consists of 10% nitrogen and 6% phosphoric acid and F2 consists of 5% nitrogen and 10% phosphoric acid. After testing the soil conditions, a farmer finds the she needs atleast 14 kg of nitrogen and 14 kg of phosphoric acid for her crop. If F1 costs ₹6/kg and F2 costs ₹5/kg, determine how much of each type of fertilizer should be used so that the nutrient requirements are met at minimum cost. What is the minimum cost?
There are two types of fertilisers 'A' and 'B' . 'A' consists of 12% nitrogen and 5% phosphoric acid whereas 'B' consists of 4% nitrogen and 5% phosphoric acid. After testing the soil conditions, farmer finds that he needs at least 12 kg of nitrogen and 12 kg of phosphoric acid for his crops. If 'A' costs ₹10 per kg and 'B' cost ₹8 per kg, then graphically determine how much of each type of fertiliser should be used so that nutrient requiremnets are met at a minimum cost
By graphical method, the solution of linear programming problem
\[\text{ Subject } to \text{ 3 } x_1 + 2 x_2 \leq 18\]
\[ x_1 \leq 4\]
\[ x_2 \leq 6\]
\[ x_1 \geq 0, x_2 \geq 0, \text{ is } \]
Maximize: z = 3x + 5y Subject to
x +4y ≤ 24 3x + y ≤ 21
x + y ≤ 9 x ≥ 0 , y ≥0
A company manufactures two types of novelty souvenirs made of plywood. Souvenirs of type A
require 5 minutes each for cutting and 10 minutes each for assembling. Souvenirs of type B require 8 minutes each for cutting and 8 minutes each for assembling. There are 3 hours and 20 minutes available for cutting and 4 hours available for assembling. The profit is Rs. 50 each for type A and Rs. 60 each for type B souvenirs. How many souvenirs of each type should the company manufacture in order to maximize profit? Formulate the above LPP and solve it graphically and also find the maximum profit.
The graph of the inequality 3X − 4Y ≤ 12, X ≤ 1, X ≥ 0, Y ≥ 0 lies in fully in
Maximum value of 4x + 13y subject to constraints x ≥ 0, y ≥ 0, x + y ≤ 5 and 3x + y ≤ 9 is ______.
Maximise and Minimise Z = 3x – 4y subject to x – 2y ≤ 0, – 3x + y ≤ 4, x – y ≤ 6, x, y ≥ 0
Let R be the feasible region for a linear programming problem, and let Z = ax + by be the objective function. If R is bounded, then ____________.
The maximum value of Z = 3x + 4y subjected to contraints x + y ≤ 40, x + 2y ≤ 60, x ≥ 0 and y ≥ 0 is ____________.
The corner points of the shaded unbounded feasible region of an LPP are (0, 4), (0.6, 1.6) and (3, 0) as shown in the figure. The minimum value of the objective function Z = 4x + 6y occurs at ______.
The maximum value of 2x + y subject to 3x + 5y ≤ 26 and 5x + 3y ≤ 30, x ≥ 0, y ≥ 0 is ______.
The shaded part of given figure indicates in feasible region, then the constraints are:
Solve the following linear programming problem graphically:
Minimize: Z = 5x + 10y
Subject to constraints:
x + 2y ≤ 120, x + y ≥ 60, x – 2y ≥ 0, x ≥ 0, 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.
Find feasible solution for the following system of linear inequation graphically.
3x + 4y ≥ 12, 4x + 7y ≤ 28, x ≥ 0, y ≥ 0
The solution set of constraints x + 2y ≥ 11, 3x + 4y ≤ 30, 2x + 5y ≤ 30 and x ≥ 0, y ≥ 0, includes the point ______.
