GAMS RUN
--- Job model.gms Start 04/26/24 17:44:19 38.2.1 96226ea8 LEX-LEG x86 64bit/Linux
--- Applying:
    /opt/gams/gams38.2_linux_x64_64_sfx/gmsprmun.txt
--- GAMS Parameters defined
    Input /var/www/html/interfaces/cgi-bin/synheat/model.gms
    ScrDir /var/www/html/interfaces/cgi-bin/synheat/225a/
    SysDir /opt/gams/gams38.2_linux_x64_64_sfx/
    LogOption 3
Licensee: Prof. Ignacio E. Grossmann                     G240103|0002AS-GEN
          Carnegie Mellon University, Dept. of Chemical Engineering  DCE375
          /opt/gams/gams38.2_linux_x64_64_sfx/gamslice.txt
          License Admin: Ignacio E. Grossmann,                             
          Evaluation license: Not for commercial or production use
Processor information: 1 socket(s), 4 core(s), and 4 thread(s) available
GAMS 38.2.1   Copyright (C) 1987-2022 GAMS Development. All rights reserved
--- Starting compilation
--- model.gms(1) 2 Mb
--- . ex7.dat(231) 3 Mb
--- model.gms(2) 3 Mb
--- . variables.inc(12) 3 Mb
--- .. minlp.inc(714) 3 Mb
--- . variables.inc(13) 3 Mb
--- .. repminlp.inc(595) 3 Mb
--- . variables.inc(14) 3 Mb
--- .. splot.inc(1052) 3 Mb
--- . variables.inc(14) 3 Mb
--- model.gms(2) 3 Mb
--- Starting execution: elapsed 0:00:00.031
--- model.gms(766) 4 Mb
--- Generating MINLP model MIXED
--- model.gms(767) 6 Mb
---   65 rows  61 columns  233 non-zeroes
---   202 nl-code  32 nl-non-zeroes
---   12 discrete-columns
--- model.gms(767) 4 Mb
--- Executing DICOPT (Solvelink=2): elapsed 0:00:00.045
-------------------------------------------------------------------------------
Dicopt 2         38.2.1 96226ea8 Feb 19, 2022          LEG x86 64bit/Linux    
-------------------------------------------------------------------------------
by Aldo Vecchietti, Director del Instituto INGAR,
   CONICET, UTN, Santa Fe, Argentina
by Ignacio E. Grossmann, Chemical Engineering Faculty,
   Carnegie Mellon University, Pittsburgh, PA, USA
-------------------------------------------------------------------------------
--- DICOPT: Starting major iteration 1
--- DICOPT: Setting up first (relaxed) NLP.

CONOPT 3         38.2.1 96226ea8 Feb 19, 2022          LEG x86 64bit/Linux    

 
 
    C O N O P T 3   version 3.17K
    Copyright (C)   ARKI Consulting and Development A/S
                    Bagsvaerdvej 246 A
                    DK-2880 Bagsvaerd, Denmark
 
 
   Iter Phase Ninf   Infeasibility   RGmax    NSB   Step InItr MX OK
      0   0        1.5450698272E+05 (Input point)
 
                   Pre-triangular equations:   4
                   Post-triangular equations:  9
                   Definitional equations:     4
 
      1   0        1.1575000000E+05 (After pre-processing)
      2   0        3.5815429688E+01 (After scaling)
 
 ** Feasible solution. Value of objective =    110405.745006
 
   Iter Phase Ninf     Objective     RGmax    NSB   Step InItr MX OK
      6   3        7.1350368376E+04 0.0E+00     0
 
 ** Optimal solution. Reduced gradient less than tolerance.
 
--- DICOPT: Setting up first MIP

IBM ILOG CPLEX   38.2.1 96226ea8 Feb 19, 2022          LEG x86 64bit/Linux    

--- GAMS/Cplex Link licensed for continuous and discrete problems.
--- GMO setup time: 0.00s
--- GMO memory 0.52 Mb (peak 0.52 Mb)
--- Dictionary memory 0.00 Mb
--- Cplex 20.1.0.1 link memory 0.00 Mb (peak 0.01 Mb)
--- Starting Cplex

