Accession Number : ADA018018

Title :   Optimization for Sparse Systems.

Descriptive Note : Technical rept.,

Corporate Author : MASSACHUSETTS INST OF TECH CAMBRIDGE OPERATIONS RESEARCH CENTER

Personal Author(s) : Magnanti,Thomas L.

Report Date : NOV 1975

Pagination or Media Count : 33

Abstract : Sparse matrices with special structure arise in almost every application of large scale optimization. In linear programming, these problems usually are solved by pivoting procedures, most notably the simplex method, refined and modified in various ways to exploit structure. More recently iterative relaxation methods and dual ascent algorithms have been proposed for certain applications. In surveying several algorithms from each of these categories, this paper demonstrates the potential for investigating and applying sparse system techniques in optimization. (Author)

Descriptors :   *Sparse matrix, *Linear programming, *Simplex method, Network flows, Optimization, Algorithms, Iterations, Relaxation, Computations

Subject Categories : Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE