Abstract
Improvements to Hacijan's polynomial-time algorithm in linear programming are described. New iteration formulas are given and proved. The algorithm has been implemented in a version of the MACSYMA system on the VAX-11 known as VAXIMA. The implementation is described. Data from computer experiments are included and they indicate (a) the substantial improvement over the original algorithm and (b) the difficulty in making any Hacijan-type algorithm competitive with the simplex algorithm.
Research supported in part by the National Science Foundation and in part by the U.S. Department of Energy.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
N. Anderson and P. Wang, "MACSYMA experiments with a modified Khachiyan-type algorithm in linear programming", ACM SIGSAM Bulletin, February 1980, pp. 8–13.
B. Aspvall and R. E. Stone, "Khachiyan's Linear Programming Algorithm", Journal of Algorithms, Vol. 1, 1980, pp. 1–13.
G. B. Dantzig, "Khachiyan's Algorithm: a comment by George Dantzig", SIAM NEWS, Vol. 13, No. 5, October 1980.
G. B. Dantzig, "Expected Number of Steps of the Simplex Method for a Linear Program with a Convexity Constraint", Technical Report SOL 80-3, Systems Optimization Laboratory, Department of Operations Research, Stanford University, March 1980.
R. J. Fateman, "The Macsyma ‘Big-Floating-Point" Arithmetic System", Proceedings, ACM SYMSAC '76 Conference, Yorktown Heights, N.Y., August 10–12, 1976, pp. 209–213.
J. K. Foderaro and R. J. Fateman, "Characterization of VAX Macsyma", Proceedings, ACM SYMSAC '81 Conference, Snowbird, Utah, August 5–7, 1981, pp. 14–19.
P. Gill, W. Murray, M. Saunders and M. Wright, "A Numerical Investigation of Ellipsoid Algorithms for Large-Scale Linear Programming", Technical Report, SOL 80-27, Department of Operations Research, Stanford University, 1980.
L. G. Hacijan, "A Polynomial Algorithm in Linear Programming", Soviet Math. Dokl. Vol. 20(1979), No. 1.
J. Hopcraft, "Recent Directions in Algorithmic Research", Springer Lecture Notes in Computer Science, Vol. 104, 1981, pp. 123–134.
R. M. Karp, "Complexity of Computer Computations", (Proceedings, Sympos., IBM Thomas J. Watson Research Ctr., Yorktown Heights, N.Y., 1972) Plenum Press, New York, 1972, p. 85.
V. Klee and G. J. Minty, "How Good is the Simplex Algorithm?". Inequalities III, ed. O. Shisha, Academic Press, N.Y., 1972.
P. Wolfe, "A Bibliography for the Ellipsoid Algorithm", IBM Research Center Report No. 8237 (Apr. 1980).
Math Lab Group, MACSYMA Reference Manual, version 9, LCS, MIT, Cambridge, Mass. 1977.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, P.S. (1982). Hacijan's algorithm in VAXIMA: improvements and difficulties. In: Calmet, J. (eds) Computer Algebra. EUROCAM 1982. Lecture Notes in Computer Science, vol 144. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11607-9_16
Download citation
DOI: https://doi.org/10.1007/3-540-11607-9_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11607-3
Online ISBN: 978-3-540-39433-4
eBook Packages: Springer Book Archive