The decomposition algorithm for linear programming: notes on linear programming and extensions-part 57.

by George Bernard Dantzig, Philip S. Wolfe

Purchase Print Copy

 FormatList Price Price
Add to Cart Paperback33 pages $15.00 $12.00 20% Web Discount

A procedure for the efficient computational solution of linear programs having a certain structural property characteristic of a large class of problems of practical interest. This property makes possible the decomposition of the problem into a sequence of small linear programs whose iterated solutions solve the given problem through a generalization of the simplex method for linear programming.

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.