Scribd Logo
Upload

Welcome to Scribd!

  • Maximizar: 4 Maximizar: 4 X: Deber #5 Nombre: Jessica Allauca FECHA: 27 de Octubre de 2014 Tema: Metodo Simpex

    Uploaded by

    jessica94allauca
    68 views3 pages
    The document describes solving an optimization problem using the simplex method. It presents the objective function and constraints of the problem and shows the steps of the simplex method to find the optimal solution. The optimal solution found is Z = 30, with X1 = 0 and X2 = 5. It then presents a similar optimization problem with more variables and shows the simplex method steps to find its optimal solution.

    Original Description:

    Original Title

    JESS.docx

    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 describes solving an optimization problem using the simplex method. It presents the objective function and constraints of the problem and shows the steps of the simplex method to find the optimal solution. The optimal solution found is Z = 30, with X1 = 0 and X2 = 5. It then presents a similar optimization problem with more variables and shows the simplex method steps to find its optimal solution.

    Copyright:

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

    Maximizar: 4 Maximizar: 4 X: Deber #5 Nombre: Jessica Allauca FECHA: 27 de Octubre de 2014 Tema: Metodo Simpex

    Uploaded by

    jessica94allauca
    The document describes solving an optimization problem using the simplex method. It presents the objective function and constraints of the problem and shows the steps of the simplex method to find the optimal solution. The optimal solution found is Z = 30, with X1 = 0 and X2 = 5. It then presents a similar optimization problem with more variables and shows the simplex method steps to find its optimal solution.

    Copyright:

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

    DEBER N 5

    NOMBRE: JESSICA ALLAUCA


    FECHA: 27 de Octubre de 2014
    TEMA: METODO SIMPEX

    MAXIMIZAR: 4
    X1 + 6 X2
    2 X1 + 1 X2 17
    3 X1 + 2 X2 10
    1 X1 + 1 X2 12
    X1 , X2 0
    Tabla 1

    MAXIMIZAR: 4 X1 + 6
    X2 + 0 X3 + 0 X4 + 0 X5
    2 X1 + 1 X2 + 1 X3 = 17
    3 X1 + 2 X2 + 1 X4 = 10
    1 X1 + 1 X2 + 1 X5 = 12
    X1, X2, X3, X4, X5 0
    4

    Base

    Cb

    P0

    P1

    P2

    P3

    P4

    P5

    P3

    17

    P4

    10

    P5

    12

    -4

    -6

    Tabla 2

    Base

    Cb

    P0

    P1

    P2

    P3

    P4

    P5

    P3

    12

    0.5

    -0.5

    P2

    1.5

    0.5

    P5

    -0.5

    -0.5

    30

    La solucin ptima es Z = 30
    X1 = 0
    X2 = 5

    MAXIMIZAR: 300 X1 +
    500 X2 + 350 X3 + 0 X4 +
    0 X5 + 0 X6 + 0 X7
    1 X1 + 5 X2 -3 X3 + 1 X4 =
    50
    5 X1 + 2 X2 + 6 X3 + 1
    X5 = 89
    4 X1 + 1 X2 -1 X3 + 1 X6 =
    76
    2 X1 + 2 X2 + 7 X3 + 1
    X7 = 95
    X1, X2, X3, X4, X5, X6,
    X7 0

    MAXIMIZAR: 300
    X1 + 500 X2 + 350 X3
    1 X1 + 5 X2 -3 X3 50
    5 X1 + 2 X2 + 6 X3
    89
    4 X1 + 1 X2 -1 X3 76
    2 X1 + 2 X2 + 7 X3
    95
    X1 , X2 , X3 0

    Tabla 1

    300

    500

    350

    Base

    Cb

    P0

    P1

    P2

    P3

    P4

    P5

    P6

    P7

    P4

    50

    -3

    P5

    89

    P6

    76

    -1

    P7

    95

    -300

    -500

    -350

    Tabla 2

    300

    500

    350

    Base

    Cb

    P0

    P1

    P2

    P3

    P4

    P5

    P6

    P7

    P2

    500

    10

    0.2

    -0.6

    0.2

    P5

    69

    4.6

    7.2

    -0.4

    P6

    66

    3.8

    -0.4

    -0.2

    P7

    75

    1.6

    8.2

    -0.4

    5000

    -200

    -650

    100

    Tabla
    3

    300

    500

    350

    Base

    Cb

    P0

    P1

    P2

    P3

    P4

    P5

    P6

    P7

    P2

    500

    635 / 41

    13 / 41

    7 / 41

    3 / 41

    P5

    129 / 41

    131 /
    41

    -2 / 41

    -36 /
    41

    P6

    2856 / 41

    159 /
    41

    -9 / 41

    2 / 41

    P3

    350

    375 / 41

    8 / 41

    -2 / 41

    5 / 41

    448750 /
    41

    -3000 /
    41

    2800 /
    41

    3250 /
    41

    Tabla
    4

    300

    500

    350

    Base

    Cb

    P0

    P1

    P2

    P3

    P4

    P5

    P6

    P7

    P2

    500

    1988 /
    131

    23 /
    131

    -13 /
    131

    21 /
    131

    P1

    300

    129 / 131

    -2 /
    131

    41 /
    131

    -36 /
    131

    P6

    8625 /
    131

    -21 /
    131

    -159 /
    131

    146 /
    131

    P3

    350

    1173 /
    131

    -6 /
    131

    -8 /
    131

    23 /
    131

    1443250 /
    131

    8800 /
    131

    3000 /
    131

    7750 /
    131

    La solucin ptima es Z = 11017.18


    X1 = 0.98
    X2 = 15.18
    X3 = 8.95

    You might also like