Post a New Question

math,help

posted by on .

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.

  • math,help - ,

    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 = -y1-y2-4y3
    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

  • math,help - ,

    2x1+5x1/10+5x1/100 in decimal number

Answer This Question

First Name:
School Subject:
Answer:

Related Questions

More Related Questions

Post a New Question