Inexact solution of NLP subproblems in MINLP
In the context of convex mixed integer nonlinear programming (MINLP), we investigate how the outer approximation method and the generalized Benders decomposition method are affected when the respective nonlinear programming (NLP) subproblems are solved inexactly. We show that the cuts in the corresp...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2013
|
| Texto completo: | http://hdl.handle.net/10316/45710 |
| País: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/45710 |