Asymptotic strong determination in integer programming: Quasi dual method

DOI10.1007/S001860200238zbMATH Open1023.90042OpenAlexW2084637284MaRDI QIDQ1395370FDOQ1395370

Authors Yifan Xu 

Publication date 26 June 2003

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s001860200238

zbMATH Keywords

integer programmingLagrangian relaxationquasi dual formulation

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2177241
• Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method.
• scientific article; zbMATH DE number 2177407
• scientific article; zbMATH DE number 2135425
• Asymptotic strong duality for bounded integer programming: A logarithmic-exponential dual formulation

Cited in

(2)

• Multiple cost coefficients sensitivity theorems of integer linear optimization
• Title not available (Why is no real title available?)

This page was built for publication: Asymptotic strong determination in integer programming: Quasi dual method

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