मराठी

A Firm Manufactures Headache Pills in Two Sizes a and B.Determine Also the Quantity of Codeine Consumed by Patient.

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.

So,
\[x = \frac{768}{131}, y = \frac{36}{131}\]
This is the least quantity of pill A and B.
\[\begin{array}{l}\text{ Codline quantity } \Rightarrow \frac{768}{131} + 66 \times \frac{36}{131} \\ \Rightarrow 24 \hspace{0.167em} \text{ grains }| \end{array}\]
shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 29: Linear programming - Exercise 30.4 [पृष्ठ ५२]

APPEARS IN

आर.डी. शर्मा Mathematics Volume 1 and 2 [English] Class 12
पाठ 29 Linear programming
Exercise 30.4 | Q 16 | पृष्ठ ५२

व्हिडिओ ट्यूटोरियलVIEW ALL [1]

संबंधित प्रश्‍न

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.


Minimize :Z=6x+4y

Subject to : 3x+2y ≥12

x+y ≥5

0 ≤x ≤4

0 ≤ y ≤ 4 


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 Rs 10 per kg and 'B' cost Rs 8 per kg, then graphically determine how much of each type of fertiliser should be used so that nutrient requirements are met at a minimum cost


A retired person wants to invest an amount of Rs. 50, 000. His broker recommends investing in two type of bonds ‘A’ and ‘B’ yielding 10% and 9% return respectively on the invested amount. He decides to invest at least Rs. 20,000 in bond ‘A’ and at least Rs. 10,000 in bond ‘B’. He also wants to invest at least as much in bond ‘A’ as in bond ‘B’. Solve this linear programming problem graphically to maximise his returns.


Minimum and maximum z = 5x + 2y subject to the following constraints:

x-2y ≤ 2

3x+2y ≤ 12

-3x+2y ≤ 3

x ≥ 0,y ≥ 0


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 LPP by graphical method:

Maximize: z = 3x + 5y
Subject to: x + 4y ≤ 24
                  3x + y ≤ 21
                  x + y ≤ 9
                  x ≥ 0, y ≥ 0 

Also find the maximum value of z.


Maximize Z = 2x + 3y
Subject to

\[x + y \geq 1\]
\[10x + y \geq 5\]
\[x + 10y \geq 1\]
\[ x, y \geq 0\]


Maximize Z = 3x + 3y, if possible,
Subject to the constraints

\[x - y \leq 1\]
\[x + y \geq 3\]
\[ x, y \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


Kellogg is a new cereal formed of a mixture of bran and rice that contains at least 88 grams of protein and at least 36 milligrams of iron. Knowing that bran contains 80 grams of protein and 40 milligrams of iron per kilogram, and that rice contains 100 grams of protein and 30 milligrams of iron per kilogram, find the minimum cost of producing this new cereal if bran costs Rs 5 per kg and rice costs Rs 4 per kg


One kind of cake requires 300 gm of flour and 15 gm of fat, another kind of cake requires 150 gm of flour and 30 gm of fat. Find the maximum number of cakes which can be made from 7.5 kg of flour and 600 gm of fat, assuming that there is no shortage of the other ingradients used in making the cake. Make it as an LPP and solve it graphically.


One kind of cake requires 200 g of flour and 25 g of fat, and another kind of cake requires 100 g of flour and 50 g of fat. Find the maximum number of cakes which can be made from 5 kg of flour and 1 kg of fat assuming that there is no storage of the other ingredients used in making the cakes.


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 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 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?    


An oil company has two depots, A and B, with capacities of 7000 litres and 4000 litres respectively. The company is to supply oil to three petrol pumps, D, E, F whose requirements are 4500, 3000 and 3500 litres respectively. The distance (in km) between the depots and petrol pumps is given in the following table:
Figure
Assuming that the transportation cost per km is Rs 1.00 per litre, how should the delivery be scheduled in order that the transportation cost is minimum?


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. If the profit on a racket and on a bat is Rs 20 and Rs 10 respectively, find the number of tennis rackets and cricket bats that the factory must manufacture to earn the maximum profit. Make it as an LPP and solve it graphically.


A manufacturing company makes two models A and B of a product. Each piece of model A requires 9 labour hours for fabricating and 1 labour hour for finishing.  Each piece of model B requires 12 labour hours for fabricating and 3 labour hours for finishing. For fabricating and finishing, the maximum labour hours available are 180 and 30 respectively. The company makes a profit of ₹8000 on each piece of model A and ₹12000 on each piece of model B. How many pieces of model A and model B should be manufactured per week to realise a maximum profit? What is the maximum profit per week?


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? 


The region represented by the inequation system x, y ≥ 0, y ≤ 6, x + y ≤ 3 is 


The value of objective function is maximum under linear constraints ______.


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.


Sketch the graph of inequation x ≥ 5y in xoy co-ordinate system


Find the graphical solution for the system of linear inequation 2x + y ≤ 2, x − y ≤ 1


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 (convex polygon) for a linear programming problem and let Z = ax + by be the objective function. When Z has an optimal value (maximum or minimum), where the variables x and y are subject to constraints described by linear inequalities,


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 objective function Z has both a maximum and a minimum value on R and ____________.


In Corner point method for solving a linear programming problem the first step is to ____________.


In the Corner point method for solving a linear programming problem the second step after finding the feasible region of the linear programming problem and determining its corner points is ____________.


The feasible region (shaded) for a L.P.P is shown in the figure. The maximum Z = 5x + 7y is ____________.


The feasible region corresponding to the linear constraints of a Linear Programming Problem is given below.


Which of the following is not a constraint to the given Linear Programming Problem?


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.


The solution set of constraints x + 2y ≥ 11, 3x + 4y  ≤  30, 2x + 5y ≤ 30 and x ≥ 0, y ≥ 0, includes the point ______.


Which statement defines a feasible solution?


Which point is an infeasible solution?


For a bounded feasible region, where do the maximum and minimum values occur?


If two corner points give the same optimum value, which points are also optimal?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×