Numerical Experiments with Nonconvex MINLP Problems
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 practical behaviour. We exhibit computational results showing the good âŚ