- Thread starter
- #1

- Apr 14, 2013

- 4,447

Given the following linear programming problem

$$\min(2x + 3y + 6z + 4w)$$

$$x+2y+3z+w \geq 5$$

$$x+y+2z+3w \geq 3$$

$$x,y,z,w \geq 0$$

I am asked to find all the solutions using the simplex method.

To solve this problem we use the Two-Phase method, don't we?

Then I found that there are infinite many solutions, $(x,y,z,w)=(1-m, 2+0.4m, 0, 0.2m), 0≤m≤1$ with $min=8$.

Could you tell me if this is right?