Scribd Logo
Upload

Welcome to Scribd!

  • Simplex SRS

    Uploaded by

    Jose Martinez
    9 views1 page
    This linear programming problem aims to maximize the objective function Z = 3X1 + 2X2 - 3X3 subject to the constraints: 7X1 + 3X2 + 5X3 ≤ 2, 2X1 - 4X2 - 11X3 ≥ 40, and 5X1 - X2 - X3 = 20, with non-negativity constraints on X1 and X2 ≤ 0, and X3 being real.

    Original Description:

    Original Title

    SIMPLEX SRS.txt

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This linear programming problem aims to maximize the objective function Z = 3X1 + 2X2 - 3X3 subject to the constraints: 7X1 + 3X2 + 5X3 ≤ 2, 2X1 - 4X2 - 11X3 ≥ 40, and 5X1 - X2 - X3 = 20, with non-negativity constraints on X1 and X2 ≤ 0, and X3 being real.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    9 views1 page

    Simplex SRS

    Uploaded by

    Jose Martinez
    This linear programming problem aims to maximize the objective function Z = 3X1 + 2X2 - 3X3 subject to the constraints: 7X1 + 3X2 + 5X3 ≤ 2, 2X1 - 4X2 - 11X3 ≥ 40, and 5X1 - X2 - X3 = 20, with non-negativity constraints on X1 and X2 ≤ 0, and X3 being real.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    MAXIMIZAR Z = 3 X1 + 2 X2 - 3 X3

    S.A.:
    7 X1 + 3 X2 + 5 X3 <= 2
    2 X1 - 4 X2 - 11 X3 >= 40
    5 X1 - X2 - X3 = 20
    X1>=0 X2<=0 X3 SRS

    You might also like