ISSN:
1436-4646
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract A unifying concept for large-scale linear programming is developed. This approach, calledfactorization, allows one to isolate the effect of different types of constraints and variables in the algebraic representation of the tableau. Two different factorizations based on a double representation of the tableau are developed. These factorizations are applied to obtain the essential structure of efficient algorithms for generalized upper bounding, coupled block-diagonal problems, set partitioning LPs, minimum cost network flows, and other classes of problems.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01580655
Permalink