An algorithm for scaling matrices: notes on linear programming and extensions-part 58.

by D. R. Fulkerson, Philip S. Wolfe

Purchase Print Copy

 FormatList Price Price
Add to Cart Paperback25 pages $20.00 $16.00 20% Web Discount

An algorithm for optimal "matrix scaling"- multiplying rows and columns of a rectangular matrix by different factors so as to optimize its condition. The method is expected to improve the compu-tational solution of linear programming problems.

This report is part of the RAND Corporation research memorandum series. The Research Memorandum was a product of the RAND Corporation from 1948 to 1973 that represented working papers meant to report current results of RAND research to appropriate audiences.

The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.