GAMS 2.25.087 SUN/SPARC 11/15/97 20:59:10 PAGE 1 Pizza Delivery Problem 2 3 SETS 4 5 I locations including pizza store / I1*I8 / 6 A(I,I) ARCS /I1.(I2*I8),(I2*I8).(I2*I8)/ 7 ALIAS(I,J); 8 9 10 PARAMETERS 11 12 13 DEMAND(I) represents the demands of all locations 14 /I1 -12 15 I2 1 16 I3 1 17 I4 2 18 I5 3 19 I6 3 20 I7 1 21 I8 1 / 22 23 TABLE COST(I,I) 24 I1 I2 I3 I4 I5 I6 I7 I8 25 I1 0 12 15 7 20 15 5 14 26 I2 0 0 2 5 7 12 11 18 27 I3 0 2 0 4 5 10 9 16 28 I4 0 5 4 0 3 6 2 10 29 I5 0 9 10 3 0 6 4 10 30 I6 0 12 10 6 6 0 3 5 31 I7 0 11 9 2 4 3 0 3 32 I8 0 18 16 10 10 5 3 0 ; 33 34 SCALARS FIXED fixed cost associated with each delivery trip /.557/ 35 MAXSIZE max size of pizza oven /4/ ; 36 37 VARIABLES 38 X(I,I) 0 or 1 depending on whether arc is used 39 Y(I,I) amount shipped from I to J 40 Z total cost; 41 42 BINARY VARIABLE X; 43 POSITIVE VARIABLE Y; 44 45 EQUATIONS 46 OBJ total cost of shipping 47 FLOW total demand is satisfied 48 MEET only one driver can meet the demand of each customer 49 LEAVE only one driver can leave the pizza store 50 BACK no truck can return to the pizza store 51 RESTRICT force variable to 0; 52 53 OBJ.. Z =E= SUM((I,J), COST(I,J)*X(I,J))+SUM(J,X('I1',J))*FIXED; 54 FLOW(J)..SUM(I,Y(I,J)$A(I,J)- Y(J,I)$A(J,I))=E=DEMAND(J); 55 MEET(J)$(ORD(J) NE 1).. SUM(I,X(I,J)$A(I,J)) =E= 1; 56 LEAVE(I)$(ORD(I) NE 1).. SUM(J,X(I,J)$A(I,J)) =L= 1; 57 BACK('I1').. SUM(I,X(I,'I1')) =L= 0; 58 RESTRICT(I,J).. Y(I,J) =L= MAXSIZE*X(I,J); 59 60 MODEL TRANSPORT /ALL/; 61 62 SOLVE TRANSPORT MINIMIZING Z USING MIP; GAMS 2.25.087 SUN/SPARC 11/15/97 20:59:10 PAGE 2 Pizza Delivery Problem 63 64 DISPLAY Y.L,X.L; 65 66 67 68 GAMS 2.25.087 SUN/SPARC 11/15/97 20:59:10 PAGE 3 Pizza Delivery Problem Symbol Listing SYMBOL TYPE REFERENCES A SET DECLARED 6 DEFINED 6 REF 2*54 55 56 BACK EQU DECLARED 50 DEFINED 57 IMPL-ASN 62 REF 60 COST PARAM DECLARED 23 DEFINED 23 REF 53 DEMAND PARAM DECLARED 13 DEFINED 14 REF 54 FIXED PARAM DECLARED 34 DEFINED 34 REF 53 FLOW EQU DECLARED 47 DEFINED 54 IMPL-ASN 62 REF 60 I SET DECLARED 5 DEFINED 5 REF 2*6 7 13 2*23 2*38 2*39 2*53 4*54 2*55 3*56 57 2*58 CONTROL 53 54 55 56 57 58 J SET DECLARED 7 REF 3*53 5*54 3*55 2*56 2*58 CONTROL 2*53 54 55 56 58 LEAVE EQU DECLARED 49 DEFINED 56 IMPL-ASN 62 REF 60 MAXSIZE PARAM DECLARED 35 DEFINED 35 REF 58 MEET EQU DECLARED 48 DEFINED 55 IMPL-ASN 62 REF 60 OBJ EQU DECLARED 46 DEFINED 53 IMPL-ASN 62 REF 60 RESTRICT EQU DECLARED 51 DEFINED 58 IMPL-ASN 62 REF 60 TRANSPORT MODEL DECLARED 60 DEFINED 60 IMPL-ASN 62 REF 62 X VAR DECLARED 38 IMPL-ASN 62 REF 42 2*53 55 56 57 58 64 Y VAR DECLARED 39 IMPL-ASN 62 REF 43 2*54 58 64 Z VAR DECLARED 40 IMPL-ASN 62 REF 53 62 SETS A ARCS I locations including pizza store J Aliased with I PARAMETERS COST DEMAND represents the demands of all locations FIXED fixed cost associated with each delivery trip MAXSIZE max size of pizza oven VARIABLES X 0 or 1 depending on whether arc is used Y amount shipped from I to J Z total cost GAMS 2.25.087 SUN/SPARC 11/15/97 20:59:10 PAGE 4 Pizza Delivery Problem Symbol Listing EQUATIONS BACK no truck can return to the pizza store FLOW total demand is satisfied LEAVE only one driver can leave the pizza store MEET only one driver can meet the demand of each customer OBJ total cost of shipping RESTRICT force variable to 0 MODELS TRANSPORT COMPILATION TIME = 0.067 SECONDS VERID SUN-25-087 GAMS 2.25.087 SUN/SPARC 11/15/97 20:59:10 PAGE 5 Pizza Delivery Problem Equation Listing SOLVE TRANSPORT USING MIP FROM LINE 62 ---- OBJ =E= total cost of shipping OBJ.. - 0.557*X(I1,I1) - 12.557*X(I1,I2) - 15.557*X(I1,I3) - 7.557*X(I1,I4) - 20.557*X(I1,I5) - 15.557*X(I1,I6) - 5.557*X(I1,I7) - 14.557*X(I1,I8) - 2*X(I2,I3) - 5*X(I2,I4) - 7*X(I2,I5) - 12*X(I2,I6) - 11*X(I2,I7) - 18*X(I2,I8) - 2*X(I3,I2) - 4*X(I3,I4) - 5*X(I3,I5) - 10*X(I3,I6) - 9*X(I3,I7) - 16*X(I3,I8) - 5*X(I4,I2) - 4*X(I4,I3) - 3*X(I4,I5) - 6*X(I4,I6) - 2*X(I4,I7) - 10*X(I4,I8) - 9*X(I5,I2) - 10*X(I5,I3) - 3*X(I5,I4) - 6*X(I5,I6) - 4*X(I5,I7) - 10*X(I5,I8) - 12*X(I6,I2) - 10*X(I6,I3) - 6*X(I6,I4) - 6*X(I6,I5) - 3*X(I6,I7) - 5*X(I6,I8) - 11*X(I7,I2) - 9*X(I7,I3) - 2*X(I7,I4) - 4*X(I7,I5) - 3*X(I7,I6) - 3*X(I7,I8) - 18*X(I8,I2) - 16*X(I8,I3) - 10*X(I8,I4) - 10*X(I8,I5) - 5*X(I8,I6) - 3*X(I8,I7) + Z =E= 0 ; (LHS = 0) ---- FLOW =E= total demand is satisfied FLOW(I1).. - Y(I1,I2) - Y(I1,I3) - Y(I1,I4) - Y(I1,I5) - Y(I1,I6) - Y(I1,I7) - Y(I1,I8) =E= -12 ; (LHS = 0 ***) FLOW(I2).. Y(I1,I2) - Y(I2,I3) - Y(I2,I4) - Y(I2,I5) - Y(I2,I6) - Y(I2,I7) - Y(I2,I8) + Y(I3,I2) + Y(I4,I2) + Y(I5,I2) + Y(I6,I2) + Y(I7,I2) + Y(I8,I2) =E= 1 ; (LHS = 0 ***) FLOW(I3).. Y(I1,I3) + Y(I2,I3) - Y(I3,I2) - Y(I3,I4) - Y(I3,I5) - Y(I3,I6) - Y(I3,I7) - Y(I3,I8) + Y(I4,I3) + Y(I5,I3) + Y(I6,I3) + Y(I7,I3) + Y(I8,I3) =E= 1 ; (LHS = 0 ***) REMAINING 5 ENTRIES SKIPPED ---- MEET =E= only one driver can meet the demand of each customer MEET(I2).. X(I1,I2) + X(I2,I2) + X(I3,I2) + X(I4,I2) + X(I5,I2) + X(I6,I2) + X(I7,I2) + X(I8,I2) =E= 1 ; (LHS = 0 ***) GAMS 2.25.087 SUN/SPARC 11/15/97 20:59:10 PAGE 6 Pizza Delivery Problem Equation Listing SOLVE TRANSPORT USING MIP FROM LINE 62 MEET =E= only one driver can meet the demand of each customer MEET(I3).. X(I1,I3) + X(I2,I3) + X(I3,I3) + X(I4,I3) + X(I5,I3) + X(I6,I3) + X(I7,I3) + X(I8,I3) =E= 1 ; (LHS = 0 ***) MEET(I4).. X(I1,I4) + X(I2,I4) + X(I3,I4) + X(I4,I4) + X(I5,I4) + X(I6,I4) + X(I7,I4) + X(I8,I4) =E= 1 ; (LHS = 0 ***) REMAINING 4 ENTRIES SKIPPED ---- LEAVE =L= only one driver can leave the pizza store LEAVE(I2).. X(I2,I2) + X(I2,I3) + X(I2,I4) + X(I2,I5) + X(I2,I6) + X(I2,I7) + X(I2,I8) =L= 1 ; (LHS = 0) LEAVE(I3).. X(I3,I2) + X(I3,I3) + X(I3,I4) + X(I3,I5) + X(I3,I6) + X(I3,I7) + X(I3,I8) =L= 1 ; (LHS = 0) LEAVE(I4).. X(I4,I2) + X(I4,I3) + X(I4,I4) + X(I4,I5) + X(I4,I6) + X(I4,I7) + X(I4,I8) =L= 1 ; (LHS = 0) REMAINING 4 ENTRIES SKIPPED ---- BACK =L= no truck can return to the pizza store BACK(I1).. X(I1,I1) + X(I2,I1) + X(I3,I1) + X(I4,I1) + X(I5,I1) + X(I6,I1) + X(I7,I1) + X(I8,I1) =L= 0 ; (LHS = 0) ---- RESTRICT =L= force variable to 0 RESTRICT(I1,I1).. - 4*X(I1,I1) + Y(I1,I1) =L= 0 ; (LHS = 0) RESTRICT(I1,I2).. - 4*X(I1,I2) + Y(I1,I2) =L= 0 ; (LHS = 0) RESTRICT(I1,I3).. - 4*X(I1,I3) + Y(I1,I3) =L= 0 ; (LHS = 0) REMAINING 61 ENTRIES SKIPPED GAMS 2.25.087 SUN/SPARC 11/15/97 20:59:10 PAGE 7 Pizza Delivery Problem Column Listing SOLVE TRANSPORT USING MIP FROM LINE 62 ---- X 0 or 1 depending on whether arc is used X(I1,I1) (.LO, .L, .UP = 0, 0, 1) -0.557 OBJ 1 BACK(I1) -4 RESTRICT(I1,I1) X(I1,I2) (.LO, .L, .UP = 0, 0, 1) -12.557 OBJ 1 MEET(I2) -4 RESTRICT(I1,I2) X(I1,I3) (.LO, .L, .UP = 0, 0, 1) -15.557 OBJ 1 MEET(I3) -4 RESTRICT(I1,I3) REMAINING 61 ENTRIES SKIPPED ---- Y amount shipped from I to J Y(I1,I1) (.LO, .L, .UP = 0, 0, +INF) 1 RESTRICT(I1,I1) Y(I1,I2) (.LO, .L, .UP = 0, 0, +INF) -1 FLOW(I1) 1 FLOW(I2) 1 RESTRICT(I1,I2) Y(I1,I3) (.LO, .L, .UP = 0, 0, +INF) -1 FLOW(I1) 1 FLOW(I3) 1 RESTRICT(I1,I3) REMAINING 61 ENTRIES SKIPPED ---- Z total cost Z (.LO, .L, .UP = -INF, 0, +INF) 1 OBJ GAMS 2.25.087 SUN/SPARC 11/15/97 20:59:10 PAGE 8 Pizza Delivery Problem Model Statistics SOLVE TRANSPORT USING MIP FROM LINE 62 MODEL STATISTICS BLOCKS OF EQUATIONS 6 SINGLE EQUATIONS 88 BLOCKS OF VARIABLES 3 SINGLE VARIABLES 129 NON ZERO ELEMENTS 390 DISCRETE VARIABLES 64 GENERATION TIME = 0.083 SECONDS EXECUTION TIME = 0.083 SECONDS VERID SUN-25-087 GAMS 2.25.087 SUN/SPARC 11/15/97 20:59:10 PAGE 9 Pizza Delivery Problem Solution Report SOLVE TRANSPORT USING MIP FROM LINE 62 S O L V E S U M M A R Y MODEL TRANSPORT OBJECTIVE Z TYPE MIP DIRECTION MINIMIZE SOLVER LAMPS FROM LINE 62 **** SOLVER STATUS 1 NORMAL COMPLETION **** MODEL STATUS 2 LOCALLY OPTIMAL **** OBJECTIVE VALUE 43.6710 RESOURCE USAGE, LIMIT 5.750 1000.000 ITERATION COUNT, LIMIT 567 1000 GAMS/LAMPS Interface 1.07 Advanced Mathematical Software -------------------------- Yukon Court, 4 Yukon Road Running LAMPS Version 1.66 London SW12 9PU, England ** Solution Summary ** Primal Integer Number of iterations 43 524 CPU Time (secs) 1.02 4.71 Number of nodes 74 Objective value 31.4210 43.6710 Exit - Integer Optimal within Tolerances LOWER LEVEL UPPER MARGINAL ---- EQU OBJ . . . 1.000 OBJ total cost of shipping ---- EQU FLOW total demand is satisfied LOWER LEVEL UPPER MARGINAL I1 -12.000 -12.000 -12.000 . I2 1.000 1.000 1.000 4.389 I3 1.000 1.000 1.000 4.389 I4 2.000 2.000 2.000 4.389 I5 3.000 3.000 3.000 5.139 I6 3.000 3.000 3.000 3.639 I7 1.000 1.000 1.000 5.139 I8 1.000 1.000 1.000 3.639 ---- EQU MEET only one driver can meet the demand of each customer LOWER LEVEL UPPER MARGINAL I2 1.000 1.000 1.000 EPS I3 1.000 1.000 1.000 EPS I4 1.000 1.000 1.000 -10.000 I5 1.000 1.000 1.000 EPS I6 1.000 1.000 1.000 EPS I7 1.000 1.000 1.000 -15.000 GAMS 2.25.087 SUN/SPARC 11/15/97 20:59:10 PAGE 10 Pizza Delivery Problem Solution Report SOLVE TRANSPORT USING MIP FROM LINE 62 EQU MEET only one driver can meet the demand of each customer LOWER LEVEL UPPER MARGINAL I8 1.000 1.000 1.000 EPS ---- EQU LEAVE only one driver can leave the pizza store LOWER LEVEL UPPER MARGINAL I2 -INF . 1.000 . I3 -INF 1.000 1.000 . I4 -INF 1.000 1.000 . I5 -INF . 1.000 . I6 -INF 1.000 1.000 . I7 -INF 1.000 1.000 . I8 -INF . 1.000 . ---- EQU BACK no truck can return to the pizza store LOWER LEVEL UPPER MARGINAL I1 -INF . . . ---- EQU RESTRICT force variable to 0 LOWER LEVEL UPPER MARGINAL I1.I1 -INF . . -0.139 I1.I2 -INF . . -4.389 I1.I3 -INF . . -4.389 I1.I4 -INF . . -4.389 I1.I5 -INF . . -5.139 I1.I6 -INF . . -3.639 I1.I7 -INF . . -5.139 I1.I8 -INF . . -3.639 I2.I1 -INF . . . I2.I2 -INF . . . I2.I3 -INF . . -0.500 I2.I4 -INF . . EPS I2.I5 -INF . . -0.750 I2.I6 -INF . . . I2.I7 -INF . . -0.750 I2.I8 -INF . . . I3.I1 -INF . . . I3.I2 -INF -3.000 . . I3.I3 -INF . . . I3.I4 -INF . . EPS I3.I5 -INF . . -0.750 I3.I6 -INF . . . I3.I7 -INF . . -0.750 I3.I8 -INF . . . I4.I1 -INF . . . I4.I2 -INF . . . I4.I3 -INF -2.000 . . I4.I4 -INF . . -2.500 I4.I5 -INF . . -0.750 I4.I6 -INF . . . GAMS 2.25.087 SUN/SPARC 11/15/97 20:59:10 PAGE 11 Pizza Delivery Problem Solution Report SOLVE TRANSPORT USING MIP FROM LINE 62 EQU RESTRICT force variable to 0 LOWER LEVEL UPPER MARGINAL I4.I7 -INF . . -0.750 I4.I8 -INF . . . I5.I1 -INF . . . I5.I2 -INF . . . I5.I3 -INF . . . I5.I4 -INF . . . I5.I5 -INF . . . I5.I6 -INF . . . I5.I7 -INF . . EPS I5.I8 -INF . . . I6.I1 -INF . . . I6.I2 -INF . . -0.750 I6.I3 -INF . . -0.750 I6.I4 -INF . . -0.750 I6.I5 -INF . . -1.500 I6.I6 -INF . . . I6.I7 -INF . . -1.500 I6.I8 -INF -3.000 . . I7.I1 -INF . . . I7.I2 -INF . . . I7.I3 -INF . . . I7.I4 -INF . . . I7.I5 -INF -1.000 . . I7.I6 -INF . . -0.750 I7.I7 -INF . . -3.750 I7.I8 -INF . . -0.750 I8.I1 -INF . . . I8.I2 -INF . . -0.750 I8.I3 -INF . . -0.750 I8.I4 -INF . . -0.750 I8.I5 -INF . . -1.500 I8.I6 -INF . . EPS I8.I7 -INF . . -1.500 I8.I8 -INF . . . ---- VAR X 0 or 1 depending on whether arc is used LOWER LEVEL UPPER MARGINAL I1.I1 . . 1.000 . I1.I2 . . 1.000 -5.000 I1.I3 . . 1.000 -2.000 I1.I4 . 1.000 1.000 . I1.I5 . . 1.000 . I1.I6 . 1.000 1.000 1.000 I1.I7 . 1.000 1.000 . I1.I8 . . 1.000 . I2.I1 . . 1.000 EPS I2.I2 . . 1.000 . I2.I3 . . 1.000 . I2.I4 . . 1.000 15.000 I2.I5 . . 1.000 4.000 I2.I6 . . 1.000 12.000 I2.I7 . . 1.000 23.000 I2.I8 . . 1.000 18.000 I3.I1 . . 1.000 EPS GAMS 2.25.087 SUN/SPARC 11/15/97 20:59:10 PAGE 12 Pizza Delivery Problem Solution Report SOLVE TRANSPORT USING MIP FROM LINE 62 VAR X 0 or 1 depending on whether arc is used LOWER LEVEL UPPER MARGINAL I3.I2 . 1.000 1.000 2.000 I3.I3 . . 1.000 . I3.I4 . . 1.000 14.000 I3.I5 . . 1.000 2.000 I3.I6 . . 1.000 10.000 I3.I7 . . 1.000 21.000 I3.I8 . . 1.000 16.000 I4.I1 . . 1.000 EPS I4.I2 . . 1.000 5.000 I4.I3 . 1.000 1.000 4.000 I4.I4 . . 1.000 . I4.I5 . . 1.000 . I4.I6 . . 1.000 6.000 I4.I7 . . 1.000 14.000 I4.I8 . . 1.000 10.000 I5.I1 . . 1.000 EPS I5.I2 . . 1.000 9.000 I5.I3 . . 1.000 10.000 I5.I4 . . 1.000 13.000 I5.I5 . . 1.000 . I5.I6 . . 1.000 6.000 I5.I7 . . 1.000 19.000 I5.I8 . . 1.000 10.000 I6.I1 . . 1.000 EPS I6.I2 . . 1.000 9.000 I6.I3 . . 1.000 7.000 I6.I4 . . 1.000 13.000 I6.I5 . . 1.000 . I6.I6 . . 1.000 . I6.I7 . . 1.000 12.000 I6.I8 . 1.000 1.000 5.000 I7.I1 . . 1.000 EPS I7.I2 . . 1.000 11.000 I7.I3 . . 1.000 9.000 I7.I4 . . 1.000 12.000 I7.I5 . 1.000 1.000 4.000 I7.I6 . . 1.000 . I7.I7 . . 1.000 . I7.I8 . . 1.000 . I8.I1 . . 1.000 EPS I8.I2 . . 1.000 15.000 I8.I3 . . 1.000 13.000 I8.I4 . . 1.000 17.000 I8.I5 . . 1.000 4.000 I8.I6 . . 1.000 5.000 I8.I7 . . 1.000 12.000 I8.I8 . . 1.000 . ---- VAR Y amount shipped from I to J LOWER LEVEL UPPER MARGINAL I1.I1 . . +INF 0.139 I1.I2 . . +INF . I1.I3 . . +INF . I1.I4 . 4.000 +INF . GAMS 2.25.087 SUN/SPARC 11/15/97 20:59:10 PAGE 13 Pizza Delivery Problem Solution Report SOLVE TRANSPORT USING MIP FROM LINE 62 VAR Y amount shipped from I to J LOWER LEVEL UPPER MARGINAL I1.I5 . . +INF . I1.I6 . 4.000 +INF . I1.I7 . 4.000 +INF . I1.I8 . . +INF EPS I2.I1 . . +INF EPS I2.I2 . . +INF EPS I2.I3 . . +INF 0.500 I2.I4 . . +INF . I2.I5 . . +INF . I2.I6 . . +INF 0.750 I2.I7 . . +INF . I2.I8 . . +INF 0.750 I3.I1 . . +INF EPS I3.I2 . 1.000 +INF . I3.I3 . . +INF EPS I3.I4 . . +INF . I3.I5 . . +INF . I3.I6 . . +INF 0.750 I3.I7 . . +INF . I3.I8 . . +INF 0.750 I4.I1 . . +INF EPS I4.I2 . . +INF EPS I4.I3 . 2.000 +INF . I4.I4 . . +INF 2.500 I4.I5 . . +INF . I4.I6 . . +INF 0.750 I4.I7 . . +INF . I4.I8 . . +INF 0.750 I5.I1 . . +INF EPS I5.I2 . . +INF 0.750 I5.I3 . . +INF 0.750 I5.I4 . . +INF 0.750 I5.I5 . . +INF EPS I5.I6 . . +INF 1.500 I5.I7 . . +INF . I5.I8 . . +INF 1.500 I6.I1 . . +INF EPS I6.I2 . . +INF . I6.I3 . . +INF . I6.I4 . . +INF . I6.I5 . . +INF . I6.I6 . . +INF EPS I6.I7 . . +INF . I6.I8 . 1.000 +INF . I7.I1 . . +INF EPS I7.I2 . . +INF 0.750 I7.I3 . . +INF 0.750 I7.I4 . . +INF 0.750 I7.I5 . 3.000 +INF . I7.I6 . . +INF 2.250 I7.I7 . . +INF 3.750 I7.I8 . . +INF 2.250 I8.I1 . . +INF EPS I8.I2 . . +INF . I8.I3 . . +INF . I8.I4 . . +INF . I8.I5 . . +INF . GAMS 2.25.087 SUN/SPARC 11/15/97 20:59:10 PAGE 14 Pizza Delivery Problem Solution Report SOLVE TRANSPORT USING MIP FROM LINE 62 VAR Y amount shipped from I to J LOWER LEVEL UPPER MARGINAL I8.I6 . . +INF . I8.I7 . . +INF . I8.I8 . . +INF EPS LOWER LEVEL UPPER MARGINAL ---- VAR Z -INF 43.671 +INF . Z total cost **** REPORT SUMMARY : 0 NONOPT 0 INFEASIBLE 0 UNBOUNDED GAMS 2.25.087 SUN/SPARC 11/15/97 20:59:10 PAGE 15 Pizza Delivery Problem E x e c u t i o n ---- 64 VARIABLE Y.L amount shipped from I to J I2 I3 I4 I5 I6 I7 I1 4.000 4.000 4.000 I3 1.000 I4 2.000 I7 3.000 + I8 I6 1.000 ---- 64 VARIABLE X.L 0 or 1 depending on whether arc is used I2 I3 I4 I5 I6 I7 I1 1.000 1.000 1.000 I3 1.000 I4 1.000 I7 1.000 + I8 I6 1.000 EXECUTION TIME = 0.133 SECONDS VERID SUN-25-087 USER: University of Waterloo G960424:1202AR-SUN Computing Services **** FILE SUMMARY INPUT /u1/c2lau/co370/project/final.gms OUTPUT /u1/c2lau/co370/project/final.lst