Maximize:4x1+12x2
subject to:
3x1+x2<=180
x1+2x2<=100
-2x1+2x2<=40
X1>=0
x2>=0
Find the optimal solution for the above model
To find the optimal solution we have to draw the graph of the graph of the given constraints making all the given inequation as equation such as :
Now we draw the graph as follows:
Feasible solution of the given L.P.P was shown in the shaded region .
Since the shaded region is bounded, each corner points gives the optimal solution of the given L.P.P.
Solving and we get the corner point
Solving and we get the corner point
And also , and are the corner points of the feasible region.
Now at these corner points we will find the value of
Hence
Here we see that at , gives the maximum value.
Therefore and is the optimal solution of the above model.
Comments