Explore BrainMass

Explore BrainMass

    Linear Programming Matrix

    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!

    See attch for problem

    Consider the following linear programming problem:

    Maximize 3x -y subject to:

    6x - 5y, < 24
    x + 9y > 63
    x > 0,
    y > 0

    Which of the following is the initial simplex tableau?

    A) x y u v M
    6 -5 1 0 0 24
    1 9 0 1 0 63
    -3 1 0 0 1 0

    B) x y u v M
    6 -5 1 0 0 24
    -1 -9 0 1 0 -63
    3 -1 0 0 1 0

    C) x y u v M
    6 -5 1 0 0 24
    -1 -9 0 1 0 -63
    -3 1 0 0 1 0

    D) x y u v M
    6 -5 1 0 0 24
    1 9 0 0 1 -63
    3 -1 0 0 1 0

    © BrainMass Inc. brainmass.com March 4, 2021, 6:26 pm ad1c9bdddf
    https://brainmass.com/math/linear-programming/linear-programming-matrix-45108

    Attachments

    Solution Summary

    The expert examines linear programming matrices.

    $2.49

    ADVERTISEMENT