Advertisements
Advertisements
प्रश्न
Maximise Z = x + y subject to x + 4y ≤ 8, 2x + 3y ≤ 12, 3x + y ≤ 9, x ≥ 0, y ≥ 0.
Advertisements
उत्तर
We are given that Z = x + y subject to the constraints
x + 4y ≤ 8 ......(i)
| x | 0 | 8 |
| y | 2 | 0 |
2x + 3y ≤ 12 ......(ii)
| x | 0 | 6 |
| y | 4 | 0 |
3x + y ≤ 9 ......(iii)
| x | 0 | 3 |
| y | 9 | 0 |
x ≥ 0, y ≥ 0
On solving equation (i) and (iii) we get
x = `28/11` and y = `15/11`
Here, OABC is the feasible region whose corner points are O(0, 0), A(3, 0), `"B"(28/11, 15/11)`, C(0, 2)
Let us evaluate the value of Z
| Corner points | Value of Z = x + y | |
| O(0, 0) | Z = 0 + 0 = 0 | |
| A(3, 0) | Z = 3 + 0 = 3 | |
| `"B"(28/11, 15/11)` | Z = `28/11 + 15/11 = 43/11` = 3.9 | ← Maximum |
| C(0, 2) | Z = 0 + 2 = 2 |
Hence, the maximum value of Z is 3.9 at `(28/11, 15/11)`.
APPEARS IN
संबंधित प्रश्न
Two tailors, A and B, earn Rs 300 and Rs 400 per day respectively. A can stitch 6 shirts and 4 pairs of trousers while B can stitch 10 shirts and 4 pairs of trousers per day. To find how many days should each of them work and if it is desired to produce at least 60 shirts and 32 pairs of trousers at a minimum labour cost, formulate this as an LPP
Solve the following Linear Programming Problems graphically:
Maximise Z = 3x + 4y
subject to the constraints : x + y ≤ 4, x ≥ 0, y ≥ 0.
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 = x + 2y
subject to 2x + y ≥ 3, x + 2y ≥ 6, 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?
An aeroplane can carry a maximum of 200 passengers. A profit of Rs 1000 is made on each executive class ticket and a profit of Rs 600 is made on each economy class ticket. The airline reserves at least 20 seats for executive class. However, at least 4 times as many passengers prefer to travel by economy class than by the executive class. Determine how many tickets of each type must be sold in order to maximize the profit for the airline. What is the maximum profit?
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.
Maximise Z = 3x + 4y, subject to the constraints: x + y ≤ 1, x ≥ 0, y ≥ 0
Maximise the function Z = 11x + 7y, subject to the constraints: x ≤ 3, y ≤ 2, x ≥ 0, y ≥ 0.
Determine the maximum value of Z = 3x + 4y if the feasible region (shaded) for a LPP is shown in Figure
Refer to Exercise 7 above. Find the maximum value of Z.
In figure, the feasible region (shaded) for a LPP is shown. Determine the maximum and minimum value of Z = x + 2y.
A man rides his motorcycle at the speed of 50 km/hour. He has to spend Rs 2 per km on petrol. If he rides it at a faster speed of 80 km/hour, the petrol cost increases to Rs 3 per km. He has atmost Rs 120 to spend on petrol and one hour’s time. He wishes to find the maximum distance that he can travel. Express this problem as a linear programming problem
Refer to quastion 12. What will be the minimum cost?
Refer to question 14. How many sweaters of each type should the company make in a day to get a maximum profit? What is the maximum profit.
Refer to question 15. Determine the maximum distance that the man can travel.
Refer to question 15. Determine the maximum distance that the man can travel.
The corner points of the feasible region determined by the system of linear constraints are (0, 0), (0, 40), (20, 40), (60, 20), (60, 0). The objective function is Z = 4x + 3y ______.
Compare the quantity in Column A and Column B
| Column A | Column B |
| Maximum of Z | 325 |
Refer to Question 27. Maximum of Z occurs at ______.
The feasible region for an LPP is shown in the figure. Let F = 3x – 4y be the objective function. Maximum value of F is ______.
Corner points of the feasible region for an LPP are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5). Let F = 4x + 6y be the objective function. The Minimum value of F occurs at ______.
Refer to Question 32, Maximum of F – Minimum of F = ______.
If the feasible region for a LPP is ______ then the optimal value of the objective function Z = ax + by may or may not exist.
A feasible region of a system of linear inequalities is said to be ______ if it can be enclosed within a circle.
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.
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 ____________.
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 the feasible region is unbounded, m is the minimum value of the objective function.
In a LPP, the objective function is always ____________.
Maximize Z = 4x + 6y, subject to 3x + 2y ≤ 12, x + y ≥ 4, x, y ≥ 0.
Maximize Z = 7x + 11y, subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0.
Maximize Z = 10 x1 + 25 x2, subject to 0 ≤ x1 ≤ 3, 0 ≤ x2 ≤ 3, x1 + x2 ≤ 5.
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.
