Dear Udit,<div>You need to provide a function to compute the hessian of your objective function.</div><div>Also as a sanity check it is better to run the model with Ipopt's derivative checker at least once:</div><div><a href="http://www.coin-or.org/Ipopt/documentation/node53.html">http://www.coin-or.org/Ipopt/documentation/node53.html</a></div>
<div><br></div><div><a href="http://www.coin-or.org/Ipopt/documentation/node53.html"></a>Best,</div><div>Pierre<br><br><div class="gmail_quote">On Sat, Dec 11, 2010 at 9:50 AM, Udit Kumar <span dir="ltr"><<a href="mailto:udit.vlsi@gmail.com">udit.vlsi@gmail.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;"><div>Hi Friends/Seniors,</div>
<div> </div>
<div>I am new to the COIN-OR/BONMIN library, I just started playing it. </div>
<div> </div>
<div>I am trying to solve pure integer problem without any constraints (only upper and lower limit of variable are defined). </div>
<div> </div>
<div>So I did modification in "MyTMINLP.cpp" file and when I am trying to solve my problem it is giving me that "Ipopt has failed to solve a problem", but I see last function evaluation was the solution of my problem, then why "ipopt" is having difficulty to understand it.. </div>
<div> </div>
<div>I attached my modified file for your reference, Please help me. I will be very thankful of you.</div>
<div> </div>
<div> </div>
<div> </div>
<div><strong>Message shown during the run</strong></div>
<div>******************************************************************************<br>This program contains Ipopt, a library for large-scale nonlinear optimization.<br> Ipopt is released as open source code under the Common Public License (CPL).<br>
For more information visit <a href="http://projects.coin-or.org/Ipopt" target="_blank">http://projects.coin-or.org/Ipopt</a><br>******************************************************************************</div>
<div>NOTE: You are using Ipopt by default with the MUMPS linear solver.<br> Other linear solvers might be more efficient (see Ipopt documentation).</div>
<div><br>point : (0.500000, 0.500000, 0.500000, 0.500000, 0.500000, 0.500000, 0.500000, 0.500000, 0.500000, 0.500000), obj_val : 3.181981<br>point : (0.252500, 0.005000, 0.005000, 0.005000, 0.005000, 0.005000, 0.005000, 0.005000, 0.005000, 0.252500), obj_val : 0.127879<br>
point : (0.055042, 0.000050, 0.000050, 0.000050, 0.000050, 0.000050, 0.000050, 0.000050, 0.000050, 0.055042), obj_val : 0.006059<br>point : (0.000550, 0.000012, 0.000012, 0.000012, 0.000012, 0.000012, 0.000012, 0.000012, 0.000012, 0.000550), obj_val : 0.000001<br>
point : (0.000025, 0.000000, 0.000000, 0.000000, 0.000000, 0.000000, 0.000000, 0.000000, 0.000000, 0.000025), obj_val : 0.000000<br>point : (0.000000, -0.000000, -0.000000, -0.000000, -0.000000, -0.000000, -0.000000, -0.000000, -0.000000, 0.000000), obj_val : 0.000000<br>
Problem status: 4<br>Objective value: 1.79769e+308<br>Ipopt has failed to solve a problem<br></div>
<div> </div>
<div>Thanks & Regards,</div>
<div>Udit Kumar</div><font color="#888888">
<div>MS(R) Student, IIT delhi, India</div>
</font><br>_______________________________________________<br>
Bonmin mailing list<br>
<a href="mailto:Bonmin@list.coin-or.org">Bonmin@list.coin-or.org</a><br>
<a href="http://list.coin-or.org/mailman/listinfo/bonmin" target="_blank">http://list.coin-or.org/mailman/listinfo/bonmin</a><br>
<br></blockquote></div><br></div>