Notes on Linear Programming: Part XLIII
A Feasibility Algorithm for One-Way Substitution in Process Analysis
Download
Download Free Electronic Document
Format | File Size | Notes |
---|---|---|
PDF file | 0.8 MB | Use Adobe Acrobat Reader version 10 or higher for the best experience. |
Purchase
Purchase Print Copy
Format | List Price | Price | |
---|---|---|---|
Add to Cart | Paperback15 pages | $15.00 | $12.00 20% Web Discount |
A proof that an algorithm for the most efficient assignment of machines to tasks solves an equivalent linear-programming problem. The study assumes that with a certain number of machines (not all of the same capability) with which to do a certain number of tasks (not all of the same difficulty), it is better to use a more capable machine for a more difficult task.
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.