Fwd: [Bonmin] can ipopt suply the global solution or not?

[Pierre Bonami]

Hello,
It depends what you means by convex constraints. What we call a convex
constraint is a constraint such that the feasible region it describes is
convex. In the case of an equality constraint it implies that the constraint
is linear.

For the parameters, you should describe more precisely what is not working.
Maybe then we can find out what the problem is.

Best regards,
Pierre

On 10/10/07, Hui Ma <mahui at gmx.de> wrote:
>
> hallo,
>
> I'm writing my master thesis now. The task is to solve a mixed integer
> reverse convex problem. My question is whether ipopt suply a global solution
> or not when the objective function and constraint functions are all convex,
> and with equality constraints? Moreover I want to set the value of some
> parameters in Bomin in order to break off the program before, but it does
> not work. Can you tell me the reason?
>
> sincerely yours,
> maya
> --
> GMX FreeMail: 1 GB Postfach, 5 E-Mail-Adressen, 10 Free SMS.
> Alle Infos und kostenlose Anmeldung: http://www.gmx.net/de/go/freemail
> _______________________________________________
> Bonmin mailing list
> Bonmin at list.coin-or.org
> http://list.coin-or.org/mailman/listinfo/bonmin
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://list.coin-or.org/pipermail/bonmin/attachments/20071013/575b2621/attachment.html