Advertisements
Advertisements
प्रश्न
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.
Advertisements
उत्तर
Let the number of size A pill be x and the number of size B pill be y.
Therefore, the constraints are
\[\begin{array}{lc}2x + y \geq 12 & \\ 5x + 8y \geq 7 . 4 & \\ x + 66y \geq 24 &\end{array}\]
z = x + y which is to be minimised
The corner points are (0, 12), (24, 0) and \[\left( \frac{768}{131}, \frac{36}{131} \right)\]
The values of Z at these corner points are as follows
| Corner point | Z = x + y |
| (0, 12) | 12 |
| (24, 0) | 24 |
|
\[\left( \frac{768}{131}, \frac{36}{131} \right)\]
|
6.1373 |
The minimum value of Z is 6.1373 but the region is unbounded so check whether x + y < 6.1373 has common region with the feasible solution.
Clearly, it can be seen that it doesn't has any common region.
APPEARS IN
संबंधित प्रश्न
Minimize `z=4x+5y ` subject to `2x+y>=7, 2x+3y<=15, x<=3,x>=0, y>=0` solve using graphical method.
A dealer in rural area wishes to purchase a number of sewing machines. He has only Rs 5,760 to invest and has space for at most 20 items for storage. An electronic sewing machine cost him Rs 360 and a manually operated sewing machine Rs 240. He can sell an electronic sewing machine at a profit of Rs 22 and a manually operated sewing machine at a profit of Rs 18. Assuming that he can sell all the items that he can buy, how should he invest his money in order to maximize his profit? Make it as a LPP and solve it graphically.
Solve the following L.P.P graphically:
Maximize: Z = 10x + 25y
Subject to: x ≤ 3, y ≤ 3, x + y ≤ 5, x ≥ 0, y ≥ 0
A dietician wishes to mix 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 arid 8 units of vitamin C. The vitamin contents of one kg food is given below:
| Food | Vitamin A | Vitamin.B | Vitamin C |
| X | 1 unit | 2 unit | 3 unit |
| Y | 2 unit | 2 unit | 1 unit |
Orie kg of food X costs Rs 24 and one kg of food Y costs Rs 36. Using Linear Programming, find the least cost of the total mixture. which will contain the required vitamins.
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.
Maximise z = 8x + 9y subject to the constraints given below :
2x + 3y ≤ 6
3x − 2y ≤6
y ≤ 1
x, y ≥ 0
Maximize Z = 5x + 3y
Subject to
\[3x + 5y \leq 15\]
\[5x + 2y \leq 10\]
\[ x, y \geq 0\]
Minimize Z = 18x + 10y
Subject to
\[4x + y \geq 20\]
\[2x + 3y \geq 30\]
\[ x, y \geq 0\]
Maximize Z = 10x + 6y
Subject to
\[3x + y \leq 12\]
\[2x + 5y \leq 34\]
\[ x, y \geq 0\]
Maximize Z = 3x + 4y
Subject to
\[2x + 2y \leq 80\]
\[2x + 4y \leq 120\]
Maximize Z = −x1 + 2x2
Subject to
\[- x_1 + 3 x_2 \leq 10\]
\[ x_1 + x_2 \leq 6\]
\[ x_1 - x_2 \leq 2\]
\[ x_1 , x_2 \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 factory manufactures two types of screws, A and B, each type requiring the use of two machines - an automatic and a hand-operated. It takes 4 minute on the automatic and 6 minutes on the hand-operated machines to manufacture a package of screws 'A', while it takes 6 minutes on the automatic and 3 minutes on the hand-operated machine to manufacture a package of screws 'B'. Each machine is available for at most 4 hours on any day. The manufacturer can sell a package of screws 'A' at a profit of 70 P and screws 'B' at a profit of Rs 1. Assuming that he can sell all the screws he can manufacture, how many packages of each type should the factory owner produce in a day in order to maximize his profit? Determine the maximum profit.
A manufacturer of patent medicines is preparing a production plan on medicines, A and B. There are sufficient raw materials available to make 20000 bottles of A and 40000 bottles of B, but there are only 45000 bottles into which either of the medicines can be put. Further, it takes 3 hours to prepare enough material to fill 1000 bottles of A, it takes 1 hour to prepare enough material to fill 1000 bottles of B and there are 66 hours available for this operation. The profit is Rs 8 per bottle for A and Rs 7 per bottle for B. How should the manufacturer schedule his production in order to maximize his profit?
Anil wants to invest at most Rs 12000 in Saving Certificates and National Saving Bonds. According to rules, he has to invest at least Rs 2000 in Saving Certificates and at least Rs 4000 in National Saving Bonds. If the rate of interest on saving certificate is 8% per annum and the rate of interest on National Saving Bond is 10% per annum, how much money should he invest to earn maximum yearly income? Find also his maximum yearly income.
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 box manufacturer makes large and small boxes from a large piece of cardboard. The large boxes require 4 sq. metre per box while the small boxes require 3 sq. metre per box. The manufacturer is required to make at least three large boxes and at least twice as many small boxes as large boxes. If 60 sq. metre of cardboard is in stock, and if the profits on the large and small boxes are Rs 3 and Rs 2 per box, how many of each should be made in order to maximize the total 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 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.
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.
A carpenter has 90, 80 and 50 running feet respectively of teak wood, plywood and rosewood which is used to product A and product B. Each unit of product A requires 2, 1 and 1 running feet and each unit of product B requires 1, 2 and 1 running feet of teak wood, plywood and rosewood respectively. If product A is sold for Rs. 48 per unit and product B is sold for Rs. 40 per unit, how many units of product A and product B should be produced and sold by the carpenter, in order to obtain the maximum gross income? Formulate the above as a Linear Programming Problem and solve it, indicating clearly the feasible region in the graph.
Find the feasible solution of linear inequation 2x + 3y ≤ 12, 2x + y ≤ 8, x ≥ 0, y ≥ 0 by graphically
Maximum value of 4x + 13y subject to constraints x ≥ 0, y ≥ 0, x + y ≤ 5 and 3x + y ≤ 9 is ______.
The maximum value of z = 6x + 8y subject to x - y ≥ 0, x + 3y ≤ 12, x ≥ 0, y ≥ 0 is ______.
The minimum value of z = 2x + 9y subject to constraints x + y ≥ 1, 2x + 3y ≤ 6, x ≥ 0, y ≥ 0 is ______.
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 ______.
Of all the points of the feasible region for maximum or minimum of objective function the points.
The maximum value of Z = 3x + 4y subjected to contraints x + y ≤ 40, x + 2y ≤ 60, x ≥ 0 and y ≥ 0 is ____________.
Any point in the feasible region that gives the optional value (maximum or minimum) of the objective function is called:-
The constraints –x1 + x2 ≤ 1, –x1 + 3x2 ≤ 9, x1x2 ≥ 0 define on ______.
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:
Minimize: Z = 5x + 10y
Subject to constraints:
x + 2y ≤ 120, x + y ≥ 60, x – 2y ≥ 0, x ≥ 0, y ≥ 0.
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.
Solve the following Linear Programming Problem graphically:
Minimize: Z = 60x + 80y
Subject to constraints:
3x + 4y ≥ 8
5x + 2y ≥ 11
x, y ≥ 0
Solve the following Linear Programming Problem graphically:
Maximize: z = – x + 2y,
Subject to the constraints: x ≥ 3, x + y ≥ 5, x + 2y ≥ 6, y ≥ 0.
