Wednesday

October 1, 2014

October 1, 2014

Posted by **jas** on Wednesday, June 13, 2007 at 12:12pm.

directions are introduce slacks variables as necessary, then write the intial simplex tableau for each linear programming problem.

find x1 >= 0 and x2 >= 0 such that

x1+x2<=10

5x1+3x2<=75

and z=4x1+2x2 is maximized.

- math,help -
**Tiffany**, Monday, September 14, 2009 at 5:48pm1 2 3 115

2 1 1 200

1 0 1 50

1 1 4 0 is the first augmentation

1 2 1 1

2 1 0 1

3 1 1 4

115 200 50 0 is the second augmentation.

z = -w = -y1-y2-4y3

y1+2y2+3y3 >= 115

2y1 +y2+ y3 <= 200

y1 + y3 >=50

y1 y2 y3 s1 s2 s3 z

1 2 3 1 0 0 0 115

2 1 1 0 -1 0 0 200

1 0 1 0 0 1 0 50

-1 -1 -4 0 0 0 1 0 is the last augmentation and that is as far as I can get

**Answer this Question**

**Related Questions**

calculus/finite - I am taking an online finite math class, so I dont have an ...

Simplex Method - Solve the linear programming problem by the simplex method. ...

Simplex Method - Solve the linear programming problem by the simplex method. ...

simplex Method - Solve the linear programming problem by the simplex method. ...

math,help - this is from another section one of the problems can someone help me...

math , help - can someone show me how to solve this: directions: pivot once as ...

Business Math - Using the simplex method, solve the following linear programming...

Math - Maximize P= 8x1+12x2 Subject to 2x1+4x2<=24 3x1+3x2<=21 4x1+2x2<...

math.please help! - set up the linear programming problem. Do not solve. A ...

math,correction - Is this correct or no. I need help in a couple of problems can...