
For line x1 + 2x2 = 2,
x1 |
0 |
2 |
2/3 |
-2 |
x2 |
1 |
0 |
2/3 |
2 |
For line 2x1 + x2 = 2,
x1 |
0 |
1 |
2/3 |
2 |
x2 |
2 |
0 |
2/3 |
-2 |
For line x1 + x2 = 2
\(\triangle\)ABE is feasible region whose corner points are A(2, 0), B(0, 2) and E(2/3, 2/3).
Corner points |
Objective function max Z = 3x1 + x2 |
(2, 0) |
6(max) |
(0, 2) |
2 |
(2/3, 2/3) |
8/3 |
\(\therefore\) solution of given linear programming problem is x1 = 2, x2 = 0 and max z = 6.