Question 85541: I need help understanding how to solve these types of problems: I've looked at many examples but i do not see it.
Use the simplex method to solve the linear programming problem:
minimize: W= 4y1+2y2
Subject to:
3y1+2y2>=60
4y1+y2>=40
y1>=0,y2>=0
Answer by stanbon(75887)   (Show Source):
You can put this solution on YOUR website! Use the simplex method to solve the linear programming problem:
minimize: W= 4y1+2y2
Subject to:
3y1+2y2>=60
4y1+y2>=40
y1>=0,y2>=0
--------------
Draw a y1-y2 coordinate system; let y2 be the horizontal axis.
Graph y1 >=(-2/3)y2+20
Graph y1 >=(-1/4)y2+10
Graph y1>=0
Graph y2>=0
-----------
Find all the intersection points of the EQUALITY statements.
These are (0,10), (0,20) and (24,4)
----------------
Evaluate w = 4y1 + 2y2 for each of the intersection coordinate pairs.
For (0,10) you get w = 20
For (0,20) you get w = 40
For (24,4) you get 4*24+2*4 = 104
-----------
Select the coordinate pair that gives you the minimum w value as your solution
That would be y1=0, y2=10.
==============
Cheers,
Stan H.
|
|
|
