
--- Job Untitled_3.gms Start 10/22/00 09:33:26 24.3.3 r48116 WEX-WEI x86 64bit/MS Windows
GAMS 24.3.3   Copyright (C) 1987-2014 GAMS Development. All rights reserved
Licensee: CGE Models for Trade Policy Course 2005        G050815:0907CA-WIN
          National Chengchi University, Dr Zhi Wang                  DC5441
--- Starting compilation
--- Untitled_3.gms(322) 3 Mb
--- .matout.gms(263) 3 Mb
--- Untitled_3.gms(324) 3 Mb
--- .matout.gms(263) 3 Mb
--- Untitled_3.gms(325) 3 Mb
--- Starting execution: elapsed 0:00:00.010
--- Untitled_3.gms(316) 4 Mb
--- Generating MIP model MC
--- Untitled_3.gms(318) 4 Mb
---   1,787 rows  1,385 columns  4,358 non-zeroes
---   120 discrete-columns
--- Executing CPLEX: elapsed 0:00:00.043

IBM ILOG CPLEX   24.3.3 r48116 Released Sep 19, 2014 WEI x86 64bit/MS Windows 
--- GAMS/Cplex licensed for continuous and discrete problems.
Cplex 12.6.0.1

Reading data...
Starting Cplex...
Space for names approximately 0.08 Mb
Use option 'names no' to turn use of names off
Tried aggregator 4 times.
MIP Presolve eliminated 1011 rows and 613 columns.
MIP Presolve modified 8 coefficients.
Aggregator did 398 substitutions.
Reduced MIP has 378 rows, 374 columns, and 1027 nonzeros.
Reduced MIP has 12 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.02 sec. (2.54 ticks)
Probing fixed 0 vars, tightened 65 bounds.
Probing time = 0.00 sec. (0.15 ticks)
Tried aggregator 2 times.
MIP Presolve eliminated 336 rows and 331 columns.
MIP Presolve modified 2 coefficients.
Aggregator did 3 substitutions.
Reduced MIP has 39 rows, 40 columns, and 101 nonzeros.
Reduced MIP has 3 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (0.56 ticks)
Probing time = 0.00 sec. (0.01 ticks)
Tried aggregator 1 time.
MIP Presolve modified 4 coefficients.
Reduced MIP has 39 rows, 40 columns, and 101 nonzeros.
Reduced MIP has 3 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (0.07 ticks)
Probing time = 0.00 sec. (0.01 ticks)
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: none, using 1 thread.
Initializing dual steep norms . . .

Iteration log . . .
Iteration:     1   Dual objective     =          6658.177928
Root relaxation solution time = 0.00 sec. (0.04 ticks)

        Nodes                                         Cuts/
   Node  Left     Objective  IInf  Best Integer    Best Bound    ItCnt     Gap

*     0     0      integral     0     6850.9037     6850.9037       11    0.00%
Elapsed time = 0.05 sec. (8.26 ticks, tree = 0.00 MB, solutions = 1)
Found incumbent of value 6850.903672 after 0.05 sec. (8.26 ticks)

Root node processing (before b&c):
  Real time             =    0.05 sec. (8.31 ticks)
Sequential b&c:
  Real time             =    0.00 sec. (0.00 ticks)
                          ------------
Total (root+branch&cut) =    0.05 sec. (8.31 ticks)
MIP status(101): integer optimal solution
Cplex Time: 0.05sec (det. 8.31 ticks)
Fixing integer variables, and solving final LP...
Tried aggregator 1 time.
LP Presolve eliminated 1139 rows and 737 columns.
Aggregator did 342 substitutions.
Reduced LP has 306 rows, 306 columns, and 799 nonzeros.
Presolve time = 0.00 sec. (0.87 ticks)
Initializing dual steep norms . . .

Iteration log . . .
Iteration:     1   Dual objective     =          6052.292480
Iteration:    81   Dual objective     =          6565.679685
Fixed MIP status(1): optimal
Cplex Time: 0.00sec (det. 2.01 ticks)

Proven optimal solution.

MIP Solution:         6850.903672    (11 iterations, 0 nodes)
Final Solve:          6850.903672    (93 iterations)

Best possible:        6850.903672
Absolute gap:            0.000000
Relative gap:            0.000000

--- Restarting execution
--- Untitled_3.gms(318) 2 Mb
--- Reading solution for model MC
--- Executing after solve: elapsed 0:00:00.198
--- Untitled_3.gms(429) 3 Mb
--- Putfile matsol C:\Users\Modarres\Documents\gamsdir\projdir\matsol.gms
*** Status: Normal completion
--- Job Untitled_3.gms Stop 10/22/00 09:33:27 elapsed 0:00:00.200
