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.
Similar content being viewed by others
References
D.E. Bell J.F. Shapiro (1977) ArticleTitleA convergent duality theory for integer programming Operations Research 25 419–434
M.L. Fisher (1981) ArticleTitleThe Lagrangian relaxation method for solving integer programming problems Management Sciences 27 1–18
A.M. Geoffirion (1974) ArticleTitleLagrangian relaxation for integer programming Mathematical Programming Studies 2 82–114
D. Li (1999) ArticleTitleZero duality gap in integer programming: p-norm surrogate constraint method Operations Research Letter 25 89–96 Occurrence Handle10.1016/S0167-6377(99)00039-5
D. Li X.L. Sun (2000) ArticleTitleSuccess guarantee of dual search in integer programming: p-th power Lagrangian method Journal of Global Options 18 235–254 Occurrence Handle10.1023/A:1008325116400
D. Li D.J. White (2000) ArticleTitlep-th power Lagrangian method for integer programming Annuals of Operations Research 98 151–170 Occurrence Handle10.1023/A:1019252306512
R.G. Parker R.L. Rardin (1988) Discrete Optimization Academic Press Boston
J.F. Shapiro (1979) ArticleTitleA survey of Lagrangian techniques for discrete optimization Annals of Discrete Mathematics 5 113–138
X.L. Sun D. Li (1999) ArticleTitleLogarithmic-exponential penalty formula for integer programming Applied Mathematics Letter 12 73–77 Occurrence Handle10.1016/S0893-9659(99)00104-4
X.L. Sun D. Li (2000) ArticleTitleAsymptotic strong duality for bounded integer programming: A logarithmic-exponential dual formulation Math OR 25 625–644 Occurrence Handle10.1287/moor.25.4.625.12114
H.P. Williams (1996) ArticleTitleDuality in mathematics and integer programming JOTA 90 257–278 Occurrence Handle10.1007/BF02189998
Y.F. Xu D. Li (2002) ArticleTitleA non-linear Lagrangian dual for integer programming Operations Research Letter 30 401–407 Occurrence Handle10.1016/S0167-6377(02)00166-9
Yang, X.Q. and Goh, C.J. (2001), A nonlinear Lagrangian function for discrete optimization problems, In:Proceedings of the Workshop “From Local to Global Optimization”, Kluwer Academic Publishers, Dordrecht pp. 291–304.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Xu, Y., Liu, C. & Li, D. Generalized Nonlinear Lagrangian Formulation for Bounded Integer Programming. J Glob Optim 33, 257–272 (2005). https://doi.org/10.1007/s10898-004-1942-1
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10898-004-1942-1