Scribd Logo
Upload

Welcome to Scribd!

  • 16 views

    CB VB 2 1 0 0 - M: (9/10) 0.9 (1/10) 0.1 Fila Pivote Columna Pivote

    Uploaded by

    Freddy Durand
    The document describes maximizing the objective function Z=2X1+X2 subject to the given constraints. It performs the simplex method, starting with an initial basic feasible solution and iteratively arriving at the optimal solution through pivot steps. The optimal solution is found to be X1=9/10, X2=0, S1=0, S2=8.

    Copyright:

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

    You might also like

    CB VB 2 1 0 0 - M: (9/10) 0.9 (1/10) 0.1 Fila Pivote Columna Pivote

    Uploaded by

    Freddy Durand
    16 views2 pages
    The document describes maximizing the objective function Z=2X1+X2 subject to the given constraints. It performs the simplex method, starting with an initial basic feasible solution and iteratively arriving at the optimal solution through pivot steps. The optimal solution is found to be X1=9/10, X2=0, S1=0, S2=8.

    Original Description:

    Original Title

    EJERCICIO A

    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 maximizing the objective function Z=2X1+X2 subject to the given constraints. It performs the simplex method, starting with an initial basic feasible solution and iteratively arriving at the optimal solution through pivot steps. The optimal solution is found to be X1=9/10, X2=0, S1=0, S2=8.

    Copyright:

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

    CB VB 2 1 0 0 - M: (9/10) 0.9 (1/10) 0.1 Fila Pivote Columna Pivote

    Uploaded by

    Freddy Durand
    The document describes maximizing the objective function Z=2X1+X2 subject to the given constraints. It performs the simplex method, starting with an initial basic feasible solution and iteratively arriving at the optimal solution through pivot steps. The optimal solution is found to be X1=9/10, X2=0, S1=0, S2=8.

    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 2

    EJERCICIO A

    Maximizar Z=2 X 1+ X 2

    S.A

    10 X 1 +10 X 2 + S1 ≤910 X 1 +5FX(2X−S


    , Y2+ A 1X
    )=2 ≥ 11+1 X 2 +0 S1 +0 S2−M A 1

    X1 , X 2 , S1, S2 , A1 ≥ 0

    CB VB 2 1 0 0 ¨¨-M  
        X1 X2 S1 S2 A1 XB
    0 S1 10 10 1 0 0 9 (9/10)=0.9
    ¨¨-M A1 10 5 0 -1 1 1 (1/10)=0.1
    FILA PIVOTE ZJ-CJ -10M-2  -5M-1  0  M   0  -M

    COLUMNA PIVOTE

    CB VB 2 1 0 0 ¨¨-M  
        X1 X2 S1 S2 A1 XB
    0 S1 10 10 1 0 0 9
    ¨¨-M A1 10/10=1 5/10=1/2 0/10=0 -1/10 1/10 1/10
    FILA PIVOTE ZJ-CJ -10M-2  -5M-1  0  M   0  -M

    COLUMNA PIVOTE

    CB VB 2 1 0 0 ¨¨-M  
        X1 X2 S1 S2 A1 XB
    0 S1 10 10 1 0 0 9
    ¨¨-M A1 1 1/2 0 -1/10 1/10 1/10
    FILA PIVOTE ZJ-CJ -10M-2  -5M-1  0  M   0  -M

    COLUMNA PIVOTE

    (10,10,1,0,0,9)-10*(1,1/2,0,-1/10,1/10,1/10)= (10,10,1,0,0,9)-(10,5,0,-1,1,1)

    = (0,5,1,1,-1,8)
    CB VB 2 1 0 0 ¨¨-M  
        X1 X2 S1 S2 A1 XB
    0 S1 0 5 1 1 -1 8
    FILA PIVOTE 2 X1 1 1/2 0 -1/10 1/10 1/10
    ZJ-CJ 0 0 0 -1/5 1/5+M 1/5 

    COLUMNA PIVOTE

    (1,1/2,0,-1/10,1/10,1/10)+1/10*(0,5,1,1,-1,8)= (1,1/2,0,-1/10,1/10,1/10)+(0,1/2,1/10,1/10,-1/10,4/5)

    =1,1,1/10,0,0,9/10

    CB VB 2 1 0 0 ¨¨-M  
        X1 X2 S1 S2 A1 XB
    0 S2 0 5 1 1 -1 8
    2 X1 1 1 1/10 0 0 9/10
    ZJ-CJ 0 1 1/5 0 M 9/5

    X1=9/10

    X2=0

    S1=0

    S2=8

    You might also like