A Bounding Minimization Problem for Primal Integer Programming

Larry R. Arnold and Mandell Bellmore
Additional contact information
Larry R. Arnold: Tulane University, New Orleans, Louisiana
Mandell Bellmore: Block, McGibony and Associates, Inc., Silver Spring, Maryland

Operations Research, 1974, vol. 22, issue 2, 383-392

Abstract: Computational experiments with the primal integer programming algorithm indicate that in many cases the optimal value of the objective function is obtained in a very few iterations but a large number of iterations are required to establish optimality; thus, an alternative proof of optimality is needed. This paper describes an algorithm for obtaining an upper bound (such an alternative) on the value of the objective function. This bound is based on the best bound obtainable from dual solutions to a class of related linear programs. Computational results illustrating the effectiveness of this bounding technique are presented.

Date: 1974
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.22.2.383 (application/pdf)

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:inm:oropre:v:22:y:1974:i:2:p:383-392

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().