Scribd Logo
Importer

Bienvenue sur Scribd !

  • Actividad 3.3

    Transféré par

    Santiago Landeros
    3 vues5 pages
    The document contains multiple linear programming problems with their primal and dual forms. The problems involve maximizing or minimizing objective functions subject to various inequality constraints on variables. The dual problems swap the objectives and constraints between maximization and minimization.

    Description originale:

    Titre original

    Actividad 3.3.xlsx

    Copyright

    © © All Rights Reserved

    Formats disponibles

    XLSX, PDF, TXT ou lisez en ligne sur Scribd

    Avez-vous trouvé ce document utile ?

    Ce contenu est-il inapproprié ?

    Signaler ce document
    The document contains multiple linear programming problems with their primal and dual forms. The problems involve maximizing or minimizing objective functions subject to various inequality constraints on variables. The dual problems swap the objectives and constraints between maximization and minimization.

    Droits d'auteur :

    © All Rights Reserved
    Téléchargez comme XLSX, PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    3 vues5 pages

    Actividad 3.3

    Transféré par

    Santiago Landeros
    The document contains multiple linear programming problems with their primal and dual forms. The problems involve maximizing or minimizing objective functions subject to various inequality constraints on variables. The dual problems swap the objectives and constraints between maximization and minimization.

    Droits d'auteur :

    © All Rights Reserved
    Téléchargez comme XLSX, PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    sur 5

    Ec Original

    Max. E1 Z-2x1-x2=0 Z x1 x2 s1 s2 s3 LD
    Z = 2x1+x2 E2 +5x2+S1=10
    x1 E1 1 -2 -1 0 0 0 0
    S/A. E3 x1+3x2+S2=6 E2 0 1 5 1 0 0 10 10
    x1+5x2 ≤ 10 E4 2x1+2x2+S3=8 E3 0 1 2 0 1 0 6 6
    x1 +3x2 ≤ 6 E4 0 2 2 0 0 1 8 4
    2x1+2x2 ≤ 8
    x1,x2 ≥ 0 1 -2 -1 0 0 0 0 2
    0 1 5 1 0 0 10 -1
    0 1 2 0 1 0 6 -1
    0 1 1 0 0 0.5 4

    1 0 1 0 0 1 8
    0 0 -4 -1 0 0.5 -6
    0 0 -1 0 -1 0.5 -2
    0 1 1 0 0 0.5 4

    Z 8
    X1 4
    X2 0
    Dual
    Min Z= 10y1+6y2+8y3
    y1+y2+2y3 >= 2
    5y1+3y2+2y3 >= 1
    Original
    Min.
    Z = x1+3x2-2x3
    S/A.
    4x1+8x2+6x3 = 25
    7x1+5x2+9x3 = 30
    x1, x2, x3 ≥ 0
    Dual
    Max Z = 25y1+30y2
    4y1+7y2 <= 1
    8y1+5y2 <=3
    6y1+9y2<=-2
    Max.

    Z = 20x1+100x2
    Min Z = 20y1-10y2
    S/A. y1-3y2>=20
    x1+4x2 ≤ 20 4y1-2y2>=100
    3x1 + 2x2 ≥ 10

    x1, x2 ≥ 0

    Vous aimerez peut-être aussi