math,help
posted by jas .
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 x>=0,x2>=0,x3>0
Respond to this Question
Similar Questions

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 = 
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 = 
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 = 
Linear Algebra
Solve the following system using Gauss's algorithm (a) x1 + 2x2 + 4x3 + 6x4 = 3 2x1 + x2 + 3x3 = 6 2x1 + x2 + 6x3 + 4x4 = 11 2x1 + x2 + x3 = 0 so the matrix will be: 1 2 4 6 3 2 1 3 0 6 2 1 6 4 11 2 1 1 0 0 
Business Math
Using the simplex method, solve the following linear programming problem: Maximize: P= 5x+2y Subject to: 4x+3y < or equal to 30 2x3y < or equal to 6 x > or equal to 0, y > or equal to 0. 
Math
Maximize P= 8x1+12x2 Subject to 2x1+4x2<=24 3x1+3x2<=21 4x1+2x2<=20 X1, x2 => 0 Using the SIMPLEX method. Clearly state the row operations used. For each tableau used, complete the leftmost column by providing the appropriate … 
maths
Write the system as a matrix equation and solve using inverses. x1 + 2x2  x3 = 3 2x1  x2 + 3x3 = 0 4x1 + 4x2  x3 = 12 A. x1 = 2, x2 = 3, x3 = 1 B. x1 = 1, x2 = 2, x3 = 1 C. x1 = 1, x2 = 2, x3 = 0 D. x1 = 1, x2 = 3, x3 = … 
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 
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, … 
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 …