Scribd Logo
Upload

Welcome to Scribd!

  • 36 views

    Ejercisios en Win QSB

    Uploaded by

    Jrg Miranda
    This document contains two linear programming problems solved using GAMS. The first problem has 3 sets and 12 variables with the objective of minimizing costs. The second problem contains 3 sets, 9 variables and 6 equations, with the objective of minimizing costs subject to supply and demand constraints. Both problems are solved using the CPLEX solver and report optimal solutions that meet the constraints.

    Copyright:

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

    You might also like

    Ejercisios en Win QSB

    Uploaded by

    Jrg Miranda
    36 views17 pages
    This document contains two linear programming problems solved using GAMS. The first problem has 3 sets and 12 variables with the objective of minimizing costs. The second problem contains 3 sets, 9 variables and 6 equations, with the objective of minimizing costs subject to supply and demand constraints. Both problems are solved using the CPLEX solver and report optimal solutions that meet the constraints.

    Original Description:

    Original Title

    EJERCISIOS EN WIN QSB

    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 two linear programming problems solved using GAMS. The first problem has 3 sets and 12 variables with the objective of minimizing costs. The second problem contains 3 sets, 9 variables and 6 equations, with the objective of minimizing costs subject to supply and demand constraints. Both problems are solved using the CPLEX solver and report optimal solutions that meet the constraints.

    Copyright:

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

    Ejercisios en Win QSB

    Uploaded by

    Jrg Miranda
    This document contains two linear programming problems solved using GAMS. The first problem has 3 sets and 12 variables with the objective of minimizing costs. The second problem contains 3 sets, 9 variables and 6 equations, with the objective of minimizing costs subject to supply and demand constraints. Both problems are solved using the CPLEX solver and report optimal solutions that meet the constraints.

    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 17

    TALLER DE PROGRAMACION LINEAL

    PROFESOR
    LUIS ALFONSO

    ALUMNO
    JORGE MIRANDA PAEZ
    INGENIERIA DE SISTEMAS

    UNIVERCIDAD DE CORDOBA
    MONTERI -CORDOBA
    PUNTO 1

    PUNTO 1
    PUNTO 2

    PUNTO 2
    PUNTO 3

    PUNTO3
    PUNTO 4

    PUNTO 4
    PUNTO 5

    PUNTO 5
    PUNTO 6

    PUNTO 6
    PUNTO 7

    PUNTO 7

    EJERCISIO 1 EN GAMS
    $offsymxref
    $offsymlist
    option limrow=0;
    option limcol=0;
    option solprint=on;
    option sysout=off;
    option LP=cplex;
    option mip=cplex;
    option nlp=conopt;
    option minlp=dicopt;

    $title NUMERO1

    SETS I /1*3/
    J /4*7/
    C /X11, X12, X13, X14, X21, X22, X23, X24, X31, X32, X33, X34/;
    PARAMETERS D(I) /1 320
    2 160
    3 160/
    F(J) /4 1
    5 1
    6 1
    7 1/
    G(C) /X11 6319
    X12 26522
    X13 11837
    X14 12816
    X21 3159
    X22 11907
    X23 4941
    X24 10206
    X31 3864
    X32 13020
    X33 4788
    X34 10164/
    ;
    TABLE H(I,C)
    X11 X12 X13 X14 X21 X22 X23 X24 X31 X32
    X33 X34
    1 71 298 133 144 0 0 0 0 0 0 0 0
    2 0 0 0 0 39 147 61 126 0 0 0 0
    3 0 0 0 0 0 0 0 0 46 155 57 121
    ;

    TABLE K(J,C)
    X11 X12 X13 X14 X21 X22 X23 X24 X31 X32
    X33 X34
    4 1 0 0 0 1 0 0 0 1 0 0 0
    5 0 1 0 0 0 1 0 0 0 1 0 0
    6 0 0 1 0 0 0 1 0 0 0 1 0
    7 0 0 0 1 0 0 0 1 0 0 0 1
    ;
    VARIABLES X(C), Z;
    POSITIVE VARIABLES X(C);
    EQUATIONS OBJ, P(I), O(J);
    OBJ..Z=e=SUM(C,G(C)*X(C));
    P(I)..SUM(C,H(I,C)*X(C))=L=D(I);
    O(J)..SUM(C,K(J,C)*X(C))=E=F(J);
    MODEL NUMERO1 /ALL/ ;
    SOLVE NUMERO1 USING LP MINIMIZING Z;
    EJERCIO NUMERO 3 EN GAMS
    $offsymxref
    $offsymlist
    option limrow=0;
    option limcol=0;
    option solprint=on;
    option sysout=off;
    option LP=cplex;
    option mip=cplex;
    option nlp=conopt;
    option minlp=dicopt;

    $title NUMERO3

    SETS N /1*3/
    M /4*9/
    K /X11, X12, X13, X21, X22, X23, X31, X32, X33/;

    PARAMETERS B(N) /1 500


    2 700
    3 600/

    G(M) /4 500
    5 200
    6 200/

    C(K) /X11 2
    X12 3
    X13 5
    X21 2.5
    X22 4
    X23 4.9
    X31 3
    X32 3.6
    X33 3.2 /
    ;

    TABLE A(N,K)
    X11 X12 X13 X21 X22 X23 X31 X32 X33
    1 1 0 0 1 0 0 1 0 0
    2 0 1 0 0 1 0 0 1 0
    3 0 0 1 0 0 1 0 0 1
    ;

    TABLE H(M,K)
    X11 X12 X13 X21 X22 X23 X31 X32 X33
    4 0 0 0 0 0 0 1 1 1
    5 0 0 0 1 1 1 0 0 0
    6 0 0 0 0 0 0 1 1 1

    VARIABLES X(K), Z;
    POSITIVE VARIABLES X(K);
    EQUATIONS OBJ,P(N),V(M);
    OBJ..Z=E=SUM(K,C(K)*X(K));
    P(N)..SUM(K,A(N,K)*X(K))=E= B(N);
    V(M)..SUM(K,H(M,K)*X(K))=L= G(M);
    MODEL NUMERO3 /ALL/ ;
    SOLVE NUMERO3 USING LP MINIMIZING Z;
    COMPILATION TIME = 0.000 SECONDS 3 MB 30.2.0 r482c588 WEX-WEI
    GAMS 30.2.0 r482c588 Released Feb 7, 2020 WEX-WEI x86 64bit/MS Windows
    04/29/20 15:31:39 Page 3
    NUMERO3
    Model Statistics SOLVE NUMERO3 Using LP From line 59

    MODEL STATISTICS

    BLOCKS OF EQUATIONS 3 SINGLE EQUATIONS 7


    BLOCKS OF VARIABLES 2 SINGLE VARIABLES 10
    NON ZERO ELEMENTS 28

    GENERATION TIME = 0.250 SECONDS 4 MB 30.2.0 r482c588 WEX-WEI

    EXECUTION TIME = 0.250 SECONDS 4 MB 30.2.0 r482c588 WEX-WEI


    GAMS 30.2.0 r482c588 Released Feb 7, 2020 WEX-WEI x86 64bit/MS Windows
    04/29/20 15:31:39 Page 4
    NUMERO3
    Solution Report SOLVE NUMERO3 Using LP From line 59

    SOLVE SUMMARY

    MODEL NUMERO3 OBJECTIVE Z


    TYPE LP DIRECTION MINIMIZE
    SOLVER CPLEX FROM LINE 59

    **** SOLVER STATUS 1 Normal Completion


    **** MODEL STATUS 1 Optimal
    **** OBJECTIVE VALUE 5720.0000

    RESOURCE USAGE, LIMIT 0.047 1000.000


    ITERATION COUNT, LIMIT 0 2000000000

    IBM ILOG CPLEX 30.2.0 r482c588 Released Feb 07, 2020 WEI x86 64bit/MS Window
    *** This solver runs with a demo license. No commercial use.
    Cplex 12.10.0.0

    Space for names approximately 0.00 Mb


    Use option 'names no' to turn use of names off
    LP status(1): optimal
    Cplex Time: 0.02sec (det. 0.01 ticks)
    Optimal solution found.
    Objective : 5720.000000
    LOWER LEVEL UPPER MARGINAL

    ---- EQU OBJ . . . 1.000

    ---- EQU P

    LOWER LEVEL UPPER MARGINAL

    1 500.000 500.000 500.000 2.000


    2 700.000 700.000 700.000 3.000
    3 600.000 600.000 600.000 5.000

    ---- EQU V

    LOWER LEVEL UPPER MARGINAL

    4 -INF 200.000 500.000 .


    5 -INF 200.000 200.000 -0.100
    6 -INF 200.000 200.000 -1.800

    ---- VAR X

    LOWER LEVEL UPPER MARGINAL

    X11 . 500.000 +INF .


    X12 . 700.000 +INF .
    X13 . 200.000 +INF .
    X21 . . +INF 0.600
    X22 . . +INF 1.100
    X23 . 200.000 +INF .
    X31 . . +INF 2.800
    X32 . . +INF 2.400
    X33 . 200.000 +INF .

    LOWER LEVEL UPPER MARGINAL

    ---- VAR Z -INF 5720.000 +INF .

    **** REPORT SUMMARY : 0 NONOPT


    0 INFEASIBLE
    0 UNBOUNDED

    EXECUTION TIME = 0.000 SECONDS 2 MB 30.2.0 r482c588 WEX-WEI

    USER: GAMS Demo license for jorge miranda G200227|0002CO-GEN


    mincolombia, Colombia DL003110

    **** FILE SUMMARY

    You might also like