Generalized nonlinear Lagrangian formulation for bounded integer programming

DOI10.1007/s10898-004-1942-1zbMath1093.90079OpenAlexW1993321331WikidataQ57445501 ScholiaQ57445501MaRDI QIDQ2583181

Chunli Liu, Li, Duan, Yi-Fan Xu

Publication date: 13 January 2006

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-004-1942-1

zbMATH Keywords

integer programmingLagrangian relaxationnonlinear integer programmingduality gapnonlinear Lagrangian formulation

Mathematics Subject Classification ID

Integer programming (90C10) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Related Items (1)

Zero duality gap in surrogate constraint optimization: a concise review of models

Cites Work

• Unnamed Item
• Zero duality gap in integer programming: \(P\)-norm surrogate constraint method
• A nonlinear Lagrangian dual for integer programming
• Logarithmic-exponential penalty formulation for integer programming
• Duality in mathematics and linear and integer programming
• Asymptotic Strong Duality for Bounded Integer Programming: A Logarithmic-Exponential Dual Formulation
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• A Convergent Duality Theory for Integer Programming
• A Survey of Lagrangean Techniques for Discrete Optimization
• Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method.
• \(p\)th power Lagrangian method for integer programming

This page was built for publication: Generalized nonlinear Lagrangian formulation for bounded integer programming