Advertisements
Advertisements
प्रश्न
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.
Advertisements
उत्तर
Maximise Z = 4x1 + x2
Subject to the constraints
x1 + x2 ≤ 50
3x1 + x2 ≤ 90
x1, x2 ≥ 0

Since the decision variables, x1 and x2 are non-negative, the solution lies in the I quadrant of the plane.
Consider the equations
x1 + x2 = 50
| x1 | 0 | 50 |
| x2 | 50 | 0 |
3x1 + x2 = 90
| x1 | 0 | 30 |
| x2 | 90 | 0 |
The feasible region is OABC and its co-ordinates are O(0, 0) A(30, 0) C(0, 50) and B is the point of intersection of the lines
x1 + x2 = 50 ..........(1)
and 3x1 + x2 = 90 .........(2)
Verification of B:
x1 + x2 = 50 ..........(1)
3x1 + x2 = 90 .........(2)
− − −
− 2x1 = − 40
x1 = 20
From (1), 20 + x2 = 50
x2 = 30
∴ B is (20, 30)
| Corner points | Z = 4x1 + x2 |
| O(0, 0) | 0 |
| A(30, 0) | 120 |
| B(20, 30) | 110 |
| C(0, 50) | 50 |
Maximum value occurs at A(30, 0)
Hence the solution is x1 = 30, x2 = 0 and Zmax = 120.
APPEARS IN
संबंधित प्रश्न
Which of the following statements is correct?
Solve the following LPP:
Maximize z = 4x + 2y subject to 3x + y ≤ 27, x + y ≤ 21, x ≥ 0, y ≥ 0.
Solve each of the following inequations graphically using XY-plane:
5y - 12 ≥ 0
A chemical company produces a chemical containing three basic elements A, B, C, so that it has at least 16 litres of A, 24 litres of B and 18 litres of C. This chemical is made by mixing two compounds I and II. Each unit of compound I has 4 litres of A, 12 litres of B and 2 litres of C. Each unit of compound II has 2 litres of A, 2 litres of B and 6 litres of C. The cost per unit of compound I is ₹ 800 and that of compound II is ₹ 640. Formulate the problems as LPP and solve it to minimize the cost.
Choose the correct alternative :
The corner points of the feasible region are (0, 0), (2, 0), `(12/7, 3/7)` and (0,1) then the point of maximum z = 7x + y
x − y ≤ 1, x − y ≥ 0, x ≥ 0, y ≥ 0 are the constant for the objective function z = x + y. It is solvable for finding optimum value of z? Justify?
State whether the following statement is True or False:
Objective function of LPP is a relation between the decision variables
Constraints are always in the form of ______ or ______.
Maximize: z = 3x1 + 4x2 subject to 2x1 + x2 ≤ 40, 2x1 + 5x2 ≤ 180, x1, x2 ≥ 0. In the LPP, which one of the following is feasible comer point?
The maximum value of the objective function Z = 3x + 5y subject to the constraints x ≥ 0, y ≥ 0 and 2x + 5y ≤ 10 is:
