GAMS RUN
--- Job model.gms Start 07/17/26 11:59:38 52.5.0 9bc771bf LEX-LEG x86 64bit/Linux
--- Applying:
--- 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/gams52.5_linux_x64_64_sfx/
    LogOption 3
    AppendLog 1
Licensee: Floating Network License                       G260106+0003Ac-GEN
          Carnegie Mellon University Dept. of Chemical Engineering /DCE5111
          225a/gamslice.dat
          b6e62ba8-f85c-4c72
          node:62997503 mem:16 cores:4 ipport:47513 v:2                    
          Evaluation license: Not for commercial or production use
          The time-limited license stops working on : Jul 30, 2027
System information: 4 physical cores and 16 Gb physical memory detected
GAMS 52.5.0   Copyright (C) 1987-2026 GAMS Development. All rights reserved
--- Starting compilation
--- model.gms(1) 2 Mb
--- > ex1.dat(232) 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.006
--- model.gms(767) 4 Mb
--- Generating MINLP model MIXED
--- model.gms(768) 6 Mb
---   65 rows  61 columns  245 non-zeroes
---   202 nl-code  32 nl-non-zeroes
---   12 discrete-columns
--- Range statistics (absolute non-zero finite values)
--- RHS       [min, max] : [ 2.400E+02, 6.800E+02] - Zero values observed as well
--- Bound     [min, max] : [ 1.000E+00, 1.000E+03] - Zero values observed as well
--- Matrix    [min, max] : [ 1.000E+00, 4.400E+03] - Zero values observed as well
--- model.gms(768) 4 Mb
--- Executing DICOPT (Solvelink=2): elapsed 0:00:00.008
-------------------------------------------------------------------------------
Dicopt 2         52.5.0 9bc771bf Jan 28, 2026          LEG x86 64bit/Linux    
-------------------------------------------------------------------------------
--- DICOPT: Starting major iteration 1
--- DICOPT: Setting up first (relaxed) NLP.

CONOPT 4         52.5.0 9bc771bf Jan 28, 2026          LEG x86 64bit/Linux    

 
 
    C O N O P T   version 4.39.0
    Copyright (C) GAMS Software GmbH
                  GAMS Development Corporation
 
    Will use up to 4 threads.
 
 
    The user model has 65 constraints and 61 variables
    with 245 Jacobian elements, 32 of which are nonlinear.
    The Hessian of the Lagrangian has 32 elements on the diagonal,
    36 elements below the diagonal, and 32 nonlinear variables.
 
    Iter Phase   Ninf   Infeasibility   RGmax      NSB   Step  InItr MX OK
       0   0          1.7336712895E+05 (Input point)
 
    The pre-triangular part of the model has 12 constraints and variables.
    The post-triangular part of the model has 1 constraints and variables.
 
    Preprocessed model has 52 constraints and 48 variables
    with 152 Jacobian elements, 0 of which are nonlinear.
 
    Iter Phase   Ninf   Infeasibility   RGmax      NSB   Step  InItr MX OK
                      1.0300000000E+05 (Full preprocessed model)
                      4.1894531250E+01 (After scaling)
                      5.5541992188E+00 (After adjusting individual variables)
 
 ** Feasible solution. Value of objective =    253511.786210
 
    Iter Phase   Ninf     Objective     RGmax      NSB   Step  InItr MX OK
       6   4          6.1988073543E+04 1.3E+04       4 1.0E+00     2 T  T
      11   4          6.0018700308E+04 5.4E-08       2
 
 ** Optimal solution. Reduced gradient less than tolerance.
 
--- DICOPT: Setting up first MIP

IBM ILOG CPLEX   52.5.0 9bc771bf Jan 28, 2026          LEG x86 64bit/Linux    

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

