Scribd Logo
Upload

Welcome to Scribd!

  • Semana 6

    Uploaded by

    JORGE
    28 views11 pages
    This document contains the code for several linear programming models solved using GAMS. The models include assignment problems, transportation problems, and generalized network flow problems with the goal of minimizing total cost. Integer and linear constraints are defined to represent the different problems. The models are then solved using mixed integer programming to find optimal solutions.

    Original Description:

    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
    This document contains the code for several linear programming models solved using GAMS. The models include assignment problems, transportation problems, and generalized network flow problems with the goal of minimizing total cost. Integer and linear constraints are defined to represent the different problems. The models are then solved using mixed integer programming to find optimal solutions.

    Copyright:

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

    Semana 6

    Uploaded by

    JORGE
    This document contains the code for several linear programming models solved using GAMS. The models include assignment problems, transportation problems, and generalized network flow problems with the goal of minimizing total cost. Integer and linear constraints are defined to represent the different problems. The models are then solved using mixed integer programming to find optimal solutions.

    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 11

    Problema modelo de redes 03 Modelo de Asignación

    GAMS
    VARIABLES
    X11, X12, X13, X14, X15, X21, X22, X23, X24, X25, X31, X32, X33, X34, X35,
    X41, X42, X43, X44, X45, X51, X52, X53, X54, X55, Z;

    INTEGER VARIABLES
    X11, X12, X13, X14, X15, X21, X22, X23, X24, X25, X31, X32, X33, X34, X35,
    X41, X42, X43, X44, X45, X51, X52, X53, X54, X55;

    EQUATIONS
    F0, R1, R2, R3, R4, R5, R6, R7, R8, R9, R10;

    F0.. Z =E= 20*X11 + 14*X12 + 6*X13 + 10*X14 + 22*X15 + 16*X21 + 8*X22 +


    22*X23 + 20*X24 + 10*X25 + 8*X31 + 6*X32 + 24*X33 + 14*X34 + 12*X35 + 20*X41
    + 22*X42 + 2*X43 + 8*X44 + 6*X45 + 4*X51 + 16*X52 + 22*X53 + 6*X54 + 24*X55;
    R1.. X11 + X12 + X13 + X14 + X15 =E= 1;
    R2.. X21 + X22 + X23 + X24 + X25 =E= 1;
    R3.. X31 + X32 + X33 + X34 + X35 =E= 1;
    R4.. X41 + X42 + X43 + X44 + X45 =E= 1;
    R5.. X51 + X52 + X53 + X54 + X55 =E= 1;
    R6.. X11 + X21 + X31 + X41 + X51 =E= 1;
    R7.. X12 + X22 + X32 + X42 + X52 =E= 1;
    R8.. X13 + X23 + X33 + X43 + X53 =E= 1;
    R9.. X14 + X24 + X34 + X44 + X54 =E= 1;
    R10.. X15 + X25 + X35 + X45 + X55 =E= 1;

    MODEL
    S6E01 / ALL /;

    SOLVE
    S6E01 USING MIP MINIMIZING Z
    Problema modelo de redes 04 Problema de Transbordo

    GAMS
    VARIABLES
    AB, AD, DA, DC, CD, CB, CE, BA, BC, BE, BH, EB, EC, EH, EI, HB, HE, HI, HF,
    HG, GH, GF, FH, FG, FJ, JF, JI, IE, IH, IJ, Z;

    INTEGER VARIABLES
    AB, AD, DA, DC, CD, CB, CE, BA, BC, BE, BH, EB, EC, EH, EI, HB, HE, HI, HF,
    HG, GH, GF, FH, FG, FJ, JF, JI, IE, IH, IJ;

    EQUATIONS
    F0, R1, R2, R3, R4, R5, R6, R7, R8, R9, R10;

    F0.. Z =E= 59*AB + 86*AD + 86*DA + 219*DC + 219*CD + 318*CB + 137*CE + 59*BA
    + 318*BC + 215*BE + 112*BH + 215*EB + 137*EC + 160*EH + 117*EI + 112*HB +
    160*HE + 132*HI + 94*HF + 98*HG + 98*GH + 107*GF + 94*FH + 107*FG + 63*FJ +
    63*JF + 128*JI + 117*IE + 132*IH + 128*IJ;

    R1.. AB + CB + EB + HB =E= BA + BC + BE + BH;


    R2.. EI + HI + JI =E= IE + IH + IJ;
    R3.. HF + JF + GF =E= FH + FG + FJ;
    R4.. DC + BC + EC =E= CD + CB + CE;
    R5.. AD + AB =L= 1200 + BA + DA;
    R6.. DA + DC =L= 1100 + AD + CD;
    R7.. JF + JI =L= 700 + FJ + IJ;
    R8.. CE + BE + IE + HE - EC - EB - EH - EI =E= 900;
    R9.. BH + EH + IH + FH + GH - HB - HE- HI - HF - HG =E= 600;
    R10.. HG + FG - GH - GF =E= 1200;

    MODEL
    S6E02 / ALL /;

    SOLVE
    S6E02 USING MIP MINIMIZING Z
    Problema de Transporte video 3

    GAMS
    VARIABLES
    X11, X12, X13, X21, X22, X23, X31, X32, X33, Z;

    INTEGER VARIABLES
    X11, X12, X13, X21, X22, X23, X31, X32, X33;

    EQUATIONS
    F0, R1, R2, R3, R4, R5, R6;

    F0.. Z =E= 15*X11 + 8*X12 + 12*X13 + 11*X21 + 23*X22 + 17*X23 + 16*X31 +


    19*X32 + 25*X33;

    R1.. X11 + X12 + X13 =E= 500;


    R2.. X21 + X22 + X23 =E= 100;
    R3.. X31 + X32 + X33 =E= 300;
    R4.. X11 + X21 + X31 =E= 200;
    R5.. X12 + X22 + X32 =E= 400;
    R6.. X13 + X23 + X33 =E= 300;

    MODEL
    S6E03 / ALL /;

    SOLVE
    S6E03 USING MIP MINIMIZING Z
    Problema de asignación video 3 balanceado

    GAMS
    VARIABLES
    X11, X12, X13, X14, X21, X22, X23, X24, X31, X32, X33, X34, X41, X42, X43,
    X44, Z;

    INTEGER VARIABLES
    X11, X12, X13, X14, X21, X22, X23, X24, X31, X32, X33, X34, X41, X42, X43,
    X44;

    EQUATIONS
    F0, R1, R2, R3, R4, R5, R6, R7, R8;

    F0.. Z =E= 180*X11 + 150*X12 + 200*X13 + 220*X14 + 230*X21 + 305*X22 +


    420*X23 + 310*X24 + 190*X31 + 220*X32 + 260*X33 + 270*X34 + 290*X41 +
    370*X42 + 240*X43 + 200*X44;
    R1.. X11 + X12 + X13 + X14 =E= 1;
    R2.. X21 + X22 + X23 + X24 =E= 1;
    R3.. X31 + X32 + X33 + X34 =E= 1;
    R4.. X41 + X42 + X43 + X44 =E= 1;
    R5.. X11 + X21 + X31 + X41 =E= 1;
    R6.. X12 + X22 + X32 + X42 =E= 1;
    R7.. X13 + X23 + X33 + X43 =E= 1;
    R8.. X14 + X24 + X34 + X44 =E= 1;

    MODEL
    S6E04 / ALL /;

    SOLVE
    S6E04 USING MIP MINIMIZING Z
    Problema de asignación video 3 no balanceado dejando pendiente una tarea

    GAMS
    VARIABLES
    X11, X12, X13, X14, X21, X22, X23, X24, X31, X32, X33, X34, Z;

    INTEGER VARIABLES
    X11, X12, X13, X14, X21, X22, X23, X24, X31, X32, X33, X34;

    EQUATIONS
    F0, R1, R2, R3, R4, R5, R6, R7;

    F0.. Z =E= 180*X11 + 150*X12 + 200*X13 + 220*X14 + 230*X21 + 305*X22 +


    420*X23 + 310*X24 + 190*X31 + 220*X32 + 260*X33 + 270*X34;
    R1.. X11 + X12 + X13 + X14 =E= 1;
    R2.. X21 + X22 + X23 + X24 =E= 1;
    R3.. X31 + X32 + X33 + X34 =E= 1;
    R4.. X11 + X21 + X31 =L= 1;
    R5.. X12 + X22 + X32 =L= 1;
    R6.. X13 + X23 + X33 =L= 1;
    R7.. X14 + X24 + X34 =L= 1;

    MODEL
    S6E05 / ALL /;

    SOLVE
    S6E05 USING MIP MINIMIZING Z
    Problema de asignación video 3 no balanceado realizando todas las tareas

    GAMS
    VARIABLES
    X11, X12, X13, X14, X21, X22, X23, X24, X31, X32, X33, X34, Z;

    INTEGER VARIABLES
    X11, X12, X13, X14, X21, X22, X23, X24, X31, X32, X33, X34;

    EQUATIONS
    F0, R1, R2, R3, R4, R5, R6, R7, R8, R9, R10;

    F0.. Z =E= 180*X11 + 150*X12 + 200*X13 + 220*X14 + 230*X21 + 305*X22 +


    420*X23 + 310*X24 + 190*X31 + 220*X32 + 260*X33 + 270*X34;
    R1.. X11 + X12 + X13 + X14 =G= 1;
    R2.. X11 + X12 + X13 + X14 =L= 2;
    R3.. X21 + X22 + X23 + X24 =G= 1;
    R4.. X21 + X22 + X23 + X24 =L= 2;
    R5.. X31 + X32 + X33 + X34 =G= 1;
    R6.. X31 + X32 + X33 + X34 =L= 2;
    R7.. X11 + X21 + X31 =E= 1;
    R8.. X12 + X22 + X32 =E= 1;
    R9.. X13 + X23 + X33 =E= 1;
    R10.. X14 + X24 + X34 =E= 1;

    MODEL
    S6E06 / ALL /;

    SOLVE
    S6E06 USING MIP MINIMIZING Z
    Problema de transbordo video 3 produccion superior a la demanda

    GAMS
    VARIABLES
    TH, TF, TP, WH, WF, WP, RH, RF, RP, HM, HN, FM, FN, FA, PM, PN, PJ, Z;

    INTEGER VARIABLES
    TH, TF, TP, WH, WF, WP, RH, RF, RP, HM, HN, FM, FN, FA, PM, PN, PJ;

    EQUATIONS
    F0, R1, R2, R3, R4, R5, R6, R7, R8, R9, R10;

    F0.. Z =E= 50*TH + 90*TF+ 60*TP + 95*WH+ 130*WF+ 45*WP+ 40*RH+ 80*RF+ 95*RP+
    60*HM+ 75*HN+ 85*FM+ 20*FN+ 25*FA+ 75*PM+ 155*PN+ 85*PJ;
    R1.. TH + TF + TP =L= 1000;
    R2.. WH + WF + WP =L= 2000;
    R3.. RH + RF + RP =L= 1500;
    R4.. TH + WH + RH =E= HM + HN;
    R5.. TF + WF + RF =E= FM + FN + FA;
    R6.. TP + WP + RP =E= PM + PN + PJ;
    R7.. HM + FM + PM =E= 1200;
    R8.. HN + FN + PN =E= 800;
    R9.. FA =E= 700;
    R10.. PJ =E= 1100;

    MODEL
    S6E07 / ALL /;

    SOLVE
    S6E07 USING MIP MINIMIZING Z
    EXAMEN 6 P4

    GAMS
    VARIABLES
    X11, X12, X13, X14, X15, X21, X22, X23, X24, X25, X31, X32, X33, X34, X35,
    X41, X42, X43, X44, X45, X51, X52, X53, X54, X55, X61, X62, X63, X64, X65,
    Z;

    INTEGER VARIABLES
    X11, X12, X13, X14, X15, X21, X22, X23, X24, X25, X31, X32, X33, X34, X35,
    X41, X42, X43, X44, X45, X51, X52, X53, X54, X55, X61, X62, X63, X64, X65;

    EQUATIONS
    F0, R1, R2, R3, R4, R5, R6, R7, R8, R9, R10, R11;

    F0.. Z =E= 15*X11 + 29*X12 + 4*X13 + 12*X14 + 32*X15 + 18*X21 + 37*X22 +


    12*X23 + 11*X24 + 26*X25 + 9*X31 + 13*X32 + 31*X33 + 18*X34 + 14*X35 +
    26*X41 + 29*X42 + 13*X43 + 16*X44 + 9*X45 + 31*X51 + 18*X52 + 24*X53 +
    26*X54 + 18*X55 + 19*X61 + 13*X62 + 16*X63 + 4*X64 + 31*X65

    R1.. X11 + X12 + X13 + X14 + X15 =L= 1;


    R2.. X21 + X22 + X23 + X24 + X25 =L= 1;
    R3.. X31 + X32 + X33 + X34 + X35 =L= 1;
    R4.. X41 + X42 + X43 + X44 + X45 =L= 1;
    R5.. X51 + X52 + X53 + X54 + X55 =L= 1;
    R6.. X61 + X62 + X63 + X64 + X65 =L= 1;
    R7.. X11 + X21 + X31 + X41 + X51 + X61 =E= 1;
    R8.. X12 + X22 + X32 + X42 + X52 + X62 =E= 1;
    R9.. X13 + X23 + X33 + X43 + X53 + X63 =E= 1;
    R10.. X14 + X24 + X34 + X44 + X54 + X64 =E= 1;
    R11.. X15 + X25 + X35 + X45 + X55 + X65 =E= 1;

    MODEL
    E6P4 / ALL /;

    SOLVE
    E6P4 USING MIP MINIMIZING Z
    PREGUNTA 5

    VARIABLES
    X11, X12, X13, X14, X15, X21, X22, X23, X24, X25, X31, X32, X33, X34, X35,
    X41, X42, X43, X44, X45, X51, X52, X53, X54, X55, X61, X62, X63, X64, X65,
    Z;

    INTEGER VARIABLES
    X11, X12, X13, X14, X15, X21, X22, X23, X24, X25, X31, X32, X33, X34, X35,
    X41, X42, X43, X44, X45, X51, X52, X53, X54, X55, X61, X62, X63, X64, X65;

    EQUATIONS
    F0, R1, R2, R3, R4, R5, R6, R7, R8, R9, R10, R11;

    F0.. Z =E= 15*X11 + 29*X12 + 7*X13 + 12*X14 + 32*X15 + 18*X21 + 37*X22 +


    12*X23 + 11*X24 + 26*X25 + 19*X31 + 13*X32 + 31*X33 + 18*X34 + 14*X35 +
    26*X41 + 29*X42 + 13*X43 + 16*X44 + 29*X45 + 31*X51 + 18*X52 + 24*X53 +
    26*X54 + 18*X55 + 19*X61 + 13*X62 + 16*X63 + 4*X64 + 31*X65

    R1.. X11 + X12 + X13 + X14 + X15 =L= 1;


    R2.. X21 + X22 + X23 + X24 + X25 =L= 1;
    R3.. X31 + X32 + X33 + X34 + X35 =L= 1;
    R4.. X41 + X42 + X43 + X44 + X45 =L= 1;
    R5.. X51 + X52 + X53 + X54 + X55 =L= 1;
    R6.. X61 + X62 + X63 + X64 + X65 =L= 1;
    R7.. X11 + X21 + X31 + X41 + X51 + X61 =E= 1;
    R8.. X12 + X22 + X32 + X42 + X52 + X62 =E= 1;
    R9.. X13 + X23 + X33 + X43 + X53 + X63 =E= 1;
    R10.. X14 + X24 + X34 + X44 + X54 + X64 =E= 1;
    R11.. X15 + X25 + X35 + X45 + X55 + X65 =E= 1;

    MODEL
    E6P5 / ALL /;

    SOLVE
    E6P5 USING MIP MINIMIZING Z
    PREGUNTA 9.

    GAMS
    VARIABLES
    X12, X13, X21, X24, X25, X31, X34, X36, X42, X43, X45, X52, X54, X56, X58,
    X63, X65, X68, X67, X76, X78, X85, X86, X87, Z;

    INTEGER VARIABLES
    X12, X13, X21, X24, X25, X31, X34, X36, X42, X43, X45, X52, X54, X56, X58,
    X63, X65, X68, X67, X76, X78, X85, X86, X87;

    EQUATIONS
    F0, R1, R2, R3, R4, R5, R6, R7, R8;

    F0.. Z =E= 59*X12 + 73*X13 + 59*X21 + 47*X24 + 92*X25 + 73*X31 + 64*X34 +


    77*X36 + 47*X42 + 64*X43 + 61*X45 + 92*X52 + 61*X54 + 51*X56 + 47*X58 +
    77*X63 + 51*X65 + 84*X68 + 36*X67 + 36*X76 + 62*X78 + 47*X85 + 84*X86 +
    62*X87;

    R1.. X12 + X42 + X52 =E= X21 + X24 + X25;


    R2.. X25 + X45 + X65 + X85 =E= X52 + X54 + X56 + X58;
    R3.. X13 + X43 + X63 =E= X31 + X34 + X36;
    R4.. X12 + X13 =E= 800 + X21 + X31;
    R5.. X85 + X86 + X87 =E= 800 + X58 + X68 + X78;
    R6.. X24 + X34 + X54 -X42 -X43 -X45 =E= 700;
    R7.. X56 + X36 + X76 + X86 -X63 -X65 -X68 -X67 =E=500;
    R8.. X67 + X87 -X76 -X78 =E= 400;

    MODEL
    E6P9 / ALL /;

    SOLVE
    E6P9 USING MIP MINIMIZING Z

    SE ENCUENTRA BALANCEADO 147,600 ES EL GASTO


    PREGUNTA 10

    GAMS
    VARIABLES
    X12, X13, X21, X24, X25, X31, X34, X36, X42, X43, X45, X52, X54, X56, X58,
    X63, X65, X68, X67, X76, X78, X85, X86, X87, Z;

    INTEGER VARIABLES
    X12, X13, X21, X24, X25, X31, X34, X36, X42, X43, X45, X52, X54, X56, X58,
    X63, X65, X68, X67, X76, X78, X85, X86, X87;

    EQUATIONS
    F0, R1, R2, R3, R4, R5, R6, R7, R8;

    F0.. Z =E= 59*X12 + 73*X13 + 59*X21 + 47*X24 + 92*X25 + 73*X31 + 64*X34 +


    77*X36 + 47*X42 + 64*X43 + 61*X45 + 92*X52 + 61*X54 + 51*X56 + 47*X58 +
    77*X63 + 51*X65 + 84*X68 + 36*X67 + 36*X76 + 62*X78 + 47*X85 + 84*X86 +
    62*X87;

    R1.. X12 + X42 + X52 =E= X21 + X24 + X25;


    R2.. X25 + X45 + X65 + X85 =E= X52 + X54 + X56 + X58;
    R3.. X13 + X43 + X63 =E= X31 + X34 + X36;
    R4.. X12 + X13 =E= 750 + X21 + X31;
    R5.. X85 + X86 + X87 =E= 750 + X58 + X68 + X78;

    R6.. X24 + X34 + X54 -X42 -X43 -X45 =L= 700;


    R7.. X56 + X36 + X76 + X86 -X63 -X65 -X68 -X67 =L=500;
    R8.. X67 + X87 -X76 -X78 =L= 400;

    MODEL
    E6P10 / ALL /;

    SOLVE
    E6P10 USING MIP MINIMIZING Z

    NO SE PUEDE CUMPLIR LA DEMANDA DEL NODO 6 UNICAMENTE FALTAN


    100 EL VALOR ES DE 135900

    You might also like