Advertisements
Advertisements
प्रश्न
Solve the following problem :
Maximize Z = 4x1 + 3x2 Subject to 3x1 + x2 ≤ 15, 3x1 + 4x2 ≤ 24, x1 ≥ 0, x2 ≥ 0
उत्तर
To find the graphical solution, construct the table as follows:
Inequation | Equation | Double intercept form | Points (x1, x2) | Region |
3x1 + x2 ≤ 15 | 3x1 + x2 = 15 | `x_1/(5) + x_2/(15)` = 1 | A (5, 0) B (0, 15) |
3(0) + 0 ≤ 15 ∴ 0 ≤ 15 ∴ origin side |
3x1 + 4x2 ≤ 24 | 3x1 + 4x2 = 24 | `x_1/8 + x_2/(6)` = 1 | C (8, 0) D (0, 6) |
3(0 + 4(0) ≤ 24 ∴ 0 ≤ 24 ∴ origin side |
x1 ≥ 0 | x1 = 0 | – | – | R.H.S. of Y-axis |
x2 ≥ 0 | x2 = 0 | – | – | above X-axis |
Shaded portion ODEA is the feasible region.
Whose vertices are O (0, 0), D (0, 6), E, A (5, 0)
E is the point of intersection of the lines
3x1 + x2 = 15 …(i)
and 3x1 + 4x2 = 24 …(ii)
∴ By (i) – (ii), we get
3x1 + x2 = 15
3x1 + 4x2 = 24
– – –
–3x2 = – 9
∴ x2 = `(-9)/(-3)`
∴ x2 = 3
Substituting x2 = 3 in i, we get
3x1 + 3 = 15
∴ 3x1 = 15 – 3
∴ 3x1 = 12
∴ x1 = `(12)/(3)` = 4
∴ E (4, 3)
Here, the objective function is Z = 4x1 + 3x2
Now, we will find maximum value of Z as follows:
Feasible points | The value of Z = 4x1 + 3x2 |
O (0, 0) | Z = 4(0) + 3(0) = 0 |
D (0, 6) | Z = 4(0) + 3(0) = 0 |
E (4, 3) | Z = 4(4) + 3(3) = 16 + 9 = 25 |
A (5, 0) | Z = 4(4) + 3(3) = 16 + 9 = 25 |
∴ Z has maximum value 25 at E(4, 3)
∴ Z is maximum, when x1 = 4, x2 = 3.
APPEARS IN
संबंधित प्रश्न
A company produces two types of goods A and B, that require gold and silver. Each unit of type A requires 3 g of silver and 1 g of golds while that of type B requires 1 g of silver and 2 g of gold. The company can procure a maximum of 9 g of silver and 8 g of gold. If each unit of type A brings a profit of Rs 40 and that of type B Rs 50, formulate LPP to maximize profit.
Solve the following LPP by graphical method:
Maximize z = 11x + 8y, subject to x ≤ 4, y ≤ 6, x + y ≤ 6, x ≥ 0, y ≥ 0
Solve the following L.P.P. by graphical method :
Maximize : Z = 7x + 11y subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0.
Solve the following L.P.P. by graphical method :
Maximize: Z = 3x + 5y subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0 also find maximum value of Z.
Choose the correct alternative :
The maximum value of z = 5x + 3y. subject to the constraints
Solve the following problem :
Minimize Z = 4x + 2y Subject to 3x + y ≥ 27, x + y ≥ 21, x ≥ 0, y ≥ 0
Choose the correct alternative:
If LPP has optimal solution at two point, then
Choose the correct alternative:
The corner points of the feasible region are (0, 3), (3, 0), (8, 0), `(12/5, 38/5)` and (0, 10), then the point of maximum Z = 6x + 4y = 48 is at
State whether the following statement is True or False:
Of all the points of feasible region, the optimal value is obtained at the boundary of the feasible region
State whether the following statement is True or False:
The graphical solution set of the inequations 0 ≤ y, x ≥ 0 lies in second quadrant
A company manufactures 2 types of goods P and Q that requires copper and brass. Each unit of type P requires 2 grams of brass and 1 gram of copper while one unit of type Q requires 1 gram of brass and 2 grams of copper. The company has only 90 grams of brass and 80 grams of copper. Each unit of types P and Q brings profit of ₹ 400 and ₹ 500 respectively. Find the number of units of each type the company should produce to maximize its profit
Smita is a diet conscious house wife, wishes to ensure certain minimum intake of vitamins A, B and C for the family. The minimum daily needs of vitamins A, B, and C for the family are 30, 20, and 16 units respectively. For the supply of the minimum vitamin requirements Smita relies on 2 types of foods F1 and F2. F1 provides 7, 5 and 2 units of A, B, C vitamins per 10 grams and F2 provides 2, 4 and 8 units of A, B and C vitamins per 10 grams. F1 costs ₹ 3 and F2 costs ₹ 2 per 10 grams. How many grams of each F1 and F2 should buy every day to keep her food bill minimum
Maximize Z = 2x + 3y subject to constraints
x + 4y ≤ 8, 3x + 2y ≤ 14, x ≥ 0, y ≥ 0.
Maximize Z = 5x + 10y subject to constraints
x + 2y ≤ 10, 3x + y ≤ 12, x ≥ 0, y ≥ 0
Maximize Z = 400x + 500y subject to constraints
x + 2y ≤ 80, 2x + y ≤ 90, x ≥ 0, y ≥ 0
Solve the following LPP graphically:
Maximize Z = 9x + 13y subject to constraints
2x + 3y ≤ 18, 2x + y ≤ 10, x ≥ 0, y ≥ 0
Solution: Convert the constraints into equations and find the intercept made by each one of it.
Inequation | Equation | X intercept | Y intercept | Region |
2x + 3y ≤ 18 | 2x + 3y = 18 | (9, 0) | (0, ___) | Towards origin |
2x + y ≤ 10 | 2x + y = 10 | ( ___, 0) | (0, 10) | Towards origin |
x ≥ 0, y ≥ 0 | x = 0, y = 0 | X axis | Y axis | ______ |
The feasible region is OAPC, where O(0, 0), A(0, 6),
P( ___, ___ ), C(5, 0)
The optimal solution is in the following table:
Point | Coordinates | Z = 9x + 13y | Values | Remark |
O | (0, 0) | 9(0) + 13(0) | 0 | |
A | (0, 6) | 9(0) + 13(6) | ______ | |
P | ( ___,___ ) | 9( ___ ) + 13( ___ ) | ______ | ______ |
C | (5, 0) | 9(5) + 13(0) | ______ |
∴ Z is maximum at __( ___, ___ ) with the value ___.
Solve the LPP graphically:
Minimize Z = 4x + 5y
Subject to the constraints 5x + y ≥ 10, x + y ≥ 6, x + 4y ≥ 12, x, y ≥ 0
Solution: Convert the constraints into equations and find the intercept made by each one of it.
Inequations | Equations | X intercept | Y intercept | Region |
5x + y ≥ 10 | 5x + y = 10 | ( ___, 0) | (0, 10) | Away from origin |
x + y ≥ 6 | x + y = 6 | (6, 0) | (0, ___ ) | Away from origin |
x + 4y ≥ 12 | x + 4y = 12 | (12, 0) | (0, 3) | Away from origin |
x, y ≥ 0 | x = 0, y = 0 | x = 0 | y = 0 | 1st quadrant |
∵ Origin has not satisfied the inequations.
∴ Solution of the inequations is away from origin.
The feasible region is unbounded area which is satisfied by all constraints.
In the figure, ABCD represents
The set of the feasible solution where
A(12, 0), B( ___, ___ ), C ( ___, ___ ) and D(0, 10).
The coordinates of B are obtained by solving equations
x + 4y = 12 and x + y = 6
The coordinates of C are obtained by solving equations
5x + y = 10 and x + y = 6
Hence the optimum solution lies at the extreme points.
The optimal solution is in the following table:
Point | Coordinates | Z = 4x + 5y | Values | Remark |
A | (12, 0) | 4(12) + 5(0) | 48 | |
B | ( ___, ___ ) | 4( ___) + 5(___ ) | ______ | ______ |
C | ( ___, ___ ) | 4( ___) + 5(___ ) | ______ | |
D | (0, 10) | 4(0) + 5(10) | 50 |
∴ Z is minimum at ___ ( ___, ___ ) with the value ___
Maximised value of z in z = 3x + 4y, subject to constraints : x + y ≤ 4, x ≥ 0. y ≥ 0