Research Reports from the Department of Operations
Document Type
Report
Publication Date
4-1-1973
Abstract
It is shown that an initial all integer tableau is not necessary to the convergence of primal all-integer integer programming algorithms. It is well known that an analogous result holds for Gomory's dual all integer method, where only the cost row is required to be integer. We also show that the cost row need not be integer for the convergence of Gomory's dual all integer method.
Keywords
Integer programming, Algorithms, Mathematical optimization, Computational complexity, Operations research
Publication Title
Technical Memorandums from the Department of Operations, School of Management, Case Western Reserve University
Issue
Technical memorandum no. 298
Rights
This work is in the public domain and may be freely downloaded for personal or academic use
Recommended Citation
Salkin, Harvey M.; Mehta, Shailesh J.; and Shroff, Pradip H., "All-Integer Integer Programming Algorithms Applied to Tableaux with Rational Coefficients" (1973). Research Reports from the Department of Operations. 14.
https://commons.case.edu/wsom-ops-reports/14