Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/45710
Title: | Inexact solution of NLP subproblems in MINLP | Authors: | Li, Min Vicente, Luís Nunes |
Issue Date: | 2013 | Publisher: | Springer US | Project: | PEst-C/MAT/UI0324/2011 | Serial title, monograph or event: | Journal of Global Optimization | Volume: | 55 | Issue: | 4 | Abstract: | 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 corresponding master problems can be changed to incorporate the inexact residuals, still rendering equivalence and finiteness in the limit case. Some numerical results will be presented to illustrate the behavior of the methods under NLP subproblem inexactness. | URI: | https://hdl.handle.net/10316/45710 | DOI: | 10.1007/s10898-012-0010-5 | Rights: | embargoedAccess |
Appears in Collections: | I&D CMUC - Artigos em Revistas Internacionais |
Show full item record
SCOPUSTM
Citations
3
checked on Oct 7, 2024
WEB OF SCIENCETM
Citations
10
3
checked on Sep 2, 2024
Page view(s) 50
388
checked on Oct 15, 2024
Download(s)
182
checked on Oct 15, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.