Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Matrix storage schemes in linear programming

Matrix storage schemes in linear programming This report investigates alternative methods of compactly storing the coefficient matrix of a linear programming problem. Details of the data to be stored, including column headers, are given together with descriptions of sparse and super-sparse schemes of storage. Particular emphasis is given to the concept of machine independence in the implementation of these schemes with a view to the development of all-in-core LP systems. Ten representative problems of widely varying sizes and a selection of computers with different word and character lengths are used to compare the efficiency of the storage schemes. It is shown that the methods based on super-sparsity usually lead to large savings in storage requirements. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGMAP Bulletin Association for Computing Machinery

Matrix storage schemes in linear programming

ACM SIGMAP Bulletin , Volume (32) – Apr 1, 1983

Loading next page...
 
/lp/association-for-computing-machinery/matrix-storage-schemes-in-linear-programming-b2UYNVNjoo
Publisher
Association for Computing Machinery
Copyright
Copyright © 1983 by ACM Inc.
ISSN
0163-5786
DOI
10.1145/1111272.1111275
Publisher site
See Article on Publisher Site

Abstract

This report investigates alternative methods of compactly storing the coefficient matrix of a linear programming problem. Details of the data to be stored, including column headers, are given together with descriptions of sparse and super-sparse schemes of storage. Particular emphasis is given to the concept of machine independence in the implementation of these schemes with a view to the development of all-in-core LP systems. Ten representative problems of widely varying sizes and a selection of computers with different word and character lengths are used to compare the efficiency of the storage schemes. It is shown that the methods based on super-sparsity usually lead to large savings in storage requirements.

Journal

ACM SIGMAP BulletinAssociation for Computing Machinery

Published: Apr 1, 1983

There are no references for this article.