Cover: Notes on Linear Programming: Part XLIII

Notes on Linear Programming: Part XLIII

A Feasibility Algorithm for One-Way Substitution in Process Analysis

Published 1957

by Kenneth Arrow, Selmer Martin Johnson


Download Free Electronic Document

FormatFile SizeNotes
PDF file 0.8 MB

Use Adobe Acrobat Reader version 10 or higher for the best experience.


Purchase Print Copy

 Format Price
Add to Cart Paperback15 pages $15.00

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 research memorandum series. The Research Memorandum was a product of RAND from 1948 to 1973 that represented working papers meant to report current results of RAND research to appropriate audiences.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit

RAND 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.