Explore BrainMass
Share

Explore BrainMass

    Solving linear programming model by graphical method

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

    Solve the following linear programming model graphically:

    Minimize Z = 8X1 + 2X2

    S.T.
    2X1 - 6X2 ≤ 12
    5X1 + 4X2 ≥ 40
    X1 + 2X2 ≥ 12
    X2 ≤ 6
    X1, X2 ≥ 0

    © BrainMass Inc. brainmass.com October 9, 2019, 9:47 pm ad1c9bdddf
    https://brainmass.com/statistics/linear-regression/solving-linear-programming-model-by-graphical-method-197422

    Solution Summary

    Detailed solution is provided to explain the concept.

    $2.19