Updated triangular factors of the working basis in winkler's decomposition approach

December 1979, Volume 17, Issue 1, pp 391–397 | Cite as

Short Communication

Received: 27 February 1978

Revised: 06 October 1978

Key words

Decomposition Forrest-Tomlin Update Large Scale LP Linear Programming Triangular Factors

This is a preview of subscription content, to check access.

Unable to display preview. Download preview PDF.

[1]
M. Bastian, “Basisfaktorisierung bei dünn besetzten strukturierten Koeffizientenmatrizen”, in: R. Henn et al., eds.,Operations Research Verfahren XXVIII (Hain, Meisenheim, 1978) pp. 299–315.Google Scholar
[2]
M. Benichou, J.M. Gauthier, G. Hentges and G. Ribière, “The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results”,Mathematical Programming 13 (1977) 280–322.Google Scholar
[3]
J.J.H. Forrest and J.A. Tomlin, “Updated triangular factors of the basis to maintain sparsity in the product form simplex method”,Mathematical Programming 2 (1972) 263–278.Google Scholar
[4]
J.A. Tomlin, “Modifying triangular factors of the basis in the simplex method”, in: D.J. Rose and R.A. Willoughby, eds.,Sparse matrices and their applications (Plenum Press, New York, 1972) pp. 77–85.Google Scholar
[5]
C. Winkler: “Basis factorization for block-angular linear programs: unified theory of partitioning and decomposition using the simplex method”, Tech. Rept. SOL 74-19, Department of Operations Research, Stanford University, Stanford (1974).Google Scholar