DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, SL | - |
dc.contributor.author | Kim, S | - |
dc.date.accessioned | 2007-11-07T01:56:41Z | - |
dc.date.available | 2007-11-07T01:56:41Z | - |
dc.date.issued | 1998 | - |
dc.identifier.citation | Journal of optimization theory and applications, v.96 no.2, pp.363-375 | en |
dc.identifier.issn | 0022-3239 | - |
dc.identifier.uri | http://hdl.handle.net/10203/1845 | - |
dc.description.abstract | 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. | en |
dc.language.iso | en_US | en |
dc.publisher | Springer Verlag (Germany) | en |
dc.subject | Integer programming | en |
dc.subject | surrogate dual | en |
dc.subject | nondifferentiable | en |
dc.subject | subgradient method | en |
dc.title | Exact Algorithm for the Surrogate Dual of an Integer Programming Problem: Subgradient Method Approach | en |
dc.type | Article | en |
dc.identifier.doi | 10.1023/A:1022622231801 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.