Short cut computational methods are developed for solving systems whose matrices may be generally described as block triangular.
MLA
Dantzig, George B.. “Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming.” Econometrica, vol. 23, .no 2, Econometric Society, 1955, pp. 174-183, https://www.jstor.org/stable/1907876
Chicago
Dantzig, George B.. “Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming.” Econometrica, 23, .no 2, (Econometric Society: 1955), 174-183. https://www.jstor.org/stable/1907876
APA
Dantzig, G. B. (1955). Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming. Econometrica, 23(2), 174-183. https://www.jstor.org/stable/1907876
By clicking the "Accept" button or continuing to browse our site, you agree to first-party and session-only cookies being stored on your device. Cookies are used to optimize your experience and anonymously analyze website performance and traffic.