Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming
George B. Dantzig
Abstract
Short cut computational methods are developed for solving systems whose matrices may be generally described as block triangular.
Note: to view the fulltext of the article, please login first
and then click the "full content" button. If you are based
at a subscribing Institution or Library or if you have a separate
access to JSTOR/Wiley Online Library please click on the "Institutional access" button.
