Scribd Logo
Upload

Welcome to Scribd!

  • Resolución de Problemas Usando Software Lindo: Lima Este

    Uploaded by

    Alex Marquez Ibarra
    27 views13 pages
    This document contains summaries of several linear programming problems solved using Lindo software. It begins with four problems related to furniture production, jewelry production, transistor and coil production, and carpentry work. It then covers problems involving bugs and nails, x-rays, production with four components, and automotive sales planning. The final section discusses special cases including a problem with a unique optimal solution, problems with alternative optimal solutions, and an infeasible problem with an empty feasible region.

    Original Description:

    Original Title

    ADEMAR.docx

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains summaries of several linear programming problems solved using Lindo software. It begins with four problems related to furniture production, jewelry production, transistor and coil production, and carpentry work. It then covers problems involving bugs and nails, x-rays, production with four components, and automotive sales planning. The final section discusses special cases including a problem with a unique optimal solution, problems with alternative optimal solutions, and an infeasible problem with an empty feasible region.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    27 views13 pages

    Resolución de Problemas Usando Software Lindo: Lima Este

    Uploaded by

    Alex Marquez Ibarra
    This document contains summaries of several linear programming problems solved using Lindo software. It begins with four problems related to furniture production, jewelry production, transistor and coil production, and carpentry work. It then covers problems involving bugs and nails, x-rays, production with four components, and automotive sales planning. The final section discusses special cases including a problem with a unique optimal solution, problems with alternative optimal solutions, and an infeasible problem with an empty feasible region.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 13

    LIMA ESTE

    RESOLUCIN DE PROBLEMAS USANDO SOFTWARE LINDO

    PROBLEMA DE LA MUEBLERIA
    LP OPTIMUM FOUND AT STEP

    OBJECTIVE FUNCTION VALUE


    1)

    3200.000

    VARIABLE
    X
    Y
    ROW
    2)
    3)
    4)

    VALUE
    10.000000
    10.000000

    REDUCED COST
    0.000000
    0.000000

    SLACK OR SURPLUS
    0.000000
    0.000000
    9.000000

    NO. ITERATIONS=

    DUAL PRICES
    40.000000
    20.000000
    0.000000

    RANGES IN WHICH THE BASIS IS UNCHANGED:


    VARIABLE
    X
    Y
    ROW
    2
    3
    4

    CURRENT
    COEF
    200.000000
    120.000000
    CURRENT
    RHS
    60.000000
    40.000000
    1.000000

    INVESTIGACION DE PERACIONES

    OBJ COEFFICIENT RANGES


    ALLOWABLE
    ALLOWABLE
    INCREASE
    DECREASE
    40.000000
    80.000000
    80.000000
    20.000000
    RIGHTHAND SIDE RANGES
    ALLOWABLE
    INCREASE
    20.000000
    18.000000
    9.000000

    ALLOWABLE
    DECREASE
    18.000000
    10.000000
    INFINITY

    V CICLO

    LIMA ESTE

    PROBLEMA DE PRODUCCION DE JOYAS

    LP OPTIMUM FOUND AT STEP

    OBJECTIVE FUNCTION VALUE


    1)

    16500.00

    VARIABLE
    X
    Y
    ROW
    2)
    3)
    4)

    VALUE
    300.000000
    300.000000

    REDUCED COST
    0.000000
    0.000000

    SLACK OR SURPLUS
    0.000000
    0.000000
    299.000000

    NO. ITERATIONS=

    DUAL PRICES
    16.000000
    6.000000
    0.000000

    RANGES IN WHICH THE BASIS IS UNCHANGED:


    OBJ COEFFICIENT RANGES
    VARIABLE
    X
    Y

    ROW
    2
    3
    4

    CURRENT
    COEF
    25.000000
    30.000000

    CURRENT
    RHS
    750.000000
    750.000000
    1.000000

    INVESTIGACION DE PERACIONES

    ALLOWABLE
    INCREASE
    20.000000
    7.500000

    ALLOWABLE
    DECREASE
    5.000000
    13.333333

    RIGHTHAND SIDE RANGES


    ALLOWABLE
    ALLOWABLE
    INCREASE
    DECREASE
    373.750000
    249.999985
    375.000000
    249.166656
    299.000000
    INFINITY

    V CICLO

    LIMA ESTE

    PROBLEMA DE TRANSISTORES Y BOBINAS

    LP OPTIMUM FOUND AT STEP

    OBJECTIVE FUNCTION VALUE


    1)

    233.3333

    VARIABLE

    VALUE
    166.666672
    66.666664

    X
    Y
    ROW
    2)
    3)
    4)
    5)

    REDUCED COST
    0.000000
    0.000000

    SLACK OR SURPLUS
    0.000000
    0.000000
    100.000000
    165.666672

    NO. ITERATIONS=

    DUAL PRICES
    0.333333
    0.333333
    0.000000
    0.000000

    RANGES IN WHICH THE BASIS IS UNCHANGED:


    VARIABLE
    X
    Y

    ROW
    2
    3
    4
    5

    CURRENT
    COEF
    1.000000
    1.000000

    OBJ COEFFICIENT RANGES


    ALLOWABLE
    ALLOWABLE
    INCREASE
    DECREASE
    1.000000
    0.500000
    1.000000
    0.500000

    CURRENT
    RHS
    300.000000
    400.000000
    400.000000
    1.000000

    RIGHTHAND SIDE RANGES


    ALLOWABLE
    ALLOWABLE
    INCREASE
    DECREASE
    100.000000
    99.999992
    199.999985
    248.500000
    INFINITY
    100.000000
    165.666672
    INFINITY

    INVESTIGACION DE PERACIONES

    V CICLO

    LIMA ESTE

    PROBLEMA DEL CARPINTERO


    LP OPTIMUM FOUND AT STEP

    OBJECTIVE FUNCTION VALUE


    1)

    110.0000

    VARIABLE

    VALUE
    10.000000
    20.000000

    X
    Y
    ROW
    2)
    3)
    4)

    SLACK OR SURPLUS
    0.000000
    0.000000
    9.000000

    NO. ITERATIONS=

    REDUCED COST
    0.000000
    0.000000
    DUAL PRICES
    2.333333
    0.333333
    0.000000

    RANGES IN WHICH THE BASIS IS UNCHANGED:

    VARIABLE
    X
    Y

    ROW
    2
    3
    4

    CURRENT
    COEF
    5.000000
    3.000000

    OBJ COEFFICIENT RANGES


    ALLOWABLE
    ALLOWABLE
    INCREASE
    DECREASE
    1.000000
    3.500000
    7.000000
    0.500000

    CURRENT
    RHS
    40.000000
    50.000000
    1.000000

    RIGHTHAND SIDE RANGES


    ALLOWABLE
    ALLOWABLE
    INCREASE
    DECREASE
    60.000000
    13.500000
    27.000000
    30.000000
    9.000000
    INFINITY

    INVESTIGACION DE PERACIONES

    V CICLO

    LIMA ESTE

    PROBLEMA DE CHINCHES Y CLAVO


    LP OPTIMUM FOUND AT STEP

    OBJECTIVE FUNCTION VALUE


    1)

    186.3333

    VARIABLE
    X
    Y
    ROW
    2)
    3)
    4)
    5)

    VALUE
    1.000000
    46.333332
    SLACK OR SURPLUS
    0.000000
    65.333336
    130.666672
    0.000000

    NO. ITERATIONS=

    REDUCED COST
    0.000000
    0.000000
    DUAL PRICES
    1.333333
    0.000000
    0.000000
    -0.333333

    RANGES IN WHICH THE BASIS IS UNCHANGED:


    OBJ COEFFICIENT RANGES
    VARIABLE
    X
    Y

    CURRENT
    COEF
    1.000000
    4.000000

    ALLOWABLE
    INCREASE
    0.333333
    INFINITY

    ALLOWABLE
    DECREASE
    INFINITY
    1.000000

    RIGHTHAND SIDE RANGES


    ROW
    2
    3
    4
    5

    CURRENT
    RHS
    140.000000
    160.000000
    180.000000
    1.000000

    INVESTIGACION DE PERACIONES

    ALLOWABLE
    INCREASE
    98.000000
    INFINITY
    INFINITY
    49.000000

    ALLOWABLE
    DECREASE
    138.999985
    65.333336
    130.666672
    1.000000

    V CICLO

    LIMA ESTE

    PROBLEMA DE RADIOGRAFIA
    LP OPTIMUM FOUND AT STEP

    OBJECTIVE FUNCTION VALUE


    1)

    500.0000

    VARIABLE

    VALUE
    50.000000
    100.000000

    X
    Y
    ROW
    2)
    3)
    4)
    5)

    SLACK OR SURPLUS
    0.000000
    30.000000
    0.000000
    49.000000

    NO. ITERATIONS=

    REDUCED COST
    0.000000
    0.000000
    DUAL PRICES
    -4.000000
    0.000000
    1.000000
    0.000000

    RANGES IN WHICH THE BASIS IS UNCHANGED:

    OBJ COEFFICIENT RANGES


    VARIABLE
    X
    Y

    CURRENT
    COEF
    4.000000
    3.000000

    ALLOWABLE
    INCREASE
    INFINITY
    1.000000

    ALLOWABLE
    DECREASE
    1.000000
    INFINITY

    RIGHTHAND SIDE RANGES


    ROW
    2
    3
    4
    5

    CURRENT
    RHS
    150.000000
    80.000000
    100.000000
    1.000000

    INVESTIGACION DE PERACIONES

    ALLOWABLE
    INCREASE
    30.000000
    INFINITY
    49.000000
    49.000000

    ALLOWABLE
    DECREASE
    49.000000
    30.000000
    30.000000
    INFINITY

    V CICLO

    LIMA ESTE
    PROBLEMA DE PRODUCCION CON 4 COMPONENTES
    LP OPTIMUM FOUND AT STEP

    OBJECTIVE FUNCTION VALUE


    1)

    22000.00

    VARIABLE
    X
    Y

    ROW

    VALUE
    4000.000000
    2000.000000

    REDUCED COST
    0.000000
    0.000000

    SLACK OR SURPLUS

    2)
    3)
    4)
    5)
    6)

    5000.000000
    0.000000
    0.000000
    4000.000000
    3999.000000

    NO. ITERATIONS=

    DUAL PRICES
    0.000000
    1.000000
    1.000000
    0.000000
    0.000000

    RANGES IN WHICH THE BASIS IS UNCHANGED:


    OBJ COEFFICIENT RANGES
    VARIABLE
    X
    Y

    CURRENT
    COEF
    4.000000
    3.000000

    ALLOWABLE
    INCREASE
    2.000000
    1.000000

    ALLOWABLE
    DECREASE
    1.000000
    1.000000

    RIGHTHAND SIDE RANGES


    ROW
    2
    3
    4
    5
    6

    CURRENT
    RHS
    15000.000000
    10000.000000
    12000.000000
    10000.000000
    1.000000

    INVESTIGACION DE PERACIONES

    ALLOWABLE
    INCREASE
    INFINITY
    2000.000000
    2000.000000
    INFINITY
    3999.000000

    ALLOWABLE
    DECREASE
    5000.000000
    2500.000000
    2000.000000
    4000.000000
    INFINITY

    V CICLO

    LIMA ESTE
    PROBLEMA

    DE PLANEACION DE VENTA AUTOMOTRIZ

    LP OPTIMUM FOUND AT STEP

    OBJECTIVE FUNCTION VALUE


    1)

    1300000.

    VARIABLE
    X
    Y

    ROW
    2)
    3)
    4)
    5)

    VALUE
    300.000000
    100.000000

    SLACK OR SURPLUS
    0.000000
    0.000000
    100.000000
    299.000000

    NO. ITERATIONS=

    REDUCED COST
    0.000000
    0.000000

    DUAL PRICES
    1333.333374
    333.333344
    0.000000
    0.000000

    RANGES IN WHICH THE BASIS IS UNCHANGED:


    OBJ COEFFICIENT RANGES
    VARIABLE
    X
    Y

    CURRENT
    COEF
    3000.000000
    4000.000000

    ALLOWABLE
    INCREASE
    INFINITY
    500.000000

    ALLOWABLE
    DECREASE
    333.333344
    4000.000000

    RIGHTHAND SIDE RANGES


    ROW
    2
    3
    4
    5

    CURRENT
    RHS
    900.000000
    300.000000
    200.000000
    1.000000

    INVESTIGACION DE PERACIONES

    ALLOWABLE
    INCREASE
    300.000000
    150.000000
    INFINITY
    299.000000

    ALLOWABLE
    DECREASE
    300.000000
    150.000000
    100.000000
    INFINITY

    V CICLO

    LIMA ESTE

    PROBLEMA DE TORNILLOS Y CLAVOS


    LP OPTIMUM FOUND AT STEP

    OBJECTIVE FUNCTION VALUE


    1)

    335.0000

    VARIABLE
    X
    Y
    ROW
    2)
    3)
    4)

    VALUE
    15.000000
    50.000000
    SLACK OR SURPLUS
    0.000000
    0.000000
    14.000000

    NO. ITERATIONS=

    REDUCED COST
    0.000000
    0.000000
    DUAL PRICES
    0.125000
    1.750000
    0.000000

    RANGES IN WHICH THE BASIS IS UNCHANGED:


    OBJ COEFFICIENT RANGES
    VARIABLE
    X
    Y

    CURRENT
    COEF
    4.000000
    5.500000

    ALLOWABLE
    INCREASE
    7.000000
    0.500000

    ALLOWABLE
    DECREASE
    0.333333
    3.500000

    RIGHTHAND SIDE RANGES


    ROW
    2
    3
    4

    CURRENT
    RHS
    160.000000
    180.000000
    1.000000

    INVESTIGACION DE PERACIONES

    ALLOWABLE
    INCREASE
    200.000000
    56.000000
    14.000000

    ALLOWABLE
    DECREASE
    37.333332
    100.000000
    INFINITY

    V CICLO

    LIMA ESTE
    CASOS ESPECIALES
    CASO I
    El PL tiene solucin ptima nica

    PROBLEMA DE LA MUEBLERIA
    LP OPTIMUM FOUND AT STEP

    OBJECTIVE FUNCTION VALUE


    1)

    3200.000

    VARIABLE
    X
    Y
    ROW
    2)
    3)
    4)

    VALUE
    10.000000
    10.000000

    REDUCED COST
    0.000000
    0.000000

    SLACK OR SURPLUS
    0.000000
    0.000000
    9.000000

    NO. ITERATIONS=

    DUAL PRICES
    40.000000
    20.000000
    0.000000

    RANGES IN WHICH THE BASIS IS UNCHANGED:


    VARIABLE
    X
    Y
    ROW
    2
    3
    4

    CURRENT
    COEF
    200.000000
    120.000000
    CURRENT
    RHS
    60.000000
    40.000000
    1.000000

    INVESTIGACION DE PERACIONES

    OBJ COEFFICIENT RANGES


    ALLOWABLE
    ALLOWABLE
    INCREASE
    DECREASE
    40.000000
    80.000000
    80.000000
    20.000000
    RIGHTHAND SIDE RANGES
    ALLOWABLE
    INCREASE
    20.000000
    18.000000
    9.000000

    ALLOWABLE
    DECREASE
    18.000000
    10.000000
    INFINITY

    V CICLO

    LIMA ESTE
    CASO II
    El PL tiene soluciones ptimas alternativas: dos o ms puntos extremos son ptimos y
    la PL tendr un nmero infinito de soluciones ptimas.

    PROBLEMA DE AUTOMOVILES Y CAMIONES

    LP OPTIMUM FOUND AT STEP

    OBJECTIVE FUNCTION VALUE


    1)

    12000.00

    VARIABLE
    X
    Y
    ROW
    2)
    3)
    4)

    VALUE
    1.000000
    39.333332
    SLACK OR SURPLUS
    0.000000
    9.666667
    0.000000

    NO. ITERATIONS=

    REDUCED COST
    0.000000
    0.000000
    DUAL PRICES
    100.000000
    0.000000
    0.000000

    RANGES IN WHICH THE BASIS IS UNCHANGED:


    OBJ COEFFICIENT RANGES
    VARIABLE
    X
    Y

    CURRENT
    COEF
    200.000000
    300.000000

    ALLOWABLE
    INCREASE
    0.000000
    INFINITY

    ALLOWABLE
    DECREASE
    INFINITY
    0.000000

    RIGHTHAND SIDE RANGES


    ROW
    2
    3
    4

    CURRENT
    RHS
    120.000000
    50.000000
    1.000000

    INVESTIGACION DE PERACIONES

    ALLOWABLE
    INCREASE
    29.000000
    INFINITY
    29.000000

    ALLOWABLE
    DECREASE
    117.999992
    9.666667
    1.000000

    V CICLO

    LIMA ESTE
    CASO III
    El PL es no factible pues ningn punto satisface todas las restricciones. Esto significa
    que la regin factible es vaca, la regin no contiene puntos.

    PROBLEMA DE AUTOMOVILES Y CAMIONES

    LP OPTIMUM FOUND AT STEP

    OBJECTIVE FUNCTION VALUE


    1)

    12000.00

    VARIABLE
    X
    Y
    ROW
    2)
    3)
    4)
    5)
    6)

    VALUE
    20.000000
    26.666666

    REDUCED COST
    0.000000
    0.000000

    SLACK OR SURPLUS
    0.000000
    3.333333
    0.000000
    -3.333333
    19.000000

    NO. ITERATIONS=

    DUAL PRICES
    0.333333
    0.000000
    -0.666667
    -1.000000
    0.000000

    RANGES IN WHICH THE BASIS IS UNCHANGED:


    OBJ COEFFICIENT RANGES
    VARIABLE
    X
    Y

    CURRENT
    COEF
    200.000000
    300.000000

    ALLOWABLE
    INCREASE
    0.000000
    INFINITY

    ALLOWABLE
    DECREASE
    INFINITY
    0.000000

    RIGHTHAND SIDE RANGES


    ROW
    2
    3
    4
    5
    6

    CURRENT
    RHS
    120.000000
    50.000000
    20.000000
    30.000000
    1.000000

    INVESTIGACION DE PERACIONES

    ALLOWABLE
    INCREASE
    9.999999
    INFINITY
    -5.000000
    -3.333333
    19.000000

    ALLOWABLE
    DECREASE
    -9.999999
    3.333333
    19.000000
    INFINITY
    INFINITY

    V CICLO

    LIMA ESTE
    CASO IV
    El PL es una regin no acotada: hay puntos en la regin factible con valores z
    arbitrariamente grandes (problemas de maximizacin) o arbitrariamente pequeos
    (problemas de minimizacin)

    PROBLEMA DE AUTOMOVILES Y CAMIONES

    LP OPTIMUM FOUND AT STEP

    OBJECTIVE FUNCTION VALUE


    1)

    3.333333

    VARIABLE
    X
    Y
    ROW
    2)
    3)
    4)

    VALUE
    2.333333
    1.333333
    SLACK OR SURPLUS
    0.000000
    0.000000
    1.333333

    NO. ITERATIONS=

    REDUCED COST
    0.000000
    0.000000
    DUAL PRICES
    1.333333
    0.333333
    0.000000

    RANGES IN WHICH THE BASIS IS UNCHANGED:

    VARIABLE
    X
    Y

    ROW
    2
    3
    4

    CURRENT
    COEF
    2.000000
    -1.000000

    OBJ COEFFICIENT RANGES


    ALLOWABLE
    ALLOWABLE
    INCREASE
    DECREASE
    INFINITY
    1.000000
    2.000000
    1.000000

    CURRENT
    RHS
    1.000000
    6.000000
    1.000000

    RIGHTHAND SIDE RANGES


    ALLOWABLE
    ALLOWABLE
    INCREASE
    DECREASE
    2.000000
    4.000000
    INFINITY
    4.000000
    1.333333
    INFINITY

    INVESTIGACION DE PERACIONES

    V CICLO

    You might also like