Overseas network planning, Proceedings of the Third International Network Planning Symposium { NETWORKS'86, pp. 8.2.1{8.2.4. 31. R.E. Tarjan, Data structures and network algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983. 32. M.J. Todd, The e ects of degeneracy and unbounded variables on variants of Karmarkar's linear programming algorithm, Large-scale Numerical Optimization (T.F. Coleman and Y. L, eds.), SIAM, pp. 81{91. 33. M.J. Todd and B.P. Burrell, An extension to Karmarkar's algorithm for linear programming using dual variables, Algorithmica 1 (1986), 409{424. 34. T. Tsuchiya and M. Muramatsu, Global convergence of the long-step a ne scaling algorithm for degenerate linear programming problems, Tech. report, The Institute of Statistical Mathematics, Tokyo, January 1992. 35. P.M. Vaidya, Solving linear equations with symmetric diagonally dominant matrices by constructing good preconditioners, Tech. report,
This paper describes data structures and programming techniques used in an implementation of Karmarkar's algorithm for linear programming. Most of our discussion focuses on applying Gaussian elimination toward the solution of a sequence of sparse symmetric positive definite systems of linear equations, the main requirement in Karmarkar's algorithm. Our approach relies on a direct factorization scheme, with an extensive symbolic factorization step performed in a preparatory stage of the linear programming algorithm. An interpretative version of Gaussian elimination makes use of the symbolic information to perform the actual numerical computations at each iteration of algorithm. We also discuss ordering algorithms that attempt to reduce the amount of fill-in in the LU factors, a procedure to build the linear system solved at each iteration, the use of a dense window data structure in the Gaussian elimination method, a preprocessing procedure designed to increase the sparsity of the linear programming coefficient matrix, and the special treatment of dense columns in the coefficient matrix. INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.