Version identifier: 22.1.2.0 | 2024-11-26 | 0edbb82fd
CPXPARAM_Advance                                 0
CPXPARAM_MIP_Display                             4
CPXPARAM_MIP_Pool_Capacity                       0
CPXPARAM_Simplex_Limits_Iterations               999989
CPXPARAM_TimeLimit                               999999.99399999995
CPXPARAM_MIP_Tolerances_AbsMIPGap                0
CPXPARAM_MIP_Tolerances_MIPGap                   0
Generic callback                                 0x50
Tried aggregator 2 times.
MIP Presolve eliminated 18 rows and 17 columns.
MIP Presolve modified 15 coefficients.
Aggregator did 4 substitutions.
Reduced MIP has 43 rows, 43 columns, and 168 nonzeros.
Reduced MIP has 12 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (0.18 ticks)
Found incumbent of value 738860.826867 after 0.00 sec. (0.27 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 4 coefficients.
Reduced MIP has 41 rows, 41 columns, and 162 nonzeros.
Reduced MIP has 10 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (0.09 ticks)
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: deterministic, using up to 4 threads.
Parallel mode: deterministic, using up to 1 threads for parallel tasks at root LP.
Tried aggregator 1 time.
No LP presolve or aggregator reductions.
Presolve time = 0.00 sec. (0.02 ticks)
Initializing dual steep norms . . .

Iteration log . . .
Iteration:     1   Dual objective     =         -1000.000000
Root relaxation solution time = 0.00 sec. (0.19 ticks)

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

*     0+    0                       738860.8269    -1000.0000           100.14%
Found incumbent of value 738860.826867 after 0.00 sec. (0.64 ticks)
*     0+    0                       195377.5896    -1000.0000           100.51%
Found incumbent of value 195377.589649 after 0.00 sec. (0.64 ticks)
      0     0    63649.4506     4   195377.5896    63649.4506       58   67.42%
*     0+    0                       136405.1447    63649.4506            53.34%
Found incumbent of value 136405.144729 after 0.01 sec. (0.78 ticks)
      0     0    85189.4820     5   136405.1447      Cuts: 23       67   37.55%
      0     0   123203.4767     2   136405.1447      Cuts: 10       76    9.68%
      0     0   124186.9423     1   136405.1447      Cuts: 13       78    8.96%
*     0+    0                       124975.9144   124186.9423             0.63%
Found incumbent of value 124975.914373 after 0.01 sec. (1.85 ticks)
*     0     0      integral     0   124975.9144       Cuts: 6       79    0.00%
Found incumbent of value 124975.914373 after 0.01 sec. (2.05 ticks)
*     0+    0                       124975.9144   124975.9144             0.00%
Found incumbent of value 124975.914373 after 0.01 sec. (2.05 ticks)
      0     0        cutoff         124975.9144   124975.9144       79    0.00%
Elapsed time = 0.01 sec. (2.05 ticks, tree = 0.01 MB)

Implied bound cuts applied:  2
Flow cuts applied:  1
Mixed integer rounding cuts applied:  8
Lift and project cuts applied:  2

Root node processing (before b&c):
  Real time             =    0.01 sec. (2.05 ticks)
Parallel b&c, 4 threads:
  Real time             =    0.00 sec. (0.00 ticks)
  Sync time (average)   =    0.00 sec.
  Wait time (average)   =    0.00 sec.
                          ------------
Total (root+branch&cut) =    0.01 sec. (2.05 ticks)

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

--- Returning a primal only solution to GAMS (marginals all set to NA).
--- Fixing integer variables and solving final LP...

Version identifier: 22.1.2.0 | 2024-11-26 | 0edbb82fd
CPXPARAM_Advance                                 2
CPXPARAM_MIP_Display                             4
CPXPARAM_MIP_Pool_Capacity                       0
CPXPARAM_Simplex_Limits_Iterations               999989
CPXPARAM_TimeLimit                               999999.99399999995
CPXPARAM_MIP_Tolerances_AbsMIPGap                0
CPXPARAM_MIP_Tolerances_MIPGap                   0
Tried aggregator 1 time.
LP Presolve eliminated 45 rows and 42 columns.
Aggregator did 7 substitutions.
Reduced LP has 13 rows, 15 columns, and 41 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.10 ticks)


Proven optimal solution
MIP Solution:       124975.914373    (79 iterations, 0 nodes)
Final Solve:        124975.914373    (11 iterations)

Best possible:      124975.914373
Absolute gap:           -0.000000
Relative gap:           -0.000000

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

