Abstract
We consider here a linear programming problem whose rows of the constraint matrix can be partitioned into two parts. Such natural partitions exist in several special linear programs, including the assignment problem, the transportation problem, the generalized upper-bounded variable problem, the block diagonal linear program; and can also be used to induce sparsity patterns in Cholesky factorizations. In this paper, we propose a matrix partitioning method for interior point algorithms. The proposed method independently generates Cholesky factorizations of each part, and reduces the complexity to that of solving generally, a dense linear system involving several rank one updates of the identity matrix. Here, we propose solving this linear system by an inductive use of the Sherman-Morrison-Woodbury formula. The proposed method is easily implemented on a vector, parallel machine as well as on a distributed system. Such partitioning methods have been popular in the context of the simplex method, where the special structure of the basis matrix is exploited.
Similar content being viewed by others
References
Barnes E R 1986 A variation of Karmarkar’s algorithm for solving linear programming problems.Math. Program. 36: 174–182
Fang S C, Puthenpura S 1997Linear optimization and extensions (Englewood Cliffs, NJ: Prentice Hall) (in press)
George A, Liu J W 1981Computer solution of large positive definite systems (Englewood Cliffs, NJ: Prentice Hall)
Karmarkar N 1984 A new polynomial time algorithm for linear programmingCombinatorica 4: 373–395
Kojima M, Mizuno S, Yoshise A 1989 A primal-dual interior point method for linear programming. InProgress in mathematical programming: Interior point methods (ed.) N Megiddo (New York: Springer-Verlag) pp 29–48
Lasdon L S 1970Optimization theory for large systems (London: Macmillan)
Vanderbei R J 1992 LOQO user’s manual. Program in statistics and operations research. Princeton University, Princeton, NJ
Vanderbei R J, Meketon M S, Freedman B A 1986 A modification of Karmarkar linear programming algorithm.Algorithmatica 1: 395–407
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Saigal, R. Matrix partitioning methods for interior point algorithms. Sadhana 22, 575–587 (1997). https://doi.org/10.1007/BF02745580
Issue Date:
DOI: https://doi.org/10.1007/BF02745580