Scribd Logo
Upload

Welcome to Scribd!

  • Linear Program - Original Data: Title: We

    Uploaded by

    Kamalini K
    5 views2 pages
    The document is a summary report from an optimization software called TORA. It contains the original linear programming problem data to maximize profits subject to 3 constraints using variables x1 and x2. The graphical solution shows the feasible region and optimal solution is where x2 is at its maximum of 8 and x1 is 0, with an objective value of 16.

    Original Description:

    Original Title

    hh

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document is a summary report from an optimization software called TORA. It contains the original linear programming problem data to maximize profits subject to 3 constraints using variables x1 and x2. The graphical solution shows the feasible region and optimal solution is where x2 is at its maximum of 8 and x1 is 0, with an objective value of 16.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    5 views2 pages

    Linear Program - Original Data: Title: We

    Uploaded by

    Kamalini K
    The document is a summary report from an optimization software called TORA. It contains the original linear programming problem data to maximize profits subject to 3 constraints using variables x1 and x2. The graphical solution shows the feasible region and optimal solution is where x2 is at its maximum of 8 and x1 is 0, with an objective value of 16.

    Copyright:

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

    TORA Optimization System, Windows®-version 1.

    00
    Copyright © 2000-2002 Hamdy A. Taha. All Rights Reserved
    Thursday, February 22, 2024 10:21

    LINEAR PROGRAM -- ORIGINAL DATA

    Title: we

    x1 x2
    Maximize 3.00 2.00
    Subject to
    ( 1) 4.00 -1.00 <= 8.00
    ( 2) 4.00 0.00 <= 12.00
    ( 3) 4.00 1.00 <= 8.00

    Lower Bound 0.00 0.00


    Upper Bound infinity infinity
    Unrestr'd (y/n)? n n
    LINEAR PROGRAMMING -- GRAPHICAL SOLUTION

    Title: we

    Summary of Optimal Solution:


    Objective Value = 16.00
    x1 = 0.00
    x2 = 8.00

    9
    x2
    8

    -1 0 1 2 3 4 5 6 7 8 x1 9

    -1

    You might also like