CONOPT 4         52.5.0 9bc771bf Jan 28, 2026          LEG x86 64bit/Linux    

 
 
    C O N O P T   version 4.39.0
    Copyright (C) GAMS Software GmbH
                  GAMS Development Corporation
 
    Will use up to 4 threads.
 
 
    The user model has 65 constraints and 61 variables
    with 245 Jacobian elements, 32 of which are nonlinear.
    The Hessian of the Lagrangian has 32 elements on the diagonal,
    36 elements below the diagonal, and 32 nonlinear variables.
 
    Iter Phase   Ninf   Infeasibility   RGmax      NSB   Step  InItr MX OK
       0   0          1.0631805838E+05 (Input point)
 
    The pre-triangular part of the model has 40 constraints and 38 variables.
    The post-triangular part of the model has 1 constraints and variables.
    There are 7 definitional constraints and defined variables.
 
    Preprocessed model has 17 constraints and 15 variables
    with 35 Jacobian elements, 0 of which are nonlinear.
 
    Iter Phase   Ninf   Infeasibility   RGmax      NSB   Step  InItr MX OK
                      0.0000000000E+00 (Full preprocessed model)
                      0.0000000000E+00 (After scaling)
 
 ** Feasible solution. Value of objective =    231293.972752
 
    Iter Phase   Ninf     Objective     RGmax      NSB   Step  InItr MX OK
       1   3          2.0936050642E+05 2.4E+04       5 9.7E-02     2 F  T
       6   4          2.0024677057E+05 2.6E+01       2 1.0E+00     2 F  T
       9   4          2.0024677057E+05 9.8E-11       2
 
 ** Optimal solution. Reduced gradient less than tolerance.
 
--- 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     60018.70031      0.01       11      0      conopt
  MIP    1    124975.91437      0.01       79      0      cplex
  NLP    2    200246.77057<     0.00        9      0      conopt

IBM ILOG CPLEX   52.5.0 9bc771bf Jan 28, 2026          LEG x86 64bit/Linux    

--- GAMS/CPLEX 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 22.1.2.0 link memory 0.00 Mb (peak 0.01 Mb)
--- Starting Cplex