Version identifier: 20.1.0.1 | 2021-04-07 | 3a818710c
CPXPARAM_Advance                                 0
CPXPARAM_Threads                                 1
CPXPARAM_MIP_Display                             4
CPXPARAM_MIP_Pool_Capacity                       0
CPXPARAM_Simplex_Limits_Iterations               999994
CPXPARAM_TimeLimit                               999999.98600000003
CPXPARAM_MIP_Tolerances_AbsMIPGap                0
CPXPARAM_MIP_Tolerances_MIPGap                   0
Generic callback                                 0x50
Tried aggregator 2 times.
MIP Presolve eliminated 24 rows and 27 columns.
MIP Presolve modified 23 coefficients.
Aggregator did 6 substitutions.
Reduced MIP has 35 rows, 31 columns, and 125 nonzeros.
Reduced MIP has 8 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (0.13 ticks)
Found incumbent of value 1.6657207e+07 after 0.01 sec. (0.17 ticks)
Probing fixed 0 vars, tightened 7 bounds.
Probing time = 0.00 sec. (0.01 ticks)
Tried aggregator 1 time.
Detecting symmetries...
MIP Presolve modified 8 coefficients.
Reduced MIP has 35 rows, 31 columns, and 125 nonzeros.
Reduced MIP has 8 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (0.06 ticks)
Probing fixed 0 vars, tightened 1 bounds.
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.
Tried aggregator 1 time.
Aggregator did 5 substitutions.
Reduced LP has 30 rows, 26 columns, and 115 nonzeros.
Presolve time = 0.00 sec. (0.02 ticks)
Initializing dual steep norms . . .

Iteration log . . .
Iteration:     1   Dual objective     =         -1000.000000
Initializing dual steep norms . . .
Root relaxation solution time = 0.00 sec. (0.10 ticks)

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

*     0+    0                       1.66572e+07    -1000.0000           100.01%
Found incumbent of value 1.6657207e+07 after 0.02 sec. (0.38 ticks)
      0     0  1220930.9267     3   1.66572e+07  1220930.9267       14   92.67%
*     0+    0                      4494759.7211  1220930.9267            72.84%
Found incumbent of value 4494759.721127 after 0.02 sec. (0.44 ticks)
      0     0  1715232.9503     1  4494759.7211      Cuts: 15       23   61.84%
*     0+    0                      1721600.2050  1715232.9503             0.37%
Found incumbent of value 1721600.205017 after 0.02 sec. (0.65 ticks)
      0     0        cutoff        1721600.2050                     23    0.00%
Elapsed time = 0.02 sec. (0.73 ticks, tree = 0.01 MB)

Implied bound cuts applied:  1
Mixed integer rounding cuts applied:  5
Gomory fractional cuts applied:  3

Root node processing (before b&c):
  Real time             =    0.02 sec. (0.73 ticks)
Sequential b&c:
  Real time             =    0.00 sec. (0.00 ticks)
                          ------------
Total (root+branch&cut) =    0.02 sec. (0.73 ticks)

--- MIP status (101): integer optimal solution.
--- Cplex Time: 0.02sec (det. 0.74 ticks)

--- Fixing integer variables and solving final LP...

Version identifier: 20.1.0.1 | 2021-04-07 | 3a818710c
CPXPARAM_Advance                                 2
CPXPARAM_Threads                                 1
CPXPARAM_MIP_Display                             4
CPXPARAM_MIP_Pool_Capacity                       0
CPXPARAM_Simplex_Limits_Iterations               999994
CPXPARAM_TimeLimit                               999999.98600000003
CPXPARAM_MIP_Tolerances_AbsMIPGap                0
CPXPARAM_MIP_Tolerances_MIPGap                   0
Tried aggregator 1 time.
LP Presolve eliminated 43 rows and 40 columns.
Aggregator did 14 substitutions.
Reduced LP has 8 rows, 10 columns, and 29 nonzeros.
Presolve time = 0.00 sec. (0.05 ticks)
Initializing dual steep norms . . .

