Numerical experiments with nonconvex MINLP problems
We present a methodology to solve nonconvex Mixed-Integer Nonlinear Programming problems, that combines the Branch-and-Bound and simulated annealing type methods, which was implemented in MATLAB. A set of benchmark functions with simple bounds and different dimensions was used to analyze its practic...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | conferenceObject |
| Idioma: | eng |
| Publicado em: |
2010
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10198/2792 |
| País: | Portugal |
| Oai: | oai:bibliotecadigital.ipb.pt:10198/2792 |