Scribd Logo
Upload

Welcome to Scribd!

  • Max z= 3X1+5X2 linear programming problem

    Uploaded by

    Madisson García
    18 views4 pages
    The document describes a linear programming problem to maximize the objective function Z=3X1+5X2. It provides the constraints: 4X1+X2 > 4 -X1+2X2 > 2 X1 < 3 X1, X2 > 0 The problem is solved in two phases. Phase 1 standardizes the problem and finds a basic feasible solution. Phase 2 enters and leaves variables to optimize the objective function and finds the optimal solution of X1=1, X2=1, Z=8.

    Original Description:

    EJEMPLO METODO SIMPLEX POR DOS FASES

    Original Title

    DOS FASES

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes a linear programming problem to maximize the objective function Z=3X1+5X2. It provides the constraints: 4X1+X2 > 4 -X1+2X2 > 2 X1 < 3 X1, X2 > 0 The problem is solved in two phases. Phase 1 standardizes the problem and finds a basic feasible solution. Phase 2 enters and leaves variables to optimize the objective function and finds the optimal solution of X1=1, X2=1, Z=8.

    Copyright:

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

    Max z= 3X1+5X2 linear programming problem

    Uploaded by

    Madisson García
    The document describes a linear programming problem to maximize the objective function Z=3X1+5X2. It provides the constraints: 4X1+X2 > 4 -X1+2X2 > 2 X1 < 3 X1, X2 > 0 The problem is solved in two phases. Phase 1 standardizes the problem and finds a basic feasible solution. Phase 2 enters and leaves variables to optimize the objective function and finds the optimal solution of X1=1, X2=1, Z=8.

    Copyright:

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

    Max z= 3X1+5X2

    S.A

    4X1+X2 > 4

    -X1+2X2 > 2

    X1 < 3

    XI>0

    ESTANDARIZADO

    MIN Z= 0X1+0X2+0E1+A1+0E2+A2+0S1

    Z-0X1-0X2-0E1-0E2-A1-A2-0S1=0

    4X1+X2-E1+A1 = 4

    -X1+2X2-E2+A2 = 2

    X1+S1 = 3
    cj 0 0 0 0 0 -1 -1 -------- ENTRA X1
    - SALE A1
    v.b c.b X1 X2 E1 E2 S1 A1 A2 bj ratio
    A1 -1 4 1 -1 0 0 1 0 4 4/4=1 ¼ R1
    A2 -1 -1 2 0 -1 0 0 1 2 2/-1=-2 R1+R2 =R2
    S1 0 1 0 0 0 1 0 0 3 3/1=3 -R1+R3=R3
    Zj -3 -3 1 1 0 -1 -1 -6
    Zj-cj -3 -3 1 1 0 0 0 ENTRA X2
    X1 0 1 1/4 -1/4 0 0 1/4 0 1 1/ ¼=4 SALE A2
    A2 -1 0 9/4 -1/4 -1 0 1/4 1 3 3/ 9/4= 1.33 4/9R2
    S1 0 0 -1/4 1/4 0 1 -1/4 0 2 2/ -1/4=-8 -1/4R2+R1
    ZJ 0 -9/4 1/4 1 0 -1/4 -1 -3 1/4R2+R3
    ZJ-CJ 0 -9/4 1/4 1 0 3/4 0
    X1 0 1 0 -2/9 1/9 0 2/9 -1/9 2/3
    X2 0 0 1 -1/9 -4/9 0 1/9 4/9 4/3
    S1 0 0 0 2/9 -1/9 1 -2/9 1/9 7/3
    ZJ 0 0 0 0 0 0 0 0 ACABA FASE
    1
    ZJ-CJ 0 0 0 0 0 1 1
    Max z= 3X1+5X2

    S.A

    4X1+X2 > 4

    -X1+2X2 > 2

    X1 < 3

    XI>0

    FASE 2

    cj 3 5 0 0 0
    v.b c.b X1 X2 E1 E2 S1 bj ratio Entra E2
    X1 3 1 0 -2/9 1/9 0 2/3 2/3/1/9=6 Sale X1
    X2 5 0 1 -1/9 -4/9 0 4/3 4/3/-4/9=-3 9R1=E2
    S1 0 0 0 2/9 -1/9 1 7/3 7/3/-1/9=-21 4/9R1+R2
    Zj 3 5 -11/9 -17/9 0 26/3 1/9E2+S1=S1
    Zj-cj 0 0 -11/9 -17/9 0
    E2 0 9 0 -2 1 0 6 6/-2= -3
    X2 5 4 1 -1 0 0 4 4/-1=-4
    S1 0 1 0 0 0 1 3 3/0= NO
    Zj 20 5 -5 0 0 20
    Zj-cj 17 0 -5 0 0

    You might also like