Generalized Nonlinear Lagrangian Formulation for Bounded Integer Programming

Authors:
Yifan Xu;Chunli Liu;Duan Li
Affiliations:
School of Management, Fudan University, Shanghai, China 200433;School of Management, Fudan University, Shanghai, China 200433;Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin, Hong Kong, China
Venue:
Journal of Global Optimization
Year:
2005

Citing 5
Cited 0

Discrete optimization

Discrete optimization
Asymptotic Strong Duality for Bounded Integer Programming: A Logarithmic-Exponential Dual Formulation

Mathematics of Operations Research
Success Guarantee of Dual Search in Integer Programming: p-th Power Lagrangian Method

Journal of Global Optimization
Zero duality gap in integer programming: P-norm surrogate constraint method

Operations Research Letters
A nonlinear Lagrangian dual for integer programming

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several nonlinear Lagrangian formulations have been recently proposed forbounded integer programming problems. While possessing an asymptotic strong dualityproperty, these formulations offer a success guarantee for the identification of an optimalprimal solution via a dual search. Investigating common features of nonlinear Lagrangianformulations in constructing a nonlinear support for nonconvex piecewise constant perturbation function, this paper proposes a generalized nonlinear Lagrangian formulation of which many existing nonlinear Lagrangian formulations become special cases.