Scribd Logo
Upload

Welcome to Scribd!

  • Algoritmo de Lemke

    Uploaded by

    Maria Camila Caicedo Mesa
    41 views3 pages
    The document describes a linear optimization problem to minimize the objective function Zmin=20x1+10x2 subject to multiple constraints involving variables x1 and x2. It provides the constraint equations and defines the variables as non-negative. It then standardizes the problem and solves it iteratively, finding an optimal solution at x1=6, x2=12, with an objective value of 240.

    Original Description:

    Original Title

    algoritmo de lemke

    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 a linear optimization problem to minimize the objective function Zmin=20x1+10x2 subject to multiple constraints involving variables x1 and x2. It provides the constraint equations and defines the variables as non-negative. It then standardizes the problem and solves it iteratively, finding an optimal solution at x1=6, x2=12, with an objective value of 240.

    Copyright:

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

    Algoritmo de Lemke

    Uploaded by

    Maria Camila Caicedo Mesa
    The document describes a linear optimization problem to minimize the objective function Zmin=20x1+10x2 subject to multiple constraints involving variables x1 and x2. It provides the constraint equations and defines the variables as non-negative. It then standardizes the problem and solves it iteratively, finding an optimal solution at x1=6, x2=12, with an objective value of 240.

    Copyright:

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

    Zmin=20x1+10x2

    S.A: 1x1+2x2<=40

    3x1+1x2=30 => 3x1+1x2>=30, 3x1+1x2<=30

    4x1+3x2>=60

    X1,x2>=0

    Zmin=20x1+10x2

    S.A: 1x1+2x2<=40

    3x1+1x2>=30

    3x1+1x2<=30

    4x1+3x2>=60

    X1,x2>=0

    Zmax=-20x1-10x2

    S.A: 1x1+2x2<=40

    -3x1-1x2<=-30

    3x1+1x2<=30

    -4x1-3x2<=-60

    X1,x2>=0

    Zmax+20x1+10x2=0

    S.A: 1x1+2x2<=40

    -3x1-1x2<=-30

    3x1+1x2<=30

    -4x1-3x2<=-60

    X1,x2>=0
    Estandarizamos

    Zmax+20x1+10x2+0s1+0s2+0s3+0s4=0

    S.A: 1x1+2x2+1s1+0s2+0s3+0s4<=40

    -3x1-1x2+0s1+1s2+0s3+0s4<=-30

    3x1+1x2+0s1+0s2+1s3+0s4<=30

    -4x1-3x2+0s1+0s2+0s3+1s4<=-60

    X1,x2>=0

    Cj 20 10 0 0 0 0
    Cb Xb A1 A2 S1 S2 S3 S4 solución
    0 S1 1 2 1 0 0 0 40
    0 S2 -3 -1 0 1 0 0 -30
    0 S3 3 1 0 0 1 0 30
    0 S4 -4 -3 0 0 0 1 -60
    Zj 0 0 0 0 0 0 0
    Ps 20 10 0 0 0 0
    β -5 -10/3 0 0 0 1
    Factible: Si

    Optimo: No

    Cj 20 10 0 0 0 0
    Cb Xb A1 A2 S1 S2 S3 S4 solución
    0 S1 0 5/4 1 0 0 ¼ 25
    0 S2 0 5/4 0 1 0 -3/4 15
    0 S3 0 -5/4 0 0 1 3/4 -15
    20 X1 1 3/4 0 0 0 -1/4 15
    Zj 20 15 0 0 0 -5 300
    Ps 0 -5 0 0 0 5
    β 1 -20/3 0 0 0 -20
    Factible: Si

    Optimo: No

    Cj 20 10 0 0 0 0
    Cb Xb A1 A2 S1 S2 S3 S4 solución
    0 S1 0 0 1 0 1 1 10
    0 S2 0 0 0 1 1 0 0
    10 X2 0 1 0 0 -4/5 -3/5 12
    20 X1 1 0 0 0 3/5 1/5 6
    Zj 20 10 0 0 4 -2 240
    Ps 0 0 0 0 -4 2
    Factible: Si

    Optimo: Si

    You might also like