BONMIN

GAMS
1

I use the GAMS/BONMIN for solving a MINLP problem. My problem should
be maximized. This solver just shows upper bound (dual) in its default
output. I want to see the lower bound of the problem (primal) in
limited time. How can i get this output?

\

2

Their site says:

“Bonmin is an experimental open-source C++ code for solving general MINLP (Mixed Integer NonLinear Programming) problems”

Maybe it’s not fully operational yet…

On Thu, Mar 15, 2012 at 10:07, hossein karimi wrote:

I use the GAMS/BONMIN for solving a MINLP problem. My problem should
be maximized. This solver just shows upper bound (dual) in its default
output. I want to see the lower bound of the problem (primal) in
limited time. How can i get this output?

–
To post to this group, send email to gamsworld@googlegroups.com.
To unsubscribe from this group, send email to gamsworld+unsubscribe@googlegroups.com.
For more options, visit this group at http://groups.google.com/group/gamsworld?hl=en.



\

Aut Viam Inveniam Aut Faciam

–
To post to this group, send email to gamsworld@googlegroups.com.
To unsubscribe from this group, send email to gamsworld+unsubscribe@googlegroups.com.
For more options, visit this group at http://groups.google.com/group/gamsworld?hl=en.

3

I am also interested in finding fully operational (not experimental)
system for modeling and solver for solving MINLP (non convex,
heuristic).
Can anybody suggest any software or web page with information?
What about python and Pyomo?

Thanks in advance for any help.
John


On 1 Maj, 17:32, Michael Stavropoulos wrote:

Their site says:

“Bonmin is an experimental open-source C++ code for solving general MINLP
(Mixed Integer NonLinear Programming) problems”

Maybe it’s not fully operational yet…


\

4

The NEOS system (www.neos-guide.org) has some information on a number of solvers and allows you to try them out, even using GAMS or AMPL input formats.

On May 8, 2012, at 12:50 AM, John Oksz wrote:

I am also interested in finding fully operational (not experimental)
system for modeling and solver for solving MINLP (non convex,
heuristic).
Can anybody suggest any software or web page with information?
What about python and Pyomo?

Thanks in advance for any help.
John

On 1 Maj, 17:32, Michael Stavropoulos wrote:

Their site says:

“Bonmin is an experimental open-source C++ code for solving general MINLP
(Mixed Integer NonLinear Programming) problems”

Maybe it’s not fully operational yet…

–
To post to this group, send email to gamsworld@googlegroups.com.
To unsubscribe from this group, send email to gamsworld+unsubscribe@googlegroups.com.
For more options, visit this group at http://groups.google.com/group/gamsworld?hl=en.


\