Skip to main content
Log in

Generalized Nonlinear Lagrangian Formulation for Bounded Integer Programming

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. D.E. Bell J.F. Shapiro (1977) ArticleTitleA convergent duality theory for integer programming Operations Research 25 419–434

    Google Scholar 

  2. M.L. Fisher (1981) ArticleTitleThe Lagrangian relaxation method for solving integer programming problems Management Sciences 27 1–18

    Google Scholar 

  3. A.M. Geoffirion (1974) ArticleTitleLagrangian relaxation for integer programming Mathematical Programming Studies 2 82–114

    Google Scholar 

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

    Article  Google Scholar 

  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

    Article  Google Scholar 

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

    Article  Google Scholar 

  7. R.G. Parker R.L. Rardin (1988) Discrete Optimization Academic Press Boston

    Google Scholar 

  8. J.F. Shapiro (1979) ArticleTitleA survey of Lagrangian techniques for discrete optimization Annals of Discrete Mathematics 5 113–138

    Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  11. H.P. Williams (1996) ArticleTitleDuality in mathematics and integer programming JOTA 90 257–278 Occurrence Handle10.1007/BF02189998

    Article  Google Scholar 

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

    Article  Google Scholar 

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

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yifan Xu.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-004-1942-1

Keywords

Navigation