Advertisements
Advertisements
प्रश्न
A company manufactures two types of chemicals Aand B. Each chemical requires two types of raw material P and Q. The table below shows number of units of P and Q required to manufacture one unit of A and one unit of B and the total availability of P and Q.
| Chemical→ | A | B | Availability |
| Raw Material ↓ | |||
| P | 3 | 2 | 120 |
| Q | 2 | 5 | 160 |
The company gets profits of ₹ 350 and ₹ 400 by selling one unit of A and one unit of B respectively. (Assume that the entire production of A and B can be sold). How many units of the chemicals A and B should be manufactured so that the company gets a maximum profit? Formulate the problem as LPP to maximize profit.
उत्तर
Let the company manufactures x units of chemical A and y units of chemical B. Then the total profit to the company is p = ₹(350x + 400y).
This is a linear function that is to be maximized. Hence, it is an objective function.
The constraints are as per the following table:
| Chemical→ | A (x) |
B (y) |
Availability |
| Raw Material ↓ | |||
| P | 3 | 2 | 120 |
| Q | 2 | 5 | 160 |
The raw material P required for x units of chemical A and y units of chemical B is 3x + 2y. Since the maximum availability of P is 120, we have the first constraint as 3x + 2y ≤ 120.
Similarly, considering the raw material Q, we have 2x + 5y ≤ 160.
Since, x and y cannot be negative, we have, x ≥ 0, y ≥ 0.
Hence, the given LPP can be formulated as:
Maximize p = 350x + 400y, subject to
3x + 2y ≤ 120, 2x + 5y ≤ 160, x ≥ 0, y ≥ 0
APPEARS IN
संबंधित प्रश्न
Which of the following statements is correct?
In a cattle breading firm, it is prescribed that the food ration for one animal must contain 14. 22 and 1 units of nutrients A, B, and C respectively. Two different kinds of fodder are available. Each unit of these two contains the following amounts of these three nutrients:
| Fodder → | Fodder 1 | Fodder 2 |
| Nutrient ↓ | ||
| Nutrients A | 2 | 1 |
| Nutrients B | 2 | 3 |
| Nutrients C | 1 | 1 |
The cost of fodder 1 is ₹ 3 per unit and that of fodder 2 ₹ 2. Formulate the LPP to minimize the cost.
Solve the following LPP by graphical method:
Minimize z = 8x + 10y, subject to 2x + y ≥ 7, 2x + 3y ≥ 15, y ≥ 2, x ≥ 0, y ≥ 0.
Which of the following is correct?
The corner points of the feasible solution are (0, 0), (2, 0), `(12/7, 3/7)`, (0, 1). Then z = 7x + y is maximum at ______.
Solve the following LPP:
Maximize z = 4x + 2y subject to 3x + y ≤ 27, x + y ≤ 21, x ≥ 0, y ≥ 0.
Solve the following LPP:
Maximize z = 2x + 3y subject to x - y ≥ 3, x ≥ 0, y ≥ 0.
Find graphical solution for the following system of linear in equation:
3x + 4y ≤ 12, x - 2y ≥ 2, y ≥ - 1
Solve the following LPP:
Minimize z = 4x + 2y
Subject to 3x + y ≥ 27, x + y ≥ 21, x + 2y ≥ 30, x ≥ 0, y ≥ 0
A carpenter makes chairs and tables. Profits are ₹ 140 per chair and ₹ 210 per table. Both products are processed on three machines: Assembling, Finishing and Polishing. The time required for each product in hours and availability of each machine is given by the following table:
| Product → | Chair (x) | Table (y) | Available time (hours) |
| Machine ↓ | |||
| Assembling | 3 | 3 | 36 |
| Finishing | 5 | 2 | 50 |
| Polishing | 2 | 6 | 60 |
Formulate the above problem as LPP. Solve it graphically
A company produces mixers and food processors. Profit on selling one mixer and one food processor is Rs 2,000 and Rs 3,000 respectively. Both the products are processed through three machines A, B, C. The time required in hours for each product and total time available in hours per week on each machine arc as follows:
| Machine | Mixer | Food Processor | Available time |
| A | 3 | 3 | 36 |
| B | 5 | 2 | 50 |
| C | 2 | 6 | 60 |
How many mixers and food processors should be produced in order to maximize the profit?
A printing company prints two types of magazines A and B. The company earns ₹ 10 and ₹ 15 on magazines A and B per copy. These are processed on three machines I, II, III. Magazine A requires 2 hours on Machine I, 5 hours on Machine II and 2 hours on Machine III. Magazine B requires 3 hours on Machine I, 2 hours on Machine II and 6 hours on Machine III. Machines I, II, III are available for 36, 50, 60 hours per week respectively. Formulate the Linear programming problem to maximize the profit.
A company manufactures two types of fertilizers F1 and F2. Each type of fertilizer requires two raw materials A and B. The number of units of A and B required to manufacture one unit of fertilizer F1 and F2 and availability of the raw materials A and B per day are given in the table below:
| Raw Material\Fertilizers | F1 | F2 | Availability |
| A | 2 | 3 | 40 |
| B | 1 | 4 | 70 |
By selling one unit of F1 and one unit of F2, company gets a profit of ₹ 500 and ₹ 750 respectively. Formulate the problem as L.P.P. to maximize the profit.
Choose the correct alternative :
Of all the points of the feasible region the optimal value of z is obtained at a point
Choose the correct alternative :
Feasible region; the set of points which satify.
A train carries at least twice as many first class passengers (y) as second class passengers (x) The constraint is given by_______
State whether the following is True or False :
Saina wants to invest at most ₹ 24000 in bonds and fixed deposits. Mathematically this constraints is written as x + y ≤ 24000 where x is investment in bond and y is in fixed deposits.
State whether the following is True or False :
The feasible solution of LPP belongs to only quadrant I.
The point of which the maximum value of z = x + y subject to constraints x + 2y ≤ 70, 2x + y ≤ 90, x ≥ 0, y ≥ 0 is obtained at
Maximize z = 10x + 25y subject to x + y ≤ 5, 0 ≤ x ≤ 3, 0 ≤ y ≤ 3
Solve the Linear Programming problem graphically:
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.
Minimize z = 7x + y subjected to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0
State whether the following statement is True or False:
LPP is related to efficient use of limited resources
The variables involved in LPP are called ______
Constraints are always in the form of ______ or ______.
A company produces two types of pens A and B. Pen A is of superior quality and pen B is of lower quality. Profits on pens A and B are ₹ 5 and ₹ 3 per pen respectively. Raw materials required for each pen A is twice as that of pen B. The supply of raw material is sufficient only for 1000 pens per day. Pen A requires a special clip and only 400 such clips are available per day. For pen B, only 700 clips are available per day. Formulate this problem as a linear programming problem.
A company manufactures two models of voltage stabilizers viz., ordinary and auto-cut. All components of the stabilizers are purchased from outside sources, assembly and testing is carried out at the company’s own works. The assembly and testing time required for the two models are 0.8 hours each for ordinary and 1.20 hours each for auto-cut. Manufacturing capacity 720 hours at present is available per week. The market for the two models has been surveyed which suggests a maximum weekly sale of 600 units of ordinary and 400 units of auto-cut. Profit per unit for ordinary and auto-cut models has been estimated at ₹ 100 and ₹ 150 respectively. Formulate the linear programming problem.
Solve the following linear programming problems by graphical method.
Minimize Z = 3x1 + 2x2 subject to the constraints 5x1 + x2 ≥ 10; x1 + x2 ≥ 6; x1 + 4x2 ≥ 12 and x1, x2 ≥ 0.
Solve the following linear programming problems by graphical method.
Maximize Z = 20x1 + 30x2 subject to constraints 3x1 + 3x2 ≤ 36; 5x1 + 2x2 ≤ 50; 2x1 + 6x2 ≤ 60 and x1, x2 ≥ 0.
A firm manufactures two products A and B on which the profits earned per unit are ₹ 3 and ₹ 4 respectively. Each product is processed on two machines M1 and M2. Product A requires one minute of processing time on M1 and two minutes on M2, While B requires one minute on M1 and one minute on M2. Machine M1 is available for not more than 7 hrs 30 minutes while M2 is available for 10 hrs during any working day. Formulate this problem as a linear programming problem to maximize the profit.
Solve the following linear programming problem graphically.
Minimize Z = 200x1 + 500x2 subject to the constraints: x1 + 2x2 ≥ 10; 3x1 + 4x2 ≤ 24 and x1 ≥ 0, x2 ≥ 0.
Solve the following linear programming problem graphically.
Maximize Z = 3x1 + 5x2 subject to the constraints: x1 + x2 ≤ 6, x1 ≤ 4; x2 ≤ 5, and x1, x2 ≥ 0.
The minimum value of z = 5x + 13y subject to constraints 2x + 3y ≤ 18, x + y ≥ 10, x ≥ 0, y ≥ 2 is ______
The set of feasible solutions of LPP is a ______.
Solution which satisfy all constraints is called ______ solution.
Shamli wants to invest ₹ 50, 000 in saving certificates and PPF. She wants to invest atleast ₹ 15,000 in saving certificates and at least ₹ 20,000 in PPF. The rate of interest on saving certificates is 8% p.a. and that on PPF is 9% p.a. Formulation of the above problem as LPP to determine maximum yearly income, is ______.
Solve the following problems by graphical method:
Maximize z = 4x + 2y subject to 3x + y ≥ 27, x + y ≥ 21, x ≥ 0 y ≥ 0
