Scribd Logo
Upload

Welcome to Scribd!

  • Practica Calificada de Metodo Simplex

    Uploaded by

    cleydi_6546
    2 views2 pages
    This document describes a linear programming problem with the objective of maximizing Max Z, subject to several constraints on variables x1, x2, x3, x4, and x5. The problem is solved by introducing slack variables S1 through S5 and reducing it to standard form. The optimal solution is found to be x1 = 0, x2 = 21, x3 = 0, x4 = 1, x5 = 0, with S1 = 12, S2 = 9, S3 = 0, S4 = 0, S5 = 0, and maximum Z = 696.

    Original Description:

    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 describes a linear programming problem with the objective of maximizing Max Z, subject to several constraints on variables x1, x2, x3, x4, and x5. The problem is solved by introducing slack variables S1 through S5 and reducing it to standard form. The optimal solution is found to be x1 = 0, x2 = 21, x3 = 0, x4 = 1, x5 = 0, with S1 = 12, S2 = 9, S3 = 0, S4 = 0, S5 = 0, and maximum Z = 696.

    Copyright:

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

    Practica Calificada de Metodo Simplex

    Uploaded by

    cleydi_6546
    This document describes a linear programming problem with the objective of maximizing Max Z, subject to several constraints on variables x1, x2, x3, x4, and x5. The problem is solved by introducing slack variables S1 through S5 and reducing it to standard form. The optimal solution is found to be x1 = 0, x2 = 21, x3 = 0, x4 = 1, x5 = 0, with S1 = 12, S2 = 9, S3 = 0, S4 = 0, S5 = 0, and maximum Z = 696.

    Copyright:

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

    Practica calificada de investigación operativa:

    Max Z: 12 x 1+ 32 x 2+ 5 x 3+ 24 x 4 +¿ 12 x 5

    S.A:

    x 1+ 3 x 2 + x5 ≤12

    2 x1 + x 2 +2 x 3 +2 x 4 + x 5 ≤ 32

    x 1+ 2 x 2 + x 3 +3 x5 ≤ 42

    x 1+ x2 + x 3 + x 4 ≤ 32

    3 x 1+ x 2 + 2 x 3 + 2 x 4 + x 5 ≤26

    x 1 , x 2 , x 3 , x 4 , x 5 ≤ 32

    Sacando variables de holgura:

    x 1+ 3 x 3 + x5 + S1 ≤12

    2 x1 + x 2 +2 x 3 +2 x 4 + x 5 +S 2 ≤ 32

    x 1+ 2 x 2 + x 3 +3 x5 ≤ 42

    x 1+ x2 + x 3 + x 4 + S4 + ≤32

    3 x 1+ x 2 + 2 x 3 + 2 x 4 + x 5+ ¿+5 x 5 ≤26 ¿

    Cj 12 32 5 24 12 0 0 0 0 0

    B x1 x2 x3 x4 x5 S1 S 2 S3 S 4 S 5

    0 S1 12 1 0 3 0 1 1 0 0 0 0 12/0=NO
    0 S2 32 2 1 2 2 1 0 1 0 0 0 EXISTE
    0 S3 42 1 22 1 0 3 0 0 1 0 0 32/1
    0 S4 22 1 1 1 1 0 0 0 0 1 0 42/2
    0 S5 26 3 1 2 2 1 0 0 0 0 1 26/1
    Zj 0 0 0 0 0 0 0 0 0 0 0
    C j−Z j -12 -32-5 -24 -12 0 0 0 0 0
    0 S1 12 1 0 3 0 1 1 0 0 0 0 F2-F3
    0 S2 11 3/2 0 3/2 2 -1/2 0 1 -1/2 0 0 F3/F2
    32 X2 21 1/2 1 1/2 0 3/2 0 0 1/2 0 0 F5-F3
    0 S4 1 1/2 0 1/2 1 1-3/2 0 0 -3/2 1 0 F4-F3
    0 S5 5 5/2 0 3/2 2 -1/2 0 0 0 0 1
    Zj 672 16 32 16 0 48 0 0 16 0 0
    C j−Z j 4 0 11 -24 36 0 0 16 0 0
    0 S1 12 1 0 3 0 1 1 0 0 0 0 F2+F3
    0 S2 9 1/2 0 1/2 0 5/2 0 1 1/2 -2 0 F5-2F4
    32 X2 21 1/2 1 1/2 0 3/2 0 0 1/2 0 0
    24 X4 1 1/2 0 1/2 1 -3/2 0 0 -1/2 1 0
    0 S5 3 3/2 0 1/2 0 5/2 0 0 1/2 -2 1
    Zj 696 28 32 28 24 12 0 0 4 24 0
    C j−Z j 16 0 23 0 0 0 0 4 24 0

    LASOLUCION ÓPTIMA ES LA SIGUIENTE:

    x 1 ¿ 0 x 2=21 x ¿ ¿0

    S1=12 S2 ¿ 9 S 3=¿0 S =0 S =0 ¿
    4 5

    Max Z: 12(0) + 32(21)+ 5( 0 ) + 24(1)+ ¿12(0)

    Max Z: 696

    You might also like