Math

posted by .

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 = ?.

This value of P occurs when:
x = ?
y = ?
z = ?

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. Linear Programming

    Maximize P = 16x + 80y subject to these constraints: 2x + 20y ≤ 430 4x + 70y ≤ 1400 8x + 30y ≤ 980 10x + 10y ≤ 1000 4x + 30y ≤ 700 x ≥ 0, y ≥ 0 Maximum value for P = ?
  3. Math

    Use the simplex method to find the maximum value of P = 3x + 3y subject to these constraints: 3x + 2y ≤ 360 x - y ≤ 60 y ≤ 120 x ≥ 0, y ≥ 0 What is the maximum value of P?
  4. 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 =
  5. 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 =
  6. 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 =
  7. 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.
  8. algebra 1 help please

    4) a student score is 83 and 91 on her first two quizzes. write and solve a compound inequality to find possible values for a thord quiz score that would give anverage between 85 and 90. a. 85≤83+91+n/3 ≤90; 81≤n≤96 …
  9. Algebra

    Maximize the following objective function using simplex method: Z=10 X_(1 )+8 X_2 Subject To: 3 X_1+1X_2 ≤4500 2 X_1+2X_2 ≤4000 X_1+3X_2 ≤4500 With X_1 ≥0 X_2 ≥0
  10. 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 …

More Similar Questions