Loading...
Publication
Branch and bound based coordinate search filter algorithm for nonsmooth nonconvex mixed-integer nonlinear programming problems
| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 336.05 KB | Adobe PDF |
Advisor(s)
Abstract(s)
A mixed-integer nonlinear programming problem (MINLP) is a problem with continuous and integer variables and at least, one nonlinear function. This kind of problem appears in a wide range of real applications and is very difficult to solve. The difficulties are due to the nonlinearities of the functions in the problem and the integrality restrictions on some variables. When they are nonconvex then they are the most difficult to solve above all. We present a methodology to solve nonsmooth nonconvex MINLP problems based on a branch and bound paradigm and a stochastic strategy. To solve the relaxed subproblems at each node of the branch and bound tree search, an algorithm based on a multistart strategy with a coordinate search filter methodology is implemented. The produced numerical results show the robustness of the proposed methodology.
Description
Keywords
Nonconvex MINLP Branch and bound Multistart Coordinate search Filter method
Pedagogical Context
Citation
Fernandes, Florbela P.; Costa, Fernanda P.M.;
Fernandes, Edite M.G.P. (2014). Branch and bound based coordinate search filter algorithm for nonsmooth nonconvex mixed-integer nonlinear programming problems. In Murgante, Beniamino [et al.] eds. 14th International Conference on Computational Science and Its Applications, ICCSA 2014. Guimarães. p. 140-153. ISBN 978-3-319-09129-7
Publisher
Springer