Generalized nonlinear Lagrangian formulation for bounded integer programming

DOI10.1007/S10898-004-1942-1MaRDI QIDQ2583181zbMATH OpenOpenAlexWikidataFDO

Authors C. L. Liu, Yifan Xu, Duan Li

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

duality gapinteger programmingLagrangian relaxationnonlinear integer programmingnonlinear Lagrangian formulation

Mathematics Subject Classification ID

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

Recommendations

• A nonlinear Lagrangian dual for integer programming
• Lagrangean decomposition for integer nonlinear programming with linear constraints
• Bounded Lagrange multiplier rules for general nonsmooth problems and application to mathematical programs with equilibrium constraints
• Nonlinear integer programming for various forms of constraints
• Letter to the Editor—A Note on the Generalized Lagrange Multiplier Solution to an Integer Programming Problem
• Parametric formulation of the general integer linear programming problem
• Lagrangian relaxation for integer programming
• Generalized augmented Lagrangian problem and approximate optimal solutions in nonlinear programming
• scientific article; zbMATH DE number 4037607
• scientific article; zbMATH DE number 4141791

Cites work

• pth power Lagrangian method for integer programming
• A Convergent Duality Theory for Integer Programming
• A nonlinear Lagrangian dual for integer programming
• A Survey of Lagrangean Techniques for Discrete Optimization
• Asymptotic strong duality for bounded integer programming: A logarithmic-exponential dual formulation
• Duality in mathematics and linear and integer programming
• scientific article; zbMATH DE number 1795208 (Why is no real title available?)
• Logarithmic-exponential penalty formulation for integer programming
• Success guarantee of dual search in integer programming: p-th power Lagrangian method.
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Zero duality gap in integer programming: \(P\)-norm surrogate constraint method

Cited in

(3)

• A nonlinear Lagrangian dual for integer programming
• Generalized Chvátal-Gomory closures for integer programs with bounds on variables
• Zero duality gap in surrogate constraint optimization: a concise review of models

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

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