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...
Main Author: | |
---|---|
Other Authors: | , |
Format: | conferencePaper |
Language: | eng |
Published: |
2010
|
Subjects: | |
Online Access: | http://hdl.handle.net/1822/16506 |
Country: | Portugal |
Oai: | oai:repositorium.sdum.uminho.pt:1822/16506 |