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

DOI10.1287/moor.25.4.625.12114zbMath0977.90028OpenAlexW2013013787WikidataQ57445544 ScholiaQ57445544MaRDI QIDQ2757656

Li, Duan, Xiaoling Sun

Publication date: 26 November 2001

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

Full work available at URL: https://doi.org/10.1287/moor.25.4.625.12114

zbMATH Keywords

integer programmingnonlinear integer programmingduality theorystrong dualityprimal feasibilitylogarithmic-exponential dual formulation

Mathematics Subject Classification ID

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

Related Items (11)

Discrete global descent method for discrete global optimization and nonlinear integer programming ⋮ Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method ⋮ General exact penalty functions in integer programming ⋮ Discrete filled function method for discrete global optimization ⋮ Exact penalty function and asymptotic strong nonlinear duality in integer programming ⋮ 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 ⋮ 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: Asymptotic Strong Duality for Bounded Integer Programming: A Logarithmic-Exponential Dual Formulation