MODEL transport OBJECTIVE z TYPE MIP DIRECTION MINIMIZE SOLVER CPLEX FROM LINE 101 **** SOLVER STATUS 1 NORMAL COMPLETION **** MODEL STATUS 1 OPTIMAL **** OBJECTIVE VALUE 9848.0000 RESOURCE USAGE, LIMIT 0.811 1000.000 ITERATION COUNT, LIMIT 3939 15000 GAMS/Cplex Jun 14, 2002 WIN.CP.NA 20.7 022.024.040.VIS For Cplex 7.5 Cplex 7.5.0, GAMS Link 22 The search will stop after 5000 nodes. Proven optimal solution. MIP Solution: 9848.000000 (3939 iterations, 478 nodes) Final LP: 9848.000000 (0 iterations) Best integer solution possible: 9848.000000 Absolute gap: 0.000000 Relative gap: 0.000000 **** REPORT SUMMARY : 0 NONOPT 0 INFEASIBLE 0 UNBOUNDED GAMS Rev 133 Windows NT/95/98 10/24/05 15:04:12 Page 11 G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m E x e c u t i o n ---- 104 VARIABLE x.L mnozstvi prevazeneho zbozi 1 2 3 4 5 6 1 350.000 2 475.000 75.000 3 300.000 100.000 4 175.000 515.000 10.000 5 200.000 6 25.000 125.000 7 300.000 ---- 104 VARIABLE y.L booleovska promenna zda se prevazi zbozi 1 2 3 4 5 6 1 1.000 2 1.000 1.000 3 1.000 1.000 4 1.000 1.000 1.000 5 1.000 6 1.000 1.000 7 1.000 USER: GAMS Development Corporation, Washington, DC G871201:0000XX-XXX Free Demo, 202-342-0180, sales@gams.com, www.gams.com DC9999