Iteration log . . .
Iteration:     1   Dual objective     =         -1000.000000

--- Fixed MIP status (1): optimal.
--- Cplex Time: 0.00sec (det. 0.09 ticks)


Proven optimal solution
MIP Solution:      1721600.205017    (23 iterations, 0 nodes)
Final Solve:       1721600.205017    (5 iterations)

Best possible:     1721600.205017
Absolute gap:            0.000000
Relative gap:            0.000000

--- DICOPT: Starting major iteration 2
--- DICOPT: Setting up next NLP

CONOPT 3         38.2.1 96226ea8 Feb 19, 2022          LEG x86 64bit/Linux    

 
 
    C O N O P T 3   version 3.17K
    Copyright (C)   ARKI Consulting and Development A/S
                    Bagsvaerdvej 246 A
                    DK-2880 Bagsvaerd, Denmark
 
 
   Iter Phase Ninf   Infeasibility   RGmax    NSB   Step InItr MX OK
      0   0        1.5294847893E+06 (Input point)
 
                   Pre-triangular equations:   4
                   Post-triangular equations:  9
                   Definitional equations:     4
 
      1   0        0.0000000000E+00 (After pre-processing)
      2   0        0.0000000000E+00 (After scaling)
 
 ** Feasible solution. Value of objective =    192115.415699
 
   Iter Phase Ninf     Objective     RGmax    NSB   Step InItr MX OK
      5   3        1.8244745524E+05 0.0E+00     0
 
 ** Optimal solution. There are no superbasic variables.
 
--- DICOPT: Checking convergence
--- DICOPT: Setting up next MIP
--- GMO Resort Time 0ms
--- DICOPT: Log File:
 Major Major     Objective    CPU time  Itera- Evaluation Solver
 Step  Iter       Function     (Sec)    tions   Errors
  NLP    1     71350.36838      0.01        6      0      conopt
  MIP    1   1721600.20502      0.05       23      0      cplex
  NLP    2    182447.45524<     0.00        5      0      conopt

IBM ILOG CPLEX   38.2.1 96226ea8 Feb 19, 2022          LEG x86 64bit/Linux    

--- GAMS/Cplex Link licensed for continuous and discrete problems.
--- GMO setup time: 0.00s
--- GMO memory 0.52 Mb (peak 0.52 Mb)
--- Dictionary memory 0.00 Mb
--- Cplex 20.1.0.1 link memory 0.00 Mb (peak 0.01 Mb)
--- Starting Cplex

Version identifier: 20.1.0.1 | 2021-04-07 | 3a818710c
CPXPARAM_Advance                                 0
CPXPARAM_Threads                                 1
CPXPARAM_MIP_Display                             4
CPXPARAM_MIP_Pool_Capacity                       0
CPXPARAM_Simplex_Limits_Iterations               999966
CPXPARAM_TimeLimit                               999999.93500000006
CPXPARAM_MIP_Tolerances_AbsMIPGap                0
CPXPARAM_MIP_Tolerances_MIPGap                   0
Generic callback                                 0x50
Tried aggregator 2 times.
MIP Presolve eliminated 19 rows and 24 columns.
MIP Presolve modified 38 coefficients.
Aggregator did 6 substitutions.
Reduced MIP has 42 rows, 36 columns, and 164 nonzeros.
Reduced MIP has 12 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (0.16 ticks)
Found incumbent of value 8.6733881e+07 after 0.00 sec. (0.26 ticks)
Probing fixed 2 vars, tightened 7 bounds.
Probing time = 0.00 sec. (0.02 ticks)
Tried aggregator 1 time.
Detecting symmetries...
MIP Presolve eliminated 2 rows and 2 columns.
MIP Presolve modified 8 coefficients.
Reduced MIP has 40 rows, 34 columns, and 158 nonzeros.
Reduced MIP has 10 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (0.08 ticks)
Probing fixed 0 vars, tightened 1 bounds.
Probing time = 0.00 sec. (0.01 ticks)
Clique table members: 2.
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: none, using 1 thread.
Tried aggregator 1 time.
Aggregator did 2 substitutions.
Reduced LP has 38 rows, 32 columns, and 154 nonzeros.
Presolve time = 0.00 sec. (0.03 ticks)
Initializing dual steep norms . . .

