Generalized nonlinear Lagrangian formulation for bounded integer programming

Generalized nonlinear Lagrangian formulation for bounded integer programming

0.00 Avg rating0 Votes
Article ID: iaor2006998
Country: Germany
Volume: 33
Issue: 2
Start Page Number: 257
End Page Number: 272
Publication Date: Oct 2005
Journal: Journal of Global Optimization
Authors: , ,
Keywords: duality
Abstract:

Several nonlinear Lagrangian formulations have been recently proposed for bounded integer programming problems. While possessing an asymptotic strong duality property, these formulations offer a success guarantee for the identification of an optimal primal solution via a dual search. Investigating common features of nonlinear Lagrangian formulations in constructing a nonlinear support for nonconvex piecewise constant perturbation function, this paper proposes a generalized nonlinear Lagrangian formulation of which many existing nonlinear Lagrangian formulations become special cases.

Reviews

Required fields are marked *. Your email address will not be published.