Operating research

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

  1. 👍 0
  2. 👎 0
  3. 👁 174
asked by Terry
  1. 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

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

    1. 👍 0
    2. 👎 0
    posted by lilian
  3. 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

    1. 👍 0
    2. 👎 0

Respond to this Question

First Name

Your Response

Similar Questions

  1. operation research 1

    Use simplex method to solve Maximize p = 30x + 20y+30z subject to x + y+z

    asked by mashoo on June 17, 2011
  2. 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

    asked by Anonymous on November 23, 2016
  3. 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

    asked by RENTO on December 1, 2016
  4. FInite Math

    -.30x+.20y +.25z =0 .20x -.40y +.05z =0 .10x +.20y -.30z =0 x=? y=? z=?

    asked by Exhausted on February 20, 2012
  5. FInite Math

    -.30x+.20y +.25z =0 .20x -.40y +.05z =0 .10x +.20y -.30z =0 x=? y=? z=?

    asked by Exhausted on February 20, 2012
  6. 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 =

    asked by Leah on April 24, 2011
  7. 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 =

    asked by Leah on April 24, 2011
  8. 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 =

    asked by Leah on April 24, 2011
  9. math,help

    this is from another section one of the problems can someone help me. dierections: use the simplex method to solve each linear programming problem. maximize z = 12x1 +15x2 +5x3 subject to: 2x1+2x2+x3 =0,x3>0

    asked by jas on June 13, 2007
  10. Math

    Solve this linear programming problem using the simplex method: Maximize P = 21x + 12y + 24z subject to these constraints: 3x + 2y + 3z ≤ 864 15x + 6z ≤ 1296 9x + 8y + 18z ≤ 4608 x ≥ 0, y ≥ 0, z ≥ 0 Maximum value for P

    asked by John on September 20, 2010

More Similar Questions