Explore BrainMass
Share

Explore BrainMass

    Algebra - Linear Programming

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

    1. Maximize z = 4x1 + 2x2
    Subject to -x1 - x2 ≤ 12
    3x1 - x2 ≤ 15
    x1 ≥ 0, x2 ≥ 0.
    2. Maximize z = 5x1 + 4x2 + x3
    Subject to -2x1 + x2 + 2x3 ≤ 3
    x1 - x2 + x3 ≤ 1
    x1 ≥ 0, x2 ≥ 0, x3 ≥ 0.

    © BrainMass Inc. brainmass.com May 20, 2020, 4:44 pm ad1c9bdddf
    https://brainmass.com/math/linear-algebra/algebra-linear-programming-maximizing-189654

    Attachments

    Solution Summary

    The expert examines linear programming for maximizing functions. Neat, step-by-step solutions are provided for all the problems.

    $2.19

    ADVERTISEMENT