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.
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\]
\[25000x + 40000y \leq 7000000\]
x ≥ 0 , y ≥ 0
First we will convert inequations into equations as follows:
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
Solve the following LPP by using graphical method.
Maximize : Z = 6x + 4y
Subject to x ≤ 2, x + y ≤ 3, -2x + y ≤ 1, x ≥ 0, y ≥ 0.
Also find maximum value of Z.
Minimum and maximum z = 5x + 2y subject to the following constraints:
x-2y ≤ 2
3x+2y ≤ 12
-3x+2y ≤ 3
x ≥ 0,y ≥ 0
In order to supplement daily diet, a person wishes to take X and Y tablets. The contents (in milligrams per tablet) of iron, calcium and vitamins in X and Y are given as below :
| Tablets | Iron | Calcium | Vitamin |
| x | 6 | 3 | 2 |
| y | 2 | 3 | 4 |
The person needs to supplement at least 18 milligrams of iron, 21 milligrams of calcium and 16 milligrams of vitamins. The price of each tablet of X and Y is Rs 2 and Rs 1 respectively. How many tablets of each type should the person take in order to satisfy the above requirement at the minimum cost? Make an LPP and solve graphically.
Maximize Z = 9x + 3y
Subject to
2x + 3y ≤ 13
3x + y ≤ 5
x, y ≥ 0
Maximize Z = 3x + 5y
Subject to
\[x + 2y \leq 20\]
\[x + y \leq 15\]
\[ y \leq 5\]
\[ x, y \geq 0\]
Minimize Z = 3x1 + 5x2
Subject to
\[x_1 + 3 x_2 \geq 3\]
\[ x_1 + x_2 \geq 2\]
\[ x_1 , x_2 \geq 0\]
Solve the following LPP graphically:
Maximize Z = 20 x + 10 y
Subject to the following constraints
\[x +\]2\[y \leq\]28
3x+ \[y \leq\]24
\[x \geq\] 2x.
\[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?
A diet is to contain at least 80 units of vitamin A and 100 units of minerals. Two foods F1and F2 are available. Food F1 costs Rs 4 per unit and F2 costs Rs 6 per unit one unit of food F1 contains 3 units of vitamin A and 4 units of minerals. One unit of food F2contains 6 units of vitamin A and 3 units of minerals. Formulate this as a linear programming problem and find graphically the minimum cost for diet that consists of mixture of these foods and also meets the mineral nutritional requirements
A company produces two types of goods, A and B, that require gold and silver. Each unit of type A requires 3 gm of silver and 1 gm of gold while that of type B requires 1 gm of silver and 2 gm of gold. The company can produce 9 gm of silver and 8 gm of gold. If each unit of type A brings a profit of Rs 40 and that of type B Rs 50, find the number of units of each type that the company should produce to maximize the profit. What is the maximum profit?
A manufacturer of Furniture makes two products : chairs and tables. processing of these products is done on two machines A and B. A chair requires 2 hrs on machine A and 6 hrs on machine B. A table requires 4 hrs on machine A and 2 hrs on machine B. There are 16 hrs of time per day available on machine A and 30 hrs on machine B. Profit gained by the manufacturer from a chair and a table is Rs 3 and Rs 5 respectively. Find with the help of graph what should be the daily production of each of the two products so as to maximize his profit.
A publisher sells a hard cover edition of a text book for Rs 72.00 and paperback edition of the same ext for Rs 40.00. Costs to the publisher are Rs 56.00 and Rs 28.00 per book respectively in addition to weekly costs of Rs 9600.00. Both types require 5 minutes of printing time, although hardcover requires 10 minutes binding time and the paperback requires only 2 minutes. Both the printing and binding operations have 4,800 minutes available each week. How many of each type of book should be produced in order to maximize profit?
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 firm manufactures two types of products A and B and sells them at a profit of Rs 5 per unit of type A and Rs 3 per unit of type B. Each product is processed on two machines M1 and M2. One unit of type A requires one minute of processing time on M1 and two minutes of processing time on M2, whereas one unit of type B requires one minute of processing time on M1 and one minute on M2. Machines M1 and M2 are respectively available for at most 5 hours and 6 hours in a day. Find out how many units of each type of product should the firm produce a day in order to maximize the profit. Solve the problem graphically.
A company manufactures two types of toys A and B. Type A requires 5 minutes each for cutting and 10 minutes each for assembling. Type B requires 8 minutes each for cutting and 8 minutes each for assembling. There are 3 hours available for cutting and 4 hours available for assembling in a day. The profit is Rs 50 each on type A and Rs 60 each on type B. How many toys of each type should the company manufacture in a day to maximize the profit?
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?
A medical company has factories at two places, A and B. From these places, supply is made to each of its three agencies situated at P, Q and R. The monthly requirements of the agencies are respectively 40, 40 and 50 packets of the medicines, while the production capacity of the factories, A and B, are 60 and 70 packets respectively. The transportation cost per packet from the factories to the agencies are given below:
| Transportation Cost per packet(in Rs.) | ||
| From-> | A | B |
| To | ||
| P | 5 | 4 |
| Q | 4 | 2 |
| R | 3 | 5 |
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 } \]
A company manufactures two types of cardigans: type A and type B. It costs ₹ 360 to make a type A cardigan and ₹ 120 to make a type B cardigan. The company can make at most 300 cardigans and spend at most ₹ 72000 a day. The number of cardigans of type B cannot exceed the number of cardigans of type A by more than 200. The company makes a profit of ₹ 100 for each cardigan of type A and ₹ 50 for every cardigan of type B.
Formulate this problem as a linear programming problem to maximize the profit to the company. Solve it graphically and find the maximum profit.
The maximum value of z = 6x + 8y subject to x - y ≥ 0, x + 3y ≤ 12, x ≥ 0, y ≥ 0 is ______.
For the LPP, maximize z = x + 4y subject to the constraints x + 2y ≤ 2, x + 2y ≥ 8, x, y ≥ 0 ______.
Maximise and Minimise Z = 3x – 4y subject to x – 2y ≤ 0, – 3x + y ≤ 4, x – y ≤ 6, x, y ≥ 0
Corner points of the feasible region determined by the system of linear constraints are (0, 3), (1, 1) and (3, 0). Let Z = px + qy, where p, q > 0. Condition on p and q so that the minimum of Z occurs at (3, 0) and (1, 1) is ______.
A feasible region in the set of points which satisfy ____________.
A set of values of decision variables which satisfies the linear constraints and nn-negativity conditions of an L.P.P. is called its ____________.
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 ____________.
A feasible solution to a linear programming problem
Which of the statements describe the solution set for `-2(x + 8) = - 2x + 20`?
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 z = 5x + 2y, subject to the constraints x + y ≤ 7, x + 2y ≤ 10, x, y ≥ 0 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.
The objective function Z = ax + by of an LPP has maximum vaiue 42 at (4, 6) and minimum value 19 at (3, 2). Which of the following is true?
Solve the following Linear Programming problem graphically:
Maximize: Z = 3x + 3.5y
Subject to constraints:
x + 2y ≥ 240,
3x + 1.5y ≥ 270,
1.5x + 2y ≤ 310,
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 ______.
What is a corner point of a feasible region?
Which description represents an unbounded region?
What is the result if no feasible region exists?
