Advertisements
Advertisements
Question
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.
Solution
Since the decision variables, x1 and x2 are non-negative, the solution lies in the I quadrant of the plane.
Consider the equations
x1 + 2x2 = 10
| x1 | 0 | 10 |
| x2 | 5 | 0 |
3x1 + 4x2 = 24
| x1 | 0 | 8 |
| x2 | 6 | 0 |
The feasible region is ABC and its co-ordinates are A(0, 5) C(0, 6) and B is the point of intersection of the lines
x1 + 2x2 = 10 ..........(1)
3x1 + 4x2 = 24 .........(2)
Verification of B:
3x1 + 6x2 = 30 ..........[(1) × 3]
3x1 + 4x2 = 24 .........(2)
− − −
2x2 = 6
x2 = 3
From (1), x1 + 6 = 10
x1 = 4
∴ B is (4, 3)
| Corner points | Z = 200x1 + 500x2 |
| A(0, 5) | 2500 |
| B(4, 3) | 2300 |
| C(0, 6) | 3000 |
Minimum value occurs at B(4, 3)
∴ The solution is x1 = 4, x2 = 3 and Zmin = 2300.
APPEARS IN
RELATED QUESTIONS
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.
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:
| Fertilizers→ | F1 | F2 | Availability |
| Raw Material ↓ | |||
| A | 2 | 3 | 40 |
| B | 1 | 4 | 70 |
By selling one unit of F1 and one unit of F2, the company gets a profit of ₹ 500 and ₹ 750 respectively. Formulate the problem as LPP to maximize the profit.
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 ______.
Choose the correct alternative :
Of all the points of the feasible region the optimal value of z is obtained at a point
Constraints are always in the form of ______ or ______.
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 maximum value of Z = 3x + 5y, subject to 3x + 2y ≤ 18, x ≤ a, y ≤ 6, x, y ≥ 0 is ______.
The LPP to maximize Z = x + y, subject to x + y ≤ 1, 2x + 2y ≥ 6, x ≥ 0, y ≥ 0 has ________.
Food F1 contains 2, 6, 1 units and food F2 contains 1, 1, 3 units of proteins, carbohydrates, fats respectively per kg. 8, 12 and 9 units of proteins, carbohydrates and fats is the weekly minimum requirement for a person. The cost of food F1 is Rs. 85 and food F2 is Rs. 40 per kg. Formulate the L.P.P. to minimize the cost.
Sketch the graph of the following inequation in XOY co-ordinate system.
2y - 5x ≥ 0
