Abstract
This paper describes several algorithms for solution of linear programs. The algorithms are polynomial when the problem data satisfy certain conditions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Agmon, “The relaxation method for linear inequalities”,Canadian Journal of Mathematics 6 (1954) 382–392.
S.A. Cook, “The complexity of theorem proving procedures”, in:Conf. Rec. of 3rd ACM Symposium on Theory of Computing (1970) 151–158.
G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, NJ, 1963).
J. Edmonds, “Paths, trees, and flowers”,Canadian Journal of Mathematics 17 (1965) 449–467.
J. Edmonds, “Systems of distinct representatives and linear algebra”,Journal of Research of the National Bureau of Standards — B 71B (1967) 241–245.
J. Edmonds and R.M. Karp, “Theoretical improvements in algorithmic efficiency for network flow problems”,Journal of the Association for Computing Machinery 19 (1972) 248–264.
A.J. Hoffman and J.B. Kruskal, “Integral boundary points of convex polyhedra”, in: H.W. Kuhn and A.W. Tucker, eds.,Linear inequalities and related systems (Princeton University Press, Princeton, NJ, 1956).
R.G. Jeroslow, “Some relaxation methods for linear inequalities”,Cahiers du Centre d'Études de Recherche Opérationnelle 21 (1979) 43–53.
R.M. Karp, “Reducibility among combinatorial problems”, in: R.E. Miller, et al. eds.,Complexity of computer computations (Plenum Press, New York, 1972).
L.G. Khachijan, “A polynomial algorithm in linear programming”,Soviet Mathematics Doklady 20 (1979) 191–194.
L. Lovász, “Normal hypergraphs and the perfect graph conjecture”,Discrete Mathematics 2 (1972) 253–267.
J.F. Maurras, “Bon algorithmes, vieilles idées”, NoteE.d.F. HR 32.0320, 1978.
J.F. Maurras, “Good algorithms, old ideas”, manuscript, 1978.
T.S. Motzkin and I.J. Schoenberg, “The relaxation method for linear inequalities”,Canadian Journal of Mathematics 6 (1954) 393–404.
P.D. Seymour, “Decomposition of regular matroids”,Journal of Combinatorial Theory(B) 28 (1980) 305–359.
N.Z. Shor, “Convergence rate of the gradient descent method with dilatation of the space”,Cybernetics 6 (1970) 102–108.
A.F. Veinott, Jr. and G.B. Dantzig, “Integral extreme points”,SIAM Review 10 (1968) 371–372.
Author information
Authors and Affiliations
Additional information
The original idea of this paper, first announced in [12], is due to Maurras. The other two authors made a number of improvements, which are now incorporated in the present version. The joint authorship results from a suggestion by Chvátal.
Rights and permissions
About this article
Cite this article
Maurras, J.F., Truemper, K. & Akgül, M. Polynomial algorithms for a class of linear programs. Mathematical Programming 21, 121–136 (1981). https://doi.org/10.1007/BF01584235
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01584235