Solver command line: ['/home/sedghani/baron-lin64/baron', '/tmp/tmpgcz_flti.pyomo.bar']

===========================================================================
 BARON version 22.3.21. Built: LNX-64 Mon Mar 21 21:01:23 EDT 2022

 BARON is a product of The Optimization Firm.
 For information on BARON, see https://minlp.com/about-baron
 Licensee: Danilo Ardagna at Politecnico di Milano, danilo.ardagna@polimi.it.

 If you use this software, please cite publications from
 https://minlp.com/baron-publications, such as: 

 Khajavirad, A. and N. V. Sahinidis,
 A hybrid LP/NLP paradigm for global optimization relaxations,
 Mathematical Programming Computation, 10, 383-421, 2018.
===========================================================================
 This BARON run may utilize the following subsolver(s)
 For LP/MIP/QP: CLP/CBC                                         
 For NLP: IPOPT, FILTERSQP
===========================================================================
 Doing local search
 Unable to find/load CPLEX library libcplex.so: cannot open shared object file: No such file or directory
 Unable to find/load CPLEX library libcplex2010.so: cannot open shared object file: No such file or directory
 Solving bounding LP
 Preprocessing found feasible solution with value -2396592682.55     
 Starting multi-start local search
 Estimated remaining time for local search is 35 secs
 Done with local search
===========================================================================
  Iteration    Open nodes         Time (s)    Lower bound      Upper bound
          1             1           196.44   -0.239659E+10      531.663    
*         3             1           201.51     435.720          531.663    
*         9             0           226.10     437.893          437.893    
          9             0           226.17     437.893          435.726    

                  *** Problem is numerically sensitive ***    

 Wall clock time:                   226.17
 Total CPU time used:               443.55

 Total no. of BaR iterations:       9
 Best solution found at node:       9
 Max. no. of nodes in memory:       4
 
 All done
===========================================================================