Version identifier: 22.1.2.0 | 2024-11-26 | 0edbb82fd
CPXPARAM_Advance                                 0
CPXPARAM_MIP_Display                             4
CPXPARAM_MIP_Pool_Capacity                       0
CPXPARAM_Simplex_Limits_Iterations               999901
CPXPARAM_TimeLimit                               999999.9831689758
CPXPARAM_MIP_Tolerances_AbsMIPGap                0
CPXPARAM_MIP_Tolerances_MIPGap                   0
Generic callback                                 0x50
Tried aggregator 2 times.
MIP Presolve eliminated 16 rows and 16 columns.
MIP Presolve modified 30 coefficients.
Aggregator did 4 substitutions.
Reduced MIP has 47 rows, 46 columns, and 216 nonzeros.
Reduced MIP has 12 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (0.22 ticks)
Found incumbent of value 773514.381473 after 0.00 sec. (0.35 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 4 coefficients.
Reduced MIP has 45 rows, 44 columns, and 206 nonzeros.
Reduced MIP has 10 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (0.11 ticks)
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: deterministic, using up to 4 threads.
Parallel mode: deterministic, using up to 1 threads for parallel tasks at root LP.
Tried aggregator 1 time.
No LP presolve or aggregator reductions.
Presolve time = 0.00 sec. (0.02 ticks)
Initializing dual steep norms . . .

Iteration log . . .
Iteration:     1   Dual objective     =         -1000.000000
Root relaxation solution time = 0.00 sec. (0.23 ticks)

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

*     0+    0                       773514.3815    -1000.0000           100.13%
Found incumbent of value 773514.381473 after 0.00 sec. (0.78 ticks)
*     0+    0                       208895.2934    -1000.0000           100.48%
Found incumbent of value 208895.293449 after 0.00 sec. (0.78 ticks)
      0     0    63649.4506     4   208895.2934    63649.4506       49   69.53%
*     0+    0                       190819.8758    63649.4506            66.64%
Found incumbent of value 190819.875811 after 0.00 sec. (0.95 ticks)
      0     0    82334.4453     6   190819.8758      Cuts: 21       58   56.85%
      0     0    91814.3595     9   190819.8758      Cuts: 17       71   51.88%
      0     0    92802.8396     9   190819.8758      Cuts: 13       78   51.37%
      0     0    94258.3986     9   190819.8758       Cuts: 5       86   50.60%
      0     0    94483.4930     9   190819.8758      Cuts: 19       91   50.49%
Detecting symmetries...
      0     0    94625.2778     9   190819.8758    MIRcuts: 2       96   50.41%
      0     0    94640.5066     9   190819.8758    MIRcuts: 1       97   50.40%
      0     0    94640.9351     9   190819.8758    MIRcuts: 1       98   50.40%
*     0+    0                       130222.7729    94640.9351            27.32%
Found incumbent of value 130222.772941 after 0.01 sec. (5.49 ticks)
      0     0        cutoff         130222.7729   130222.7729       98    0.00%
Elapsed time = 0.01 sec. (5.50 ticks, tree = 0.01 MB)

Clique cuts applied:  1
Implied bound cuts applied:  1
Mixed integer rounding cuts applied:  10
Gomory fractional cuts applied:  1

Root node processing (before b&c):
  Real time             =    0.01 sec. (5.50 ticks)
Parallel b&c, 4 threads:
  Real time             =    0.00 sec. (0.00 ticks)
  Sync time (average)   =    0.00 sec.
  Wait time (average)   =    0.00 sec.
                          ------------
Total (root+branch&cut) =    0.01 sec. (5.50 ticks)

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

--- Returning a primal only solution to GAMS (marginals all set to NA).
--- Fixing integer variables and solving final LP...

Version identifier: 22.1.2.0 | 2024-11-26 | 0edbb82fd
CPXPARAM_Advance                                 2
CPXPARAM_MIP_Display                             4
CPXPARAM_MIP_Pool_Capacity                       0
CPXPARAM_Simplex_Limits_Iterations               999901
CPXPARAM_TimeLimit                               999999.9831689758
CPXPARAM_MIP_Tolerances_AbsMIPGap                0
CPXPARAM_MIP_Tolerances_MIPGap                   0
Tried aggregator 1 time.
LP Presolve eliminated 43 rows and 40 columns.
Aggregator did 5 substitutions.
Reduced LP has 19 rows, 21 columns, and 71 nonzeros.
Presolve time = 0.00 sec. (0.06 ticks)
Initializing dual steep norms . . .

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

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


Proven optimal solution
MIP Solution:       130222.772941    (98 iterations, 0 nodes)
Final Solve:        130222.772941    (16 iterations)

Best possible:      130222.772941
Absolute gap:            0.000000
Relative gap:            0.000000

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

CONOPT 4         52.5.0 9bc771bf Jan 28, 2026          LEG x86 64bit/Linux    

 
 
    C O N O P T   version 4.39.0
    Copyright (C) GAMS Software GmbH
                  GAMS Development Corporation
 
    Will use up to 4 threads.
 
 
    The user model has 65 constraints and 61 variables
    with 245 Jacobian elements, 32 of which are nonlinear.
    The Hessian of the Lagrangian has 32 elements on the diagonal,
    36 elements below the diagonal, and 32 nonlinear variables.
 
    Iter Phase   Ninf   Infeasibility   RGmax      NSB   Step  InItr MX OK
       0   0          1.8278261380E+05 (Input point)
 
    The pre-triangular part of the model has 39 constraints and 37 variables.
    The post-triangular part of the model has 1 constraints and variables.
 
    Preprocessed model has 25 constraints and 23 variables
    with 57 Jacobian elements, 0 of which are nonlinear.
 
    Iter Phase   Ninf   Infeasibility   RGmax      NSB   Step  InItr MX OK
                      0.0000000000E+00 (Full preprocessed model)
                      0.0000000000E+00 (After scaling)
 
 ** Feasible solution. Value of objective =    313005.386743
 
    Iter Phase   Ninf     Objective     RGmax      NSB   Step  InItr MX OK
       1   3          2.3273054067E+05 7.0E+05       5 2.4E-01     1 F  T
       6   4          2.0712718724E+05 1.9E+00       3 1.0E+00     2 F  T
       8   4          2.0712718724E+05 5.1E-10       3
 
 ** Optimal solution. Reduced gradient less than tolerance.
 
--- 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     60018.70031      0.01       11      0      conopt
  MIP    1    124975.91437      0.01       79      0      cplex
  NLP    2    200246.77057<     0.00        9      0      conopt
  MIP    2    130222.77294      0.01       98      0      cplex
  NLP    3    207127.18724      0.00        8      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: 200246.770565
--- Reading solution for model MIXED
--- Executing after solve: elapsed 0:00:00.058
--- model.gms(2608) 10 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 07/17/26 11:59:38 elapsed 0:00:00.063