Scribd Logo
Upload

Welcome to Scribd!

  • 36 views

    Ejercicios Clase Con Lindo 6.1

    Uploaded by

    Johan Dávila
    The document contains the results of 5 linear programming problems. Each problem provides the objective function to maximize or minimize, subject to constraints, and displays the optimal solution found after 1-2 iterations. The optimal objective value, variable values and dual prices are reported for each solved problem.

    Copyright:

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

    You might also like

    Ejercicios Clase Con Lindo 6.1

    Uploaded by

    Johan Dávila
    36 views4 pages
    The document contains the results of 5 linear programming problems. Each problem provides the objective function to maximize or minimize, subject to constraints, and displays the optimal solution found after 1-2 iterations. The optimal objective value, variable values and dual prices are reported for each solved problem.

    Original Description:

    Ejercicios Clase Con Lindo 6.1

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document contains the results of 5 linear programming problems. Each problem provides the objective function to maximize or minimize, subject to constraints, and displays the optimal solution found after 1-2 iterations. The optimal objective value, variable values and dual prices are reported for each solved problem.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    36 views4 pages

    Ejercicios Clase Con Lindo 6.1

    Uploaded by

    Johan Dávila
    The document contains the results of 5 linear programming problems. Each problem provides the objective function to maximize or minimize, subject to constraints, and displays the optimal solution found after 1-2 iterations. The optimal objective value, variable values and dual prices are reported for each solved problem.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 4

    1.

    Max 20x1+24x2
    subject to
    3x1+6x2<=60
    4x1+2x2<=32
    x1+2x2<=16
    end
    LP OPTIMUM FOUND AT STEP

    OBJECTIVE FUNCTION VALUE


    1)

    234.6667

    VARIABLE
    X1
    X2

    VALUE
    5.333333
    5.333333

    REDUCED COST
    0.000000
    0.000000

    ROW SLACK OR SURPLUS


    DUAL PRICES
    2)
    12.000000
    0.000000
    3)
    0.000000
    2.666667
    4)
    0.000000
    9.333333
    NO. ITERATIONS=

    RANGES IN WHICH THE BASIS IS UNCHANGED:


    OBJ COEFFICIENT RANGES
    VARIABLE
    CURRENT
    ALLOWABLE
    ALLOWABLE
    COEF
    INCREASE
    DECREASE
    X1
    20.000000
    27.999998
    8.000000
    X2
    24.000000
    16.000000
    13.999999
    ROW
    2
    3
    4

    RIGHTHAND SIDE RANGES


    CURRENT
    ALLOWABLE
    ALLOWABLE
    RHS
    INCREASE
    DECREASE
    60.000000
    INFINITY
    12.000000
    32.000000
    32.000000
    16.000000
    16.000000
    4.000000
    8.000000

    THE TABLEAU
    ROW (BASIS)
    X1
    X2 SLK 2 SLK 3 SLK 4
    1 ART
    0.000
    0.000
    0.000
    2.667
    9.333 234.667
    2 SLK 2
    0.000
    0.000
    1.000
    0.000 -3.000 12.000
    3
    X1
    1.000
    0.000
    0.000
    0.333 -0.333
    5.333
    4
    X2
    0.000
    1.000
    0.000 -0.167
    0.667
    5.333

    2. Min 30x1+80x2
    subject to

    x1<=800
    x2=>600
    x1+x2=2000
    end
    LP OPTIMUM FOUND AT STEP

    OBJECTIVE FUNCTION VALUE


    1)

    120000.0

    VARIABLE
    VALUE
    X1
    800.000000
    X2
    1200.000000

    REDUCED COST
    0.000000
    0.000000

    ROW SLACK OR SURPLUS


    DUAL PRICES
    2)
    0.000000
    50.000000
    3)
    600.000000
    0.000000
    4)
    0.000000
    -80.000000
    NO. ITERATIONS=

    RANGES IN WHICH THE BASIS IS UNCHANGED:


    VARIABLE
    X1
    X2
    ROW
    2
    3
    4

    OBJ COEFFICIENT RANGES


    CURRENT
    ALLOWABLE
    ALLOWABLE
    COEF
    INCREASE
    DECREASE
    30.000000
    50.000000
    INFINITY
    80.000000
    INFINITY
    50.000000

    RIGHTHAND SIDE RANGES


    CURRENT
    ALLOWABLE
    ALLOWABLE
    RHS
    INCREASE
    DECREASE
    800.000000
    600.000000
    800.000000
    600.000000
    600.000000
    INFINITY
    2000.000000
    INFINITY
    600.000000

    THE TABLEAU
    ROW (BASIS)
    X1
    X2 SLK 2 SLK 3
    1 ART
    0.00E+00 0.00E+00 50.
    0.00E+00 -0.12E+06
    2
    X2
    0.000
    1.000 -1.000
    0.000 1200.000
    3 SLK 3
    0.000
    0.000 -1.000
    1.000 600.000
    4
    X1
    1.000
    0.000
    1.000
    0.000 800.000

    3. Min 5x1-6x2-7x3
    subject to
    x1+5x2-3x3=>15
    5x1-6x2+10x3<=20

    x1+x2+x3=5
    end
    LP OPTIMUM FOUND AT STEP

    OBJECTIVE FUNCTION VALUE


    1)

    -31.25000

    VARIABLE
    X1
    X2
    X3

    VALUE
    0.000000
    3.750000
    1.250000

    REDUCED COST
    11.500000
    0.000000
    0.000000

    ROW SLACK OR SURPLUS


    DUAL PRICES
    2)
    0.000000
    -0.125000
    3)
    30.000000
    0.000000
    4)
    0.000000
    6.625000
    NO. ITERATIONS=

    RANGES IN WHICH THE BASIS IS UNCHANGED:


    VARIABLE
    X1
    X2
    X3
    ROW
    2
    3
    4

    OBJ COEFFICIENT RANGES


    CURRENT
    ALLOWABLE
    ALLOWABLE
    COEF
    INCREASE
    DECREASE
    5.000000
    INFINITY
    11.500000
    -6.000000
    23.000000
    1.000000
    -7.000000
    1.000000
    INFINITY
    RIGHTHAND SIDE RANGES
    CURRENT
    ALLOWABLE
    ALLOWABLE
    RHS
    INCREASE
    DECREASE
    15.000000
    10.000000
    15.000000
    20.000000
    INFINITY
    30.000000
    5.000000
    7.500000
    2.000000

    THE TABLEAU
    ROW (BASIS)
    X1
    X2
    X3 SLK 2 SLK 3
    1 ART
    11.500
    0.000
    0.000
    0.125
    0.000 31.250
    2
    X3
    0.500
    0.000
    1.000
    0.125
    0.000
    1.250
    3 SLK 3
    3.000
    0.000
    0.000 -2.000
    1.000 30.000
    4
    X2
    0.500
    1.000
    0.000 -0.125
    0.000
    3.750
    4. Max 3x1+2x2
    subject to
    2x1+x2<=2
    3x1+4x2=>12
    End

    No feasible solution at step


    5. Min 2x1+x2
    subject to
    3x1+x2=>3
    4x1+3x2=>6
    x1+2x2<=3
    end
    LP OPTIMUM FOUND AT STEP

    OBJECTIVE FUNCTION VALUE


    1)

    2.400000

    VARIABLE
    X1
    X2

    VALUE
    0.600000
    1.200000

    REDUCED COST
    0.000000
    0.000000

    ROW SLACK OR SURPLUS


    DUAL PRICES
    2)
    0.000000
    0.000000
    3)
    0.000000
    -0.600000
    4)
    0.000000
    0.400000
    NO. ITERATIONS=

    RANGES IN WHICH THE BASIS IS UNCHANGED:


    VARIABLE
    X1
    X2
    ROW
    2
    3
    4

    OBJ COEFFICIENT RANGES


    CURRENT
    ALLOWABLE
    ALLOWABLE
    COEF
    INCREASE
    DECREASE
    2.000000
    INFINITY
    0.666667
    1.000000
    0.500000
    INFINITY
    RIGHTHAND SIDE RANGES
    CURRENT
    ALLOWABLE
    ALLOWABLE
    RHS
    INCREASE
    DECREASE
    3.000000
    0.000000
    INFINITY
    6.000000
    6.000000
    0.000000
    3.000000
    0.000000
    1.500000

    THE TABLEAU
    ROW (BASIS)
    X1
    X2 SLK 2 SLK 3 SLK 4
    1 ART
    0.000
    0.000
    0.000
    0.600
    0.400 -2.400
    2 SLK 2
    0.000
    0.000
    1.000 -1.000 -1.000
    0.000
    3
    X1
    1.000
    0.000
    0.000 -0.400 -0.600
    0.600
    4
    X2
    0.000
    1.000
    0.000
    0.200
    0.800
    1.200

    You might also like