Aspects of large-scale in-core linear programming

Authors:
James E. Kalan
Affiliations:
-
Venue:
ACM '71 Proceedings of the 1971 26th annual conference
Year:
1971

Citing 0
Cited 13

Integration of a primal simplex network algorithm with a large-scale mathematical programming system

ACM Transactions on Mathematical Software (TOMS)
PERUSE: An Interactive System for Mathematical Programs

ACM Transactions on Mathematical Software (TOMS)
The Design of the XMP Linear Programming Library

ACM Transactions on Mathematical Software (TOMS)
A Functional Description of ANALYZE: A Computer-Assisted Analysis System for Linear Programming Models

ACM Transactions on Mathematical Software (TOMS)
A Status Report on Computing Algorithms for Mathematical Programming

ACM Computing Surveys (CSUR)
Modeling languages versus matrix generators for linear programming

ACM Transactions on Mathematical Software (TOMS)
Representing super-sparse matrices with perturbed values

Communications of the ACM
The apex systems past and future

ACM SIGMAP Bulletin
Recent and future developments in SPERRY UNIVAC's FMPS product

ACM SIGMAP Bulletin
Data structures in honeywell's MPS/66

ACM SIGMAP Bulletin
Matrix storage schemes in linear programming

ACM SIGMAP Bulletin
Some tactics for 0-1 programming

ACM SIGMAP Bulletin
Representations of networks

AFIPS '76 Proceedings of the June 7-10, 1976, national computer conference and exposition

Quantified Score

Hi-index	0.02

Visualization

Abstract

Unconventional methods for matricial compression indicate that large linear programming constraint matrices may comfortably remain core-resident during optimization. Minor changes in the computational aspects of the simplex algorithm coupled with efficient inverse matrix representation show that the major portion of the inverse in product form of a basis may be embedded in the constraint matrix. A method for generating a sparse inverse matrix is presented.