[Bonmin-tickets] [Bonmin] #52: bonmin/ipopt execs not constructed on osx 10.10.1

[Bonmin]

#52: bonmin/ipopt execs not constructed on osx 10.10.1
---------------------+----------------------
Reporter:  compiler  |       Owner:  pbonami
    Type:  defect    |      Status:  new
Priority:  major     |   Component:  Bonmin
 Version:  1.5       |  Resolution:
Keywords:            |
---------------------+----------------------

Comment (by stefan):

 Replying to [comment:2 compiler]:
 > First of all, thank you for your reply. I do not have AMPL and do not
 intend to use it in the future either. So I was trying to get executable
 and didn't think I would need to obtain ASL as I am not going to use it
 with AMPL. The bonmin manual clearly states that the following
 instructions:
 > " BONMIN is compiled and installed using the commands:
 > ./configure -C
 > make
 > make install
 > This installs the executable bonmin in Bonmin-1.8/bin
 > "
 > Hence, the confusion.

 OK, we will try to make this more precise in the docu.

 > As a second question, following your reply, I was also able to get
 executables with cplex. I do set "bonmin.milp_solver Cplex" however it
 continues using cbc... here is an output of bonmin solve command with a
 bonmin.opt file in working directory (with the cplex option in the .opt
 file):

 The "milp_solver" option referes to the solution of MIPs within Bonmin
 (e.g., MIP relaxations in the B-OA algorithm), not to how Bonmin's branch-
 and-bound tree is managed (when using B-BB, B-Hyb, B-QG). So there will
 (nowadays) always be a Cbc.
 The first line of output just states what Bonmin has been compiled with.
 It doesn't mention Cplex, even if it is there.


 > ----------------------------------------------------------------------
 >
 > Bonmin 1.8.0 using Cbc 2.9.0 and Ipopt 3.12.0
 >
 >
 > This program contains Ipopt, a library for large-scale nonlinear
 optimization.
 >  Ipopt is released as open source code under the Eclipse Public License
 (EPL).
 >          For more information visit http://projects.coin-or.org/Ipopt
 >
 > NLP0012I
 >               Num      Status      Obj             It       time
 Location
 > NLP0014I             1         OPT 980.60249       30 0.20872     build
 initial OA[[BR]]
 > NLP0014I             2         OPT 1664.7528      139 0.729486     OA
 decomposition[[BR]]
 > OA0003I New best feasible of 1664.7528 found after 61.418393 sec
 and[[BR]]
 > OA0009I OA  interupted after 61.427386 seconds found solution of value
 1664.7528 (lower bound 1202.6733 ).[[BR]]
 > OA0010I Performed 1 iterations, explored 8154 branch-and-bound nodes in
 total[[BR]]
 > Cbc0031I 37 added rows had average density of 3[[BR]]
 > Cbc0013I At root node, 37 cuts changed objective from 980.6023 to
 980.6023 in 1 passes[[BR]]
 > Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 37 row
 cuts average 3.0 elements, 0 column cuts (0 active)[[BR]]
 > Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0
 row cuts average 0.0 elements, 0 column cuts (0 active)[[BR]]
 > Cbc0014I Cut generator 2 (Outer Approximation strong branching solution
 check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active)[[BR]]
 > Cbc0020I Exiting on maximum time[[BR]]
 > Cbc0005I Partial search - best objective 1e+50 (best possible 980.6023),
 took 37 iterations and 0 nodes (61.19 seconds)[[BR]]
 > Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost[[BR]]
 >  Outer Approximation decomposition. was tried 1 times and created 37
 cuts of which 0 were active after adding rounds of cuts[[BR]]
 > [[BR]]
 > bonmin: Optimization interrupted on limit.[[BR]]
 > [[BR]]
 >       "Not finished"[[BR]]

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