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

also can somone explain to me these types of problems.

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.

## 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 - Use the simplex meth to solve the linear programming problem Maximize z...
- math , help - can someone show me how to solve this: directions: pivot once as ...
- Math - Maximize P= 8x1+12x2 Subject to 2x1+4x2<=24 3x1+3x2<=21 4x1+2x2<...
- Business Math - Using the simplex method, solve the following linear programming...
- math.please help! - set up the linear programming problem. Do not solve. A ...

More Related Questions