Zero duality gap in integer programming: \(P\)-norm surrogate constraint method

DOI10.1016/S0167-6377(99)00039-5zbMath0973.90051WikidataQ57445554 ScholiaQ57445554MaRDI QIDQ1807931

Li, Duan

Publication date: 24 November 1999

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

zbMATH Keywords

integer programmingduality gapsaddle pointsurrogate constraint method\(p\)-norm surrogate constraint method

Mathematics Subject Classification ID

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

Related Items (10)

Comment on A nonlinear Lagrangian dual for integer programming. ⋮ On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints ⋮ Zero duality gap in surrogate constraint optimization: a concise review of models ⋮ Exact penalty function and asymptotic strong nonlinear duality in integer programming ⋮ Towards strong duality in integer programming ⋮ On the existence of duality gaps for mixed integer programming ⋮ Strong duality in optimization: shifted power reformulation ⋮ Distance confined path problem and separable integer programming ⋮ Generalized nonlinear Lagrangian formulation for bounded integer programming ⋮ A nonlinear Lagrangian dual for integer programming

Cites Work

• Unnamed Item
• Unnamed Item
• Zero duality gap for a class of nonconvex optimization problems
• Some relationships between lagrangian and surrogate duality in integer programming
• Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Surrogate Constraints in Integer Programming
• Quasi-Convex Programming
• Surrogate Mathematical Programming

This page was built for publication: Zero duality gap in integer programming: \(P\)-norm surrogate constraint method