Example: Redoing Fibonacci example using different GAMS features 09/12/01 15:45:33 PAGE 1 GAMS Rev 121 Linux/Intel 2 4 5 6 set I / A, B, 1*20 /; 7 8 variable x(I), dummy_cost; 9 10 equation 11 fibonacci(I) 12 objective; 13 14 fibonacci(I).. 15 x(I) =e= (x(I-1)+x(I-2))$(ord(I) > 2) + 16 1$(sameas(I,"A") or sameas(I,"B")); 17 objective.. 18 dummy_cost =e= 0; 19 20 model fib /all/; 21 22 solve fib using lp minimizing dummy_cost; 23 24 display x.l; Example: Redoing Fibonacci example using different GAMS features 09/12/01 15:45:33 PAGE 2 Unique Element Listing GAMS Rev 121 Linux/Intel Unique Elements in Entry Order 1 A B 1 2 3 4 5 6 7 8 11 9 10 11 12 13 14 15 16 17 18 21 19 20 Unique Elements in Sorted Order 1 1 10 11 12 13 14 15 16 17 18 11 19 2 20 3 4 5 6 7 8 9 21 A B COMPILATION TIME = 0.000 SECONDS 0.7 Mb LNX200-121 Example: Redoing Fibonacci example using different GAMS features 09/12/01 15:45:33 PAGE 3 Equation Listing SOLVE fib USING LP FROM LINE 22 GAMS Rev 121 Linux/Intel ---- fibonacci =E= fibonacci(A).. x(A) =E= 1 ; (LHS = 0, INFES = 1 ***) fibonacci(B).. x(B) =E= 1 ; (LHS = 0, INFES = 1 ***) fibonacci(1).. - x(A) - x(B) + x(1) =E= 0 ; (LHS = 0) REMAINING 19 ENTRIES SKIPPED ---- objective =E= objective.. dummy_cost =E= 0 ; (LHS = 0) Example: Redoing Fibonacci example using different GAMS features 09/12/01 15:45:33 PAGE 4 Column Listing SOLVE fib USING LP FROM LINE 22 GAMS Rev 121 Linux/Intel ---- x x(A) (.LO, .L, .UP = -INF, 0, +INF) 1 fibonacci(A) -1 fibonacci(1) x(B) (.LO, .L, .UP = -INF, 0, +INF) 1 fibonacci(B) -1 fibonacci(1) -1 fibonacci(2) x(1) (.LO, .L, .UP = -INF, 0, +INF) 1 fibonacci(1) -1 fibonacci(2) -1 fibonacci(3) REMAINING 19 ENTRIES SKIPPED ---- dummy_cost dummy_cost (.LO, .L, .UP = -INF, 0, +INF) 1 objective Example: Redoing Fibonacci example using different GAMS features 09/12/01 15:45:33 PAGE 5 Model Statistics SOLVE fib USING LP FROM LINE 22 GAMS Rev 121 Linux/Intel MODEL STATISTICS BLOCKS OF EQUATIONS 2 SINGLE EQUATIONS 23 BLOCKS OF VARIABLES 2 SINGLE VARIABLES 23 NON ZERO ELEMENTS 63 GENERATION TIME = 0.000 SECONDS 1.3 Mb LNX200-121 EXECUTION TIME = 0.000 SECONDS 1.3 Mb LNX200-121 Example: Redoing Fibonacci example using different GAMS features 09/12/01 15:45:33 PAGE 6 GAMS Rev 121 Linux/Intel S O L V E S U M M A R Y MODEL fib OBJECTIVE dummy_cost TYPE LP DIRECTION MINIMIZE SOLVER CPLEX FROM LINE 22 **** SOLVER STATUS 1 NORMAL COMPLETION **** MODEL STATUS 1 OPTIMAL **** OBJECTIVE VALUE 0.0000 RESOURCE USAGE, LIMIT 0.000 1000.000 ITERATION COUNT, LIMIT 0 10000 GAMS/Cplex Mar 21, 2001 LNX.CP.CL 20.0 019.019.039.LNX For Cplex 7.0 Cplex 7.0.0, GAMS Link 19 Optimal solution found. Objective : 0.000000 ---- EQU fibonacci LOWER LEVEL UPPER MARGINAL A 1.0000 1.0000 1.0000 EPS B 1.0000 1.0000 1.0000 EPS 1 . . . EPS 2 . . . EPS 3 . . . EPS 4 . . . EPS 5 . . . EPS 6 . . . EPS 7 . . . EPS 8 . . . EPS 9 . . . EPS 10 . . . EPS 11 . . . EPS 12 . . . EPS 13 . . . EPS 14 . . . EPS 15 . . . EPS 16 . . . EPS 17 . . . EPS 18 . . . EPS 19 . . . EPS 20 . . . EPS LOWER LEVEL UPPER MARGINAL ---- EQU objective . . . 1.0000 ---- VAR x LOWER LEVEL UPPER MARGINAL A -INF 1.0000 +INF . B -INF 1.0000 +INF . 1 -INF 2.0000 +INF . 2 -INF 3.0000 +INF . 3 -INF 5.0000 +INF . 4 -INF 8.0000 +INF . 5 -INF 13.0000 +INF . 6 -INF 21.0000 +INF . 7 -INF 34.0000 +INF . 8 -INF 55.0000 +INF . 9 -INF 89.0000 +INF . 10 -INF 144.0000 +INF . 11 -INF 233.0000 +INF . 12 -INF 377.0000 +INF . 13 -INF 610.0000 +INF . 14 -INF 987.0000 +INF . 15 -INF 1597.0000 +INF . 16 -INF 2584.0000 +INF . 17 -INF 4181.0000 +INF . 18 -INF 6765.0000 +INF . 19 -INF 10946.0000 +INF . 20 -INF 17711.0000 +INF . LOWER LEVEL UPPER MARGINAL ---- VAR dummy_cost -INF . +INF . **** REPORT SUMMARY : 0 NONOPT 0 INFEASIBLE 0 UNBOUNDED Example: Redoing Fibonacci example using different GAMS features 09/12/01 15:45:33 PAGE 7 E x e c u t i o n GAMS Rev 121 Linux/Intel ---- 24 VARIABLE x.L A 1.000, B 1.000, 1 2.000, 2 3.000, 3 5.000, 4 8.000, 5 13.000, 6 21.000 7 34.000, 8 55.000, 9 89.000, 10 144.000, 11 233.000, 12 377.000, 13 610.000, 14 987.000 15 1597.000, 16 2584.000, 17 4181.000, 18 6765.000, 19 10946.000, 20 17711.000 EXECUTION TIME = 0.000 SECONDS 1.3 Mb LNX200-121 USER: Computer Sciences Dept. G010628:1627AS-LNX University of Wisconsin-Madison DC2621 **** FILE SUMMARY INPUT /afs/cs.wisc.edu/u/s/w/swright/public/html/635/examples/cond2.gms OUTPUT /afs/cs.wisc.edu/u/s/w/swright/public/html/635/examples/cond2.lst