Paper Info
Title
Asymptotic Strong Duality for Bounded Integer Programming: A Logarithmic-Exponential Dual Formulation
Abstract
A logarithmic-exponential dual formulation is proposed in this paper for bounded integer programming problems. This new dual formulation possesses an asymptotic strong duality property and guarantees the identification of an optimal solution of the primal problem. These prominent features are achieved by exploring a novel nonlinear Lagrangian function, deriving an asymptotic zero duality gap, investigating the unimodality of the associated dual function and ensuring the primal feasibility of optimal solutions in the dual formulation. One other feature of the logarithmicexponential dual formulation is that no actual dual search is needed when parameters are set above certain threshold-values.
Year
DOI
Venue
2000
10.1287/moor.25.4.625.12114
Math. Oper. Res.
Keywords
DocType
Volume
primal feasibility,Asymptotic Strong Duality,Logarithmic-Exponential Dual Formulation,new dual formulation,logarithmicexponential dual formulation,Bounded Integer Programming,optimal solution,actual dual search,dual formulation,logarithmic-exponential dual formulation,asymptotic strong duality property,dual function,novel nonlinear Lagrangian function
Journal
25
Issue
ISSN
Citations 
4
0364-765X
10
PageRank 
References 
Authors
0.84
8
2
Name
Order
Citations
PageRank
Xiaoling Sun18610.89
Duan Li272173.60