Scarf's Procedure for Integer Programming and a Dual Simplex Algorithm
AbstractHerbert 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Cowles Foundation for Research in Economics, Yale University in its series Cowles Foundation Discussion Papers with number 649.
Length: 26 pages
Date of creation: 1982
Date of revision:
Publication status: Published in Mathematics of Operations Research (August 1983), 10(3): 403-438
Note: CFP 624b.
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.econ.yale.edu/
More information through EDIRC
Postal: Cowles Foundation, Yale University, Box 208281, New Haven, CT 06520-8281 USA
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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: (Glena Ames).
If references are entirely missing, you can add them using this form.