Advertisements
Advertisements
प्रश्न
A farmer mixes two brands P and Q of cattle feed. Brand P, costing Rs 250 per bag contains 3 units of nutritional element A, 2.5 units of element B and 2 units of element C. Brand Q costing Rs 200 per bag contains 1.5 units of nutritional elements A, 11.25 units of element B, and 3 units of element C. The minimum requirements of nutrients A, B and C are 18 units, 45 units and 24 units respectively. Determine the number of bags of each brand which should be mixed in order to produce a mixture having a minimum cost per bag? What is the minimum cost of the mixture per bag?
Advertisements
उत्तर
Let the farmer mix x bags of brand P and y bags of brand Q.
The given information can be compiled in a table as follows.
| Vitamin A (units/bag) | Vitamin B (units/bag) | Vitamin C (units/bag) | Cost (Rs/bag) | |
| Food P | 3 | 2.5 | 2 | 250 |
| Food Q | 1.5 | 11.25 | 3 | 200 |
| Requirement (units/bag) | 18 | 45 | 24 |
The given problem can be formulated as follows.
Minimize z = 250x + 200y … (1)
subject to the constraints,
The feasible region determined by the system of constraints is as follows
The corner points of the feasible region are A (18, 0), B (9, 2), C (3, 6), and D (0, 12).
The values of z at these corner points are as follows.
| Corner point | z = 250x + 200y | |
| A (18, 0) | 4500 | |
| B (9, 2) | 2650 | |
| C (3, 6) | 1950 | → Minimum |
| D (0, 12) | 2400 |
As the feasible region is unbounded, therefore, 1950 may or may not be the minimum value of z.
For this, we draw a graph of the inequality, 250x + 200y < 1950 or 5x + 4y < 39, and check whether the resulting half plane has points in common with the feasible region or not.
It can be seen that the feasible region has no common point with 5x + 4y < 39
Therefore, the minimum value of z is 1950 at (3, 6).
Thus, 3 bags of brand P and 6 bags of brand Q should be used in the mixture to minimize the cost to Rs 1950.
APPEARS IN
संबंधित प्रश्न
Solve the following Linear Programming Problems graphically:
Minimise Z = – 3x + 4 y
subject to x + 2y ≤ 8, 3x + 2y ≤ 12, x ≥ 0, y ≥ 0.
Solve the following Linear Programming Problems graphically:
Minimise Z = 3x + 5y
such that x + 3y ≥ 3, x + y ≥ 2, x, y ≥ 0.
Solve the following Linear Programming Problems graphically:
Minimise Z = x + 2y
subject to 2x + y ≥ 3, x + 2y ≥ 6, x, y ≥ 0.
Show that the minimum of Z occurs at more than two points.
Minimise and Maximise Z = 5x + 10 y
subject to x + 2y ≤ 120, x + y ≥ 60, x – 2y ≥ 0, x, y ≥ 0.
A dietician wishes to mix together 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 and 8 units of vitamin C. The vitamin content of one kg food is given below:
| Food | Vitamin A | Vitamin B | Vitamin C |
| X | 1 | 2 | 3 |
| Y | 2 | 2 | 1 |
One kg of food X costs Rs 16 and one kg of food Y costs Rs 20. Find the least cost of the mixture which will produce the required diet?
A small firm manufactures necklaces and bracelets. The total number of necklaces and bracelets that it can handle per day is at most 24. It takes one hour to make a bracelet and half an hour to make a necklace. The maximum number of hours available per day is 16. If the profit on a necklace is Rs 100 and that on a bracelet is Rs 300. Formulate on L.P.P. for finding how many of each should be produced daily to maximize the profit?
It is being given that at least one of each must be produced.
The minimum value of the objective function Z = ax + by in a linear programming problem always occurs at only one corner point of the feasible region
Determine the maximum value of Z = 11x + 7y subject to the constraints : 2x + y ≤ 6, x ≤ 2, x ≥ 0, y ≥ 0.
The feasible region for a LPP is shown in Figure. Find the minimum value of Z = 11x + 7y
Refer to Exercise 7 above. Find the maximum value of Z.
Refer to quastion 12. What will be the minimum cost?
Refer to question 13. Solve the linear programming problem and determine the maximum profit to the manufacturer
Refer to question 15. Determine the maximum distance that the man can travel.
The feasible solution for a LPP is shown in Figure. Let Z = 3x – 4y be the objective function. Minimum of Z occurs at ______.
Refer to Question 27. (Maximum value of Z + Minimum value of Z) is equal to ______.
Refer to Question 30. Minimum value of F is ______.
Refer to Question 32, Maximum of F – Minimum of F = ______.
In a LPP, the linear inequalities or restrictions on the variables are called ____________.
A corner point of a feasible region is a point in the region which is the ______ of two boundary lines.
In a LPP, the minimum value of the objective function Z = ax + by is always 0 if the origin is one of the corner point of the feasible region.
A linear programming problem is as follows:
Minimize Z = 30x + 50y
Subject to the constraints: 3x + 5y ≥ 15, 2x + 3y ≤ 18, x ≥ 0, y ≥ 0
In the feasible region, the minimum value of Z occurs at:
Objective function of a linear programming problem is ____________.
The maximum value of the object function Z = 5x + 10 y subject to the constraints x + 2y ≤ 120, x + y ≥ 60, x - 2y ≥ 0, x ≥ 0, y ≥ 0 is ____________.
Z = 7x + y, subject to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0. The minimum value of Z occurs at ____________.
A maximum or a minimum may not exist for a linear programming problem if ____________.
In Corner point method for solving a linear programming problem, one finds the feasible region of the linear programming problem, determines its corner points, and evaluates the objective function Z = ax + by at each corner point. Let M and m respectively be the largest and smallest values at corner points. In case feasible region is unbounded, M is the maximum value of the objective function if ____________.
If two corner points of the feasible region are both optimal solutions of the same type, i.e., both produce the same maximum or minimum.
In a LPP, the objective function is always ____________.
Maximize Z = 3x + 5y, subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0.
Maximize Z = 6x + 4y, subject to x ≤ 2, x + y ≤ 3, -2x + y ≤ 1, x ≥ 0, y ≥ 0.
Z = 6x + 21 y, subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, x ≥ 0, y ≥ 0. The minimum value of Z occurs at ____________.
The feasible region for an LPP is shown shaded in the figure. Let Z = 3x - 4y be the objective function. Minimum of Z occurs at ____________.
Maximize Z = 10×1 + 25×2, subject to 0 ≤ x1 ≤ 3, 0 ≤ x2 ≤ 3, x1 + x2 ≤ 5.
The feasible region for an LPP is shown shaded in the following figure. Minimum of Z = 4x + 3y occurs at the point.
