Asymptotic strong determination in integer programming: Quasi dual method

Yifan Xu

Mathematical Methods of Operations Research, 2003, vol. 57, issue 2, 207-216

Abstract: Although the Lagrangian method is a powerful dual search method in integer programming, it often fail to identify the optimal solution of the primal problem. In this paper, a quasi dual formulation is proposed for bounded integer programming. This formulation possesses an asymptotic strong determination property and guarantees a success for identifying an optimum solution. Its another feature is that no actual dual search is needed when the parameters of the method are set to be large enough. Copyright Springer-Verlag Berlin Heidelberg 2003

Keywords: Key words: Integer programming; Lagrangian relaxation; quasi dual formulation (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860200238 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:57:y:2003:i:2:p:207-216

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860200238

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().