# math,help

and then this one as well :

state the dual problem for each linear programming problem.

minimize w =y1+y2+4y3
subject to: y1+2y2+3y3 >=115
2y1+y2+8y3>=200
y1 +y3 >=50
with y1>=0, y2>=0, y3>=0

1. 👍 0
2. 👎 0
3. 👁 84

## Similar Questions

1. ### 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
2. ### math,finite mathematics

this is what i have so far for the following problem but i don't know what to do next: Use the simplex method to solve the linear programming problem minimize W = 4 y1 + 2y2 subject to: 3y1+2y2>=60 4y1+y2>=40 y1>=0,y2>=0 so this

asked by student on June 17, 2007
3. ### Math

Solve the linear programming problem by the method of corners. Minimize C = 3x + 7y subject to 4x + y ≥ 39 2x + y ≥ 29 x + 3y ≥ 42 x ≥ 0, y ≥

asked by ANGELA on February 23, 2011
4. ### 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
5. ### HELPPP

Solve the linear programming problem by the method of corners. Minimize C = 5x + y subject to x + 3y ≥ 43 x + y ≥ 27 x ≥ 0, y ≥ 0

asked by Leah on April 18, 2011
6. ### 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
7. ### math

If the solution to the linear programming problem exists, then it has to be at a corner point.it is true or false?

asked by sateko on April 18, 2011

set up the linear programming problem. Do not solve. A brewery manufactures three types of beer-lite, regular and dark. Each vat of lite beer requires 6 bags of barley, 1 bag of sugar, and 1 bag of hops. Each vat of regular bear

asked by sha on July 19, 2010
9. ### 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

asked by Ferguson on December 6, 2016
10. ### 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

More Similar Questions