Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach

Cited 5 time in webofscience Cited 0 time in scopus
  • Hit : 243
  • Download : 0
One of the critical issues in the effective use of surrogate relaxation for an integer programming problem is how to solve the surrogate dual within a reasonable amount of computational time. In this paper, we present an exact and efficient algorithm for solving the surrogate dual of an integer programming problem. Our algorithm follows the approach which Sarin et al. (Ref. 8) introduced in their surrogate dual multiplier search algorithms. The algorithms of Sarin et al. adopt an ad-hoc stopping rule in solving subproblems and cannot guarantee the optimality of the solutions obtained. Our work shows that this heuristic nature can actually be eliminated. Convergence proof for our algorithm is provided. Computational results show the practical applicability of our algorithm.
Publisher
PLENUM PUBL CORP
Issue Date
1998-02
Language
English
Article Type
Article
Keywords

OPTIMIZATION

Citation

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, v.96, no.2, pp.363 - 375

ISSN
0022-3239
DOI
10.1023/A:1022622231801
URI
http://hdl.handle.net/10203/75541
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 5 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0