Scribd Logo
Upload

Welcome to Scribd!

  • Practica 9-10-2020

    Uploaded by

    Yojhan Cahuana
    7 views9 pages
    1. The document describes minimizing an objective function subject to multiple inequality constraints. It provides the formulation, solution steps including tables of variables and Lagrange multipliers, and the optimal solution. 2. A second problem is presented with similar formulation, constraints, and solution approach as the first problem. 3. A third problem is presented with the same general structure as the first two problems: objective function to minimize, inequality constraints, solution tables with iterations, and optimal solution.

    Original Description:

    Original Title

    PRACTICA 9-10-2020

    Copyright

    © © All Rights Reserved

    Available Formats

    XLSX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    1. The document describes minimizing an objective function subject to multiple inequality constraints. It provides the formulation, solution steps including tables of variables and Lagrange multipliers, and the optimal solution. 2. A second problem is presented with similar formulation, constraints, and solution approach as the first problem. 3. A third problem is presented with the same general structure as the first two problems: objective function to minimize, inequality constraints, solution tables with iterations, and optimal solution.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    7 views9 pages

    Practica 9-10-2020

    Uploaded by

    Yojhan Cahuana
    1. The document describes minimizing an objective function subject to multiple inequality constraints. It provides the formulation, solution steps including tables of variables and Lagrange multipliers, and the optimal solution. 2. A second problem is presented with similar formulation, constraints, and solution approach as the first problem. 3. A third problem is presented with the same general structure as the first two problems: objective function to minimize, inequality constraints, solution tables with iterations, and optimal solution.

    Copyright:

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

    1.

    - MINIMIZAR Z=3x-2y z-3x+2y=0

    2x+y ≤18 2x+y+H1= 18


    2x+3y ≤42 2x+3y+H2= 42
    3x-2y ≤5 3X-2Y+H3= 5

    x,y≥0

    SOLUCION

    TABLA N°01

    - Z x y H1 H2 H3
    Z 1 -3 2 0 0 0
    H1 0 2 1 1 0 0
    H2 0 2 3 0 1 0
    H3 0 3 -2 0 0 1

    TABLA N°02 ITERACION 1

    - Z x y H1 H2 H3
    Z 1 -4 1/3 0 0 - 2/3 0
    H1 0 1 1/3 0 1 - 1/3 0
    Y 0 2/3 1 0 1/3 0
    H3 0 4 1/3 0 0 2/3 1

    SOLUCION OPTIMA

    Z= -28 2x+y+H1= 18
    x= 0 2x+14+4= 18
    y= 14 2x= 0
    H1= 4 x= 0
    2.- MINIMIZAR R=-3x-y R+3x+y=

    x+2y ≤5 x+2y+H1=
    x+y-z ≤2 x+y-z+H2=
    7x+3y-5z ≤20 7x+3y-5z+H3=

    x,y≥0

    SOLUCION

    TABLA N°01

    BI DIVISION - R x y
    0 0 R 1 -3 -1
    18 18 H1 0 1 2
    42 14 H2 0 1 1
    5 -2.5 H3 0 7 3

    TABLA N°02 ITERACION 1

    BI - R x y
    -28 R 1 0 2
    4 H1 0 0 1
    14 x 0 1 1
    33 H3 0 0 -4

    TABLA N°03 ITERACION 2

    - R x y
    R 1 0 5
    Y 0 0 1
    X 0 1 2
    H3 0 0 -6

    SOLUCION OPTIMA

    R= 15
    Z= 3
    X= 5
    Y= 0

    MAXIMIZAR (-R) z=3x+y

    x+2y+H1=
    x+y-z+H2
    7x+3y-5z+H3

    x,y,z≥0

    SOLUCION

    TABLA N°01

    - R x y
    R 1 -3 -1
    H1 0 1 2
    H2 0 1 1
    H3 0 7 3

    TABLA N°02 ITERACION 1

    - R x y
    R 1 0 2
    H1 0 0 1
    x 0 1 1
    H3 0 0 -4

    TABLA N°03 ITERACION 2

    - R x y
    R 1 0 5
    Y 0 0 1
    X 0 1 2
    H3 0 0 -6

    SOLUCION OPTIMA

    R= 15
    Z= 3
    X= 5
    Y= 0
    0 3.-

    5
    2
    20

    Z H1 H2 H3 BI DIVISION
    0 0 0 0 0 0
    0 1 0 0 5 5
    -1 0 1 0 2 2
    -5 0 0 1 20 2 6/7

    Z H1 H2 H3 BI DIVISION
    -3 0 3 0 6 3
    1 1 -1 0 3 3
    -1 0 1 0 2 2
    2 0 -7 1 6 -1.5

    SOLUCION OPTIM

    Z H1 H2 H3 BI
    0 3 0 0 15
    1 1 -1 0 3
    0 1 0 0 5
    0 -2 -5 1 0
    5
    2
    20

    Z H1 H2 H3 BI DIVISION
    0 0 0 0 0 0
    0 1 0 0 5 5
    -1 0 1 0 2 2
    -5 0 0 1 20 2 6/7

    Z H1 H2 H3 BI DIVISION
    -3 0 3 0 6
    1 1 -1 0 3
    -1 0 1 0 2
    2 0 -7 1 6

    Z H1 H2 H3 BI
    0 3 0 0 15
    1 1 -1 0 3
    0 1 0 0 5
    0 -2 -5 1 0
    MINIMIZAR Z=-3X-2Y Z+3x+2y= 0

    2x+y ≤18 2x+y+H1= 18


    2x+3y ≤42 2x+3y+H2= 42
    3x+y ≤24 3x+y+H3= 24

    SOLUCION

    TABLA N°01

    - Z x y H1 H2 H3 BI
    Z 1 3 1 0 0 0 0
    H1 0 2 1 1 0 0 18
    H2 0 2 3 0 1 0 42
    H3 0 3 1 0 0 1 24

    TABLA N°02 ITERACION 1

    - Z x y H1 H2 H3 BI
    Z 1 0 0 0 0 -1 -24
    H1 0 0 1/3 1 0 - 2/3 2
    H2 0 0 2 1/3 0 1 - 2/3 26
    X 0 1 1/3 0 0 1/3 8

    SOLUCION OPTIMA

    Z= -24
    x= 8
    y= 0
    H1= 2
    DIVISION
    0
    9
    21
    8

    You might also like