# Operating research

posted by .

Use simplex method to solve

Maximize p = 30x + 20y+30z subject to
x + y+z <= 9
4x + 2y-2z <= 30
5x + 10y+3z <= 60

x, y, z >=0

• Operating research -

I am wondering if you have a program, surely you are not contemplating doing this by hand.

http://people.hofstra.edu/stefan_waner/realworld/tutorialsf4/unit4_4.html

• Operating research -

HI,
AM ACTUALLY CALCULATING THS BY HAND.
THANKS FOR THE TUTORIALS..
AM SURE THEY WILL ASSIST ME GREATLY..

• Operating research -

There is also this example that describes in detail the use of the simplex tableau (by hand) for multiple constraints and variables.

It looks complicated but you will find it mechanical once you have understood it (like everything else in maths).

http://math.uww.edu/~mcfarlat/s-prob.htm

## Similar Questions

1. ### Simplex Method

Solve the linear programming problem by the simplex method. Maximize P = 10x + 6y subject to x + y < 80 3x < 90 x > 0, y > 0 x = y = P =
2. ### simplex Method

Solve the linear programming problem by the simplex method. Maximize P = 5x + 4y subject to 3x + 5y < 78 4x + y < 36 x > 0, y > 0 x = y = P =
3. ### Simplex Method

Solve the linear programming problem by the simplex method. Maximize P = 27x + 27y + 36z subject to x + y + 3z < 15 4x + 4y + 3z < 65 x > 0, y > 0, z > 0 x + y = z = P =
4. ### operation research 1

Use simplex method to solve Maximize p = 30x + 20y+30z subject to x + y+z <= 9 4x + 2y-2z <= 30 5x + 10y+3z <= 60 x, y, z >=0
5. ### maths/Operating research

Solve the LP using graphical method Maximize p = 30x + 40y subject to x + y <= 90 4x + 2y <= 150 50x + 100y <= 4500 x>=0, y>=0 Enter the answers(numbers only) in the order p, x, y
6. ### FInite Math

-.30x+.20y +.25z =0 .20x -.40y +.05z =0 .10x +.20y -.30z =0 x=?
7. ### FInite Math

-.30x+.20y +.25z =0 .20x -.40y +.05z =0 .10x +.20y -.30z =0 x=?
8. ### simplex method

Maximize P=60x+50y. ⎧ ⎪x+y≤80 ⎪ ⎪5x+10y≤560 ⎪ ⎪50x+20y≤1600 ⎪ ⎪x≥0 ⎨ ⎪y≥0 ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎩ Use the simplex method to solve the problem. Use s, t, and u as your slack variables for the first, …
9. ### linear programming problem

Consider the linear programming problem: Maximize P=60x+50y. x+y≤80 5x+10y≤560 50x+20y≤1600 x≥0 y≥0 Use the simplex method to solve the problem. Use s, t, and u as your slack variables for the first, second, and third inequalities …
10. ### The Simplex Method

Consider the linear programming problem Maximize P=60x+50y. x+y≤80 5x+10y≤560 50x+20y≤1600 x≥0 y≥0

More Similar Questions