[Bonmin-tickets] Re: [Bonmin] #8: Disfunction of external function in AMPL using Bonmin as the solver

[Bonmin]

#8: Disfunction of external function in AMPL using Bonmin as the solver
------------------------------------------+---------------------------------
Reporter:  ytboy0208                      |        Owner:  somebody  
    Type:  defect                         |       Status:  closed    
Priority:  critical                       |    Component:  component1
 Version:                                 |   Resolution:  fixed     
Keywords:  ampl bonmin external function  |  
------------------------------------------+---------------------------------
Changes (by pbonami):

  * status:  new => closed
  * resolution:  => fixed

Comment:

 The problem seemed indeed to be in try to use the dll compiled with -m32
 with a 64 bits bonmin.

 Unfortunately there was also a bug in buildTools which made compilation of
 bonmin with the -m32 option fail.
 Good news is that the bug has been fixed in the latest trunk. So it works
 now with the trunk version of Bonmin. Calling configure with the following
 command line:

 ADD_CFLAGS="-m32" ADD_CXXFLAGS="-m32" ADD_FFLAGS="-m32"
 ../../sources/trunk/configure -C

 After make and make install, it seems to work in Ampl (see output below).

 Unfortunately I don't know when the bugfix is going to be in the stable
 branch of BuildTools.
 For the moment trunk seems to work, I am trying to think of an easy way to
 use stable,

 Best,
 Pierre

 pbonami at nodegm14:~/ampls> ./ampl
 ampl: reset; function ginv(Reals); var x; minimize Z:x*x+x+1+ginv(x);
 subject to cons:x>=0.8;
 ampl: option solver bonmin;
 ampl: solve;
 bonmin:
 ******************************************************************************
 This program contains Ipopt, a library for large-scale nonlinear
 optimization.
  Ipopt is released as open source code under the Common Public License
 (CPL).
          For more information visit http://projects.coin-or.org/Ipopt
 ******************************************************************************

 NLP0008I
               Num      Status      Obj             It       time
 NLP0009I     1        OPT         3.69           3        0.004
 Cbc3007W No integer variables - nothing to do
 Cbc3007W No integer variables - nothing to do
 NLP0009I     2        OPT         3.69           2        0.002
 OA0001I Solved NLP in 2 iterations, found a feasible solution of value
 3.690000.
 OA0003I New best feasible of 3.69 found after 0.005 sec.
 milpBound found: -1.79769e+308
 Cbc0012I Integer solution of 3.69 found by heuristic after 0 iterations
 and 0 nodes (0.00 seconds)
 Cbc0013I At root node, 0 cuts changed objective from 3.69 to 3.69 in 1
 passes
 Cbc0014I Cut generator 0 (Outer Approximation Supporting Hyperplanes for
 NLP optimum) - 0 row cuts (0 active), 0 column cuts
 Cbc0014I Cut generator 1 (GMI) - 0 row cuts (0 active), 0 column cuts
 Cbc0014I Cut generator 2 (Probing) - 0 row cuts (0 active), 0 column cuts
 Cbc0014I Cut generator 3 (covers) - 0 row cuts (0 active), 0 column cuts
 Cbc0014I Cut generator 4 (MIR) - 0 row cuts (0 active), 0 column cuts
 Cbc0014I Cut generator 5 (Outer Approximation local enumerator) - 0 row
 cuts (0 active), 0 column cuts
 Cbc0014I Cut generator 6 (Outer Approximation feasibility checker) - 0 row
 cuts (0 active), 0 column cuts
 Cbc0001I Search completed - best objective 3.69, took 0 iterations and 0
 nodes (0.00 seconds)
 Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost
 Finished
 /tmp/at19350
 bonmin: Optimal

-- 
Ticket URL: <https://projects.coin-or.org/Bonmin/ticket/8#comment:2>
Bonmin <http://projects.coin-or.org/Bonmin>
Basic Open-source Nonlinear Mixed INteger programming