Iteration log . . .
Iteration:     1   Dual objective     =         -1000.000000
Initializing dual steep norms . . .
Root relaxation solution time = 0.00 sec. (0.13 ticks)

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

*     0+    0                       8.67339e+07    -1000.0000           100.00%
Found incumbent of value 8.6733881e+07 after 0.01 sec. (0.55 ticks)
      0     0  3025833.0375     4   8.67339e+07  3025833.0375       15   96.51%
*     0+    0                      3121140.9070  3025833.0375             3.05%
Found incumbent of value 3121140.907036 after 0.01 sec. (0.63 ticks)
      0     0  3083951.1497     1  3121140.9070       Cuts: 7       20    1.19%
      0     0        cutoff        3121140.9070                     21    0.00%
Elapsed time = 0.01 sec. (1.01 ticks, tree = 0.01 MB)

Mixed integer rounding cuts applied:  4

Root node processing (before b&c):
  Real time             =    0.02 sec. (1.01 ticks)
Sequential b&c:
  Real time             =    0.00 sec. (0.00 ticks)
                          ------------
Total (root+branch&cut) =    0.02 sec. (1.01 ticks)

--- MIP status (101): integer optimal solution.
--- Cplex Time: 0.02sec (det. 1.01 ticks)

--- Fixing integer variables and solving final LP...

Version identifier: 20.1.0.1 | 2021-04-07 | 3a818710c
CPXPARAM_Advance                                 2
CPXPARAM_Threads                                 1
CPXPARAM_MIP_Display                             4
CPXPARAM_MIP_Pool_Capacity                       0
CPXPARAM_Simplex_Limits_Iterations               999966
CPXPARAM_TimeLimit                               999999.93500000006
CPXPARAM_MIP_Tolerances_AbsMIPGap                0
CPXPARAM_MIP_Tolerances_MIPGap                   0
Tried aggregator 1 time.
LP Presolve eliminated 50 rows and 48 columns.
Aggregator did 14 substitutions.
Reduced LP has 3 rows, 4 columns, and 10 nonzeros.
Presolve time = 0.00 sec. (0.05 ticks)
Initializing dual steep norms . . .

Iteration log . . .
Iteration:     1   Dual objective     =       1721600.205017

--- Fixed MIP status (1): optimal.
--- Cplex Time: 0.00sec (det. 0.09 ticks)


Proven optimal solution
MIP Solution:      3121140.907036    (21 iterations, 0 nodes)
Final Solve:       3121140.907036    (2 iterations)

Best possible:     3121140.907036
Absolute gap:            0.000000
Relative gap:            0.000000

--- DICOPT: Starting major iteration 3
--- DICOPT: Setting up next NLP

CONOPT 3         38.2.1 96226ea8 Feb 19, 2022          LEG x86 64bit/Linux    

 
 
    C O N O P T 3   version 3.17K
    Copyright (C)   ARKI Consulting and Development A/S
                    Bagsvaerdvej 246 A
                    DK-2880 Bagsvaerd, Denmark
 
 
   Iter Phase Ninf   Infeasibility   RGmax    NSB   Step InItr MX OK
      0   0        2.9339605956E+06 (Input point)
 
                   Pre-triangular equations:   4
                   Post-triangular equations:  9
                   Definitional equations:     4
 
      1   0        1.4779288904E-12 (After pre-processing)
      2   0        3.0531133177E-16 (After scaling)
 
 ** Feasible solution. Value of objective =    187180.311456
 
   Iter Phase Ninf     Objective     RGmax    NSB   Step InItr MX OK
      4   3        1.8244745524E+05 0.0E+00     0
 
 ** Optimal solution. There are no superbasic variables.
 
