A nonlinear Lagrangian dual for integer programming

DOI10.1016/S0167-6377(02)00166-9zbMath1013.90098WikidataQ57445520 ScholiaQ57445520MaRDI QIDQ1870020

Yi-Fan Xu, Li, Duan

Publication date: 4 May 2003

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

integer programmingLagrangian relaxationdual methodnonlinear Lagrangian theory

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (2)

Comment on A nonlinear Lagrangian dual for integer programming. ⋮ Generalized nonlinear Lagrangian formulation for bounded integer programming

Cites Work

• Lagrangean decomposition for integer nonlinear programming with linear constraints
• Local saddle points and convexification for nonconvex optimization problems
• A sufficient and necessary condition for nonconvex constrained optimization
• Lagrangean methods for 0-1 quadratic problems
• Value-estimation function method for constrained global optimization
• Zero duality gap in integer programming: \(P\)-norm surrogate constraint method
• Zero duality gap for a class of nonconvex optimization problems
• Duality in mathematics and linear and integer programming
• Asymptotic Strong Duality for Bounded Integer Programming: A Logarithmic-Exponential Dual Formulation
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• Optimization of system reliability: a survey of problems and techniques†
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A nonlinear Lagrangian dual for integer programming