\(p\)th power Lagrangian method for integer programming

DOI10.1023/A:1019252306512zbMath0990.90075WikidataQ57445543 ScholiaQ57445543MaRDI QIDQ5933815

Douglas J. White, Li, Duan

Publication date: 14 June 2001

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

integer programmingLagrangian relaxationduality gap\(p\)th power Lagrangian methodconvexificationprimal-dual approachsurrogate constraint method

Mathematics Subject Classification ID

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

Related Items (15)

Discrete global descent method for discrete global optimization and nonlinear integer programming ⋮ Unnamed Item ⋮ Identifying a global optimizer with filled function for nonlinear integer programming ⋮ Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method ⋮ 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 ⋮ A novel convex dual approach to three-dimensional assignment problem: theoretical analysis ⋮ Discrete filled function method for discrete global optimization ⋮ Towards strong duality in integer programming ⋮ Convergent Lagrangian and domain cut method for nonlinear knapsack problems ⋮ OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION ⋮ 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

This page was built for publication: \(p\)th power Lagrangian method for integer programming