Optimization Online


Inexact solution of NLP subproblems in MINLP

L. Min(limin***at***mat.uc.pt)
L. N. Vicente(lnv***at***mat.uc.pt)

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 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.

Keywords: Mixed integer nonlinear programming, outer approximation, generalized Benders decomposition, inexactness, convexity.

Category 1: Integer Programming ((Mixed) Integer Nonlinear Programming )

Citation: preprint 11-12, Dept. Mathematics, Univ. Coimbra

Download: [PDF]

Entry Submitted: 04/15/2011
Entry Accepted: 04/15/2011
Entry Last Modified: 04/15/2011

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society