math,help
posted by jas .
also can somone explain to me these types of problems.
directions are introduce slacks variables as necessary, then write the intial simplex tableau for each linear programming problem.
find x1 >= 0 and x2 >= 0 such that
x1+x2<=10
5x1+3x2<=75
and z=4x1+2x2 is maximized.

1 2 3 115
2 1 1 200
1 0 1 50
1 1 4 0 is the first augmentation
1 2 1 1
2 1 0 1
3 1 1 4
115 200 50 0 is the second augmentation.
z = w = y1y24y3
y1+2y2+3y3 >= 115
2y1 +y2+ y3 <= 200
y1 + y3 >=50
y1 y2 y3 s1 s2 s3 z
1 2 3 1 0 0 0 115
2 1 1 0 1 0 0 200
1 0 1 0 0 1 0 50
1 1 4 0 0 0 1 0 is the last augmentation and that is as far as I can get 
2x1+5x1/10+5x1/100 in decimal number
Respond to this Question
Similar Questions

math , help
can someone show me how to solve this: directions: pivot once as indicated in each simplex tableau. Read the solution from the result. the number that is highlighted is row 2 column 3 which is the 5 the matrix is a 4 X 8 under column … 
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 … 
calculus/finite
I am taking an online finite math class, so I don't have an instuctor to sit down with me and help me. The text book is so hard to follow. One of the problems I have having a hard time with gives an initial tableau and asks us to use … 
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 = 
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 … 
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