Explore BrainMass

Explore BrainMass

    LP using simplex method

    This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

    Problem:
    Maximize: P= X1 + 2X2 +X3

    Subject to constraints
    3x1 + x2 + x3 <= 3
    x1 - 10x2 - 4x3 <=20

    x1>= 0 x2>=0 x3 >=0

    © BrainMass Inc. brainmass.com March 4, 2021, 5:39 pm ad1c9bdddf
    https://brainmass.com/math/linear-programming/lp-using-simplex-method-4566

    Solution Summary

    The solution solves a maximization problem using simplex method.

    $2.19

    ADVERTISEMENT