Scarf's Procedure for Integer Programming and a Dual Simplex Algorithm
Herbert Scarf has recently introduced an algorithm for integer programs based on the concept of primitive sets. We show that as the choice variables become continuous, this algorithm converges to a dual simplex algorithm. This result is robust in the sense that even before the limit is reached, the simplex path is contained in the primitive sets which define Scarf's path to the solution of the integer program.
|Date of creation:||1982|
|Date of revision:|
|Publication status:||Published in Mathematics of Operations Research (August 1983), 10(3): 403-438|
|Contact details of provider:|| Postal: Yale University, Box 208281, New Haven, CT 06520-8281 USA|
Phone: (203) 432-3702
Fax: (203) 432-6167
Web page: http://cowles.yale.edu/
More information through EDIRC
|Order Information:|| Postal: Cowles Foundation, Yale University, Box 208281, New Haven, CT 06520-8281 USA|
When requesting a correction, please mention this item's handle: RePEc:cwl:cwldpp:649. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Matthew C. Regan)
If references are entirely missing, you can add them using this form.