pth power Lagrangian method for integer programming

DOI10.1023/A:1019252306512MaRDI QIDQ5933815zbMATH OpenWikidataFDO

Authors Duan Li, D. J. White

Publication date 14 June 2001

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

Full work available at URL https://doi.org/10.1023/A:1019252306512

zbMATH Keywords

integer programmingduality gapconvexificationLagrangian relaxationprimal-dual approachsurrogate constraint method\(p\)th power Lagrangian method

Mathematics Subject Classification ID

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

Recommendations

• Lagrangian relaxation for integer programming
• scientific article; zbMATH DE number 3858858
• scientific article; zbMATH DE number 3614502
• Success guarantee of dual search in integer programming: p-th power Lagrangian method.
• Lagrangean decomposition for integer programming : theory and applications
• Dantzig-Wolfe and Lagrangian decompositions in integer linear programming
• About Lagrangian methods in integer optimization
• A nonlinear Lagrangian dual for integer programming
• Lagrangean decomposition for integer nonlinear programming with linear constraints
• Lagrangean Decomposition In Integer Linear Programming: A New Scheme

Cited in

(17)

• On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints
• Success guarantee of dual search in integer programming: p-th power Lagrangian method.
• Discrete global descent method for discrete global optimization and nonlinear integer programming
• A novel convex dual approach to three-dimensional assignment problem: theoretical analysis
• Monotonic optimization techniques for solving knapsack problems
• OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION
• Generalized nonlinear Lagrangian formulation for bounded integer programming
• Discrete filled function method for discrete global optimization
• Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method
• Convergent Lagrangian and domain cut method for nonlinear knapsack problems
• A nonlinear Lagrangian dual for integer programming
• Letter to the Editor—A Note on the Generalized Lagrange Multiplier Solution to an Integer Programming Problem
• Distance confined path problem and separable integer programming
• Identifying a global optimizer with filled function for nonlinear integer programming
• Zero duality gap in surrogate constraint optimization: a concise review of models
• Strong duality in optimization: shifted power reformulation
• Towards strong duality in integer programming

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5933815)