Abstract
In this paper we consider the question: how does the flow algorithm and the simplex algorithm work? The usual answer has two parts: first a description of the “improvement process”, and second a proof that if no further improvement can be made by this process, an optimal vector has been found. This second part is usually based on duality -a technique not available in the case of an arbitrary integer programming problem. We wish to give a general description of “improvement processes” which will include both the simplex and flow algorithms, which will be applicable to arbitrary integer programming problems, and which will inthemselves assure convergence to a solution.
Geometrically both the simplex algorithm and the flow algorithm may be described as follows. At the ith stage, we have a vertex (or feasible flow) to which is associated a finite set of vectors, namely the set of edges leaving that vertex (or the set of unsaturated paths). The algorithm proceeds by searching among this special set for a vector along which the gain function is increasing. If such a vector is found, the algorithm continues by moving along this vector as far as is possible while still remaining feasible. The search is then repeated at this new feasible point.
We give a precise definition for sets of vectors, called test sets, which will include those sets described above arising in the simplex and flow algorithms. We will then prove that any “improvement process” which searches through a test set at each stage converges to an optimal point in a finite number of steps. We also construct specific test sets which are the natural extensions of the test sets employed by the flow algorithm to arbitrary linear and integer linear programming problems.
Similar content being viewed by others
References
L.R. Ford, Jr. and D.R. Fulkerson,Flows in networks (Princeton University Press).
J.E. Graver, “Maximum depth problem for indecomposable exact covers”, Proceedings of the International Colloquium on Infinite and Finite Sets, Keszthely, Hungary (1973).
J.E. Graver and W.B. Jurkat, “Algebra structures for general designs”,Journal of Algebra 23 (1972) 574–589.
J.E. Graver and W.B. Jurkat, “The module structure of integral designs”,Journal of Combinatorial Theory 15 (1973) 75–90.
F. Huckermann and W.B. Jurkat, “Finiteness theorems for coverings and semi-groups”, to appear.
C.J. Leska, “Covering and matching problems as integer linear programs”, to appear.
W.T. Tutte, “Lectures on Matroids”,Journal of Research of the National Bureau of Standards 69B (1965) 1–49.
Author information
Authors and Affiliations
Additional information
This research was supported in part by the National Science Foundation.
Rights and permissions
About this article
Cite this article
Graver, J.E. On the foundations of linear and integer linear programming I. Mathematical Programming 9, 207–226 (1975). https://doi.org/10.1007/BF01681344
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01681344