Explore BrainMass

Explore BrainMass

    Linear programming (primal problem)

    Not what you're looking for? Search our solutions OR ask your own Custom question.

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

    Please see attached documents for further details.

    Consider the following linear program (primal problem):
    Minimize f(x1; x2) = 10x1 + 14x2

    subject to

    x1 + 2x2 â?¥ 3
    2x1 + x2 â?¥ 4
    3x1 + x2 â?¥ 2
    x1, x2 â?¥ 0.

    a. Set up the dual of the above linear program.
    b. Use the simplex method to solve the dual problem.
    c. Use your work in (b) to give an optimal solution (x¯1, x2â?¾â?¾), as well as the optimal value of the objective function f, for the primal problem.

    © BrainMass Inc. brainmass.com March 4, 2021, 10:41 pm ad1c9bdddf
    https://brainmass.com/math/linear-algebra/linear-programming-primal-problem-simplex-method-353676

    Attachments

    Solution Summary

    The solution uses the simplex method to solve the dual problem.

    $2.49

    ADVERTISEMENT