Simplex Method

posted by .

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 =

Respond to this Question

First Name
School Subject
Your Answer

Similar Questions

  1. 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 <= 8 x1+4x2+3x3<=12 with …
  2. 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 ≥ …
  3. 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 =
  4. 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 =
  5. 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
  6. Business Math

    Using the simplex method, solve the following linear programming problem: Maximize: P= 5x+2y Subject to: 4x+3y < or equal to 30 2x-3y < or equal to 6 x > or equal to 0, y > or equal to 0.
  7. Math

    Use the simplex meth to solve the linear programming problem Maximize z = 8x1 + 2x2 Subject to: 4x1 + 3x2 < 11 X1 + 4x2 < 7 With x1 > 0, x2> 0
  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