Advertisements
Advertisements
प्रश्न
A firm manufactures pills in two sizes A and B. Size A contains 2 mgs of aspirin, 5 mgs of bicarbonate and 1 mg of codeine. Size B contains 1 mg. of aspirin, 8 mgs. of bicarbonate and 6 mgs. of codeine. It is found by users that it requires at least 12 mgs. of aspirin, 74 mgs. of bicarbonate and 24 mgs. of codeine for providing immediate relief. It is required to determine the least number of pills a patient should take to get immediate relief. Formulate the problem as a standard LLP.
Advertisements
उत्तर
(i) Variables: Let x1 and x2 represents the pills in two sizes A and B.
| A | B | Requirement (at least) |
|
| Aspirin | 2 mg | 1 mg | 12 mg |
| Bicarbonate | 5 mg | 8 mg | 74 mg |
| Codeine | 1 mg | 6 mg | 24 mg |
Requirement of Aspirin 2x1 + x2 ≥ 12
Requirement of Bicarbonate 5x1 + 8x2 ≥ 74
Requirement of Codeine x1 + 6x2 ≥ 24
(ii) Objective function:
Number of pills required for a patient = x1 + x2
let Z = x1 + x2
∴ Minimize Z = x1 + x2 is the objective function.
(iii) Non-negative restrictions:
Since the number of pills of size A and B cannot be negative,
We have x1, x2 ≥ 0
Hence, the mathematical formulation of the LLP is minimize Z = x1 + x2
Subject to the constraints
2x1 + x2 ≥ 12
5x1 + 8x2 ≥ 74
x1 + 6x2 ≥ 24
x1, x2 ≥ 0
APPEARS IN
संबंधित प्रश्न
Of all the points of the feasible region, the optimal value of z obtained at the point lies ______.
Solve the following LPP:
Maximize z = 5x1 + 6x2 subject to 2x1 + 3x2 ≤ 18, 2x1 + x2 ≤ 12, x1 ≥ 0, x2 ≥ 0.
Solve the following LPP:
Maximize z =60x + 50y subject to
x + 2y ≤ 40, 3x + 2y ≤ 60, x ≥ 0, y ≥ 0.
A manufacturer produces bulbs and tubes. Each of these must be processed through two machines M1 and M2. A package of bulbs requires 1 hour of work on Machine M1 and 3 hours of work on M2. A package of tubes requires 2 hours on Machine M1 and 4 hours on Machine M2. He earns a profit of ₹ 13.5 per package of bulbs and ₹ 55 per package of tubes. If maximum availability of Machine M1 is 10 hours and that of Machine M2 is 12 hours, then formulate the L.P.P. to maximize the profit.
Solve the following L.P.P. by graphical method:
Maximize: Z = 4x + 6y
Subject to 3x + 2y ≤ 12, x + y ≥ 4, x, y ≥ 0.
Maximize z = 5x + 2y subject to 3x + 5y ≤ 15, 5x + 2y ≤ 10, x ≥ 0, y ≥ 0
The variables involved in LPP are called ______
Solve the following linear programming problem graphically.
Maximise Z = 4x1 + x2 subject to the constraints x1 + x2 ≤ 50; 3x1 + x2 ≤ 90 and x1 ≥ 0, x2 ≥ 0.
Which of the following can be considered as the objective function of a linear programming problem?
Find graphical solution for the following system of linear in equation:
x + 2y ≥ 4, 2x - y ≤ 6