--- DICOPT: Checking convergence
--- DICOPT: Search stopped on worsening of NLP subproblems
--- DICOPT: Log File:
 Major Major     Objective    CPU time  Itera- Evaluation Solver
 Step  Iter       Function     (Sec)    tions   Errors
  NLP    1     71350.36838      0.01        6      0      conopt
  MIP    1   1721600.20502      0.05       23      0      cplex
  NLP    2    182447.45524<     0.00        5      0      conopt
  MIP    2   3121140.90704      0.02       21      0      cplex
  NLP    3    182447.45524      0.00        4      0      conopt
--- DICOPT: Terminating...
--- DICOPT: Stopped on NLP worsening

      The search was stopped because the objective function
      of the NLP subproblems started to deteriorate.

--- DICOPT: Best integer solution found: 182447.455240
--- Reading solution for model MIXED
--- Executing after solve: elapsed 0:00:00.177
--- model.gms(850) 4 Mb
--- Generating NLP model NONLINEAR
--- model.gms(900) 6 Mb
--- LOOPS ONE = 1
---   105 rows  85 columns  329 non-zeroes
---   336 nl-code  116 nl-non-zeroes
--- model.gms(900) 4 Mb
--- Executing CONOPT (Solvelink=2): elapsed 0:00:00.187

CONOPT 3         38.2.1 96226ea8 Feb 19, 2022          LEG x86 64bit/Linux    

 
 
    C O N O P T 3   version 3.17K
    Copyright (C)   ARKI Consulting and Development A/S
                    Bagsvaerdvej 246 A
                    DK-2880 Bagsvaerd, Denmark
 
 
   Iter Phase Ninf   Infeasibility   RGmax    NSB   Step InItr MX OK
      0   0        2.2031679639E+05 (Input point)
 
                   Pre-triangular equations:   4
                   Post-triangular equations:  17
                   Definitional equations:     16
 
      1   0        2.2843000000E+04 (After pre-processing)
      2   0        9.2470703125E+00 (After scaling)
 
 ** Feasible solution. Value of objective =    185824.249597
 
   Iter Phase Ninf     Objective     RGmax    NSB   Step InItr MX OK
      6   3        1.6439320615E+05 2.7E+05     2 1.0E+00    2 T  T
      7   3        1.6439320615E+05 0.0E+00     2
 
 ** Optimal solution. Reduced gradient less than tolerance.
 
--- Reading solution for model NONLINEAR
--- Executing after solve: elapsed 0:00:00.222
--- model.gms(850) 4 Mb
--- model.gms(2607) 4 Mb
--- Putfile RES1 /var/www/html/interfaces/synheat/output.html
--- Putfile RES16 /var/www/html/interfaces/cgi-bin/synheat/si
--- Putfile RES17 /var/www/html/interfaces/cgi-bin/synheat/fi
--- Putfile RES6 /var/www/html/interfaces/cgi-bin/synheat/ei
--- Putfile RES7 /var/www/html/interfaces/cgi-bin/synheat/ci
--- Putfile RES8 /var/www/html/interfaces/cgi-bin/synheat/hi
--- Putfile RES9 /var/www/html/interfaces/cgi-bin/synheat/ui
--- Putfile RES11 /var/www/html/interfaces/cgi-bin/synheat/ai
--- Putfile RES10 /var/www/html/interfaces/cgi-bin/synheat/yi
--- Putfile RES12 /var/www/html/interfaces/cgi-bin/synheat/bi
--- Putfile RES5 /var/www/html/interfaces/cgi-bin/synheat/synheat.dem
--- Putfile RES18 /var/www/html/interfaces/cgi-bin/synheat/phi
--- Putfile RES19 /var/www/html/interfaces/cgi-bin/synheat/pci
--- Putfile RES20 /var/www/html/interfaces/cgi-bin/synheat/pinch.dem
*** Status: Normal completion
--- Job model.gms Stop 04/26/24 17:44:19 elapsed 0:00:00.238