math,finite mathematics

posted by .

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 is how i started it:

i did it in the form of a matrix

3 2 60
4 1 40
------------
4 2 0


then i did the flip on the side

3 4 4
2 1 2
------------
60 40 0


I am just trying to follow the book but after i do the fliping thing i have trouble with the next steps:

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,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
  3. 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 …
  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. Infinite math

    use the M method to solve the following linear programming problem: Minimize C+ -5x+10x+15x Subject to 2x+3x+x <(or equal to) 24 x-2x-2x >(or equal to) 1 x,,x,x>(and equal to) 0
  8. 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.
  9. 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, …
  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