You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Programming of Interdependent Activities: II Mathematical Model
George B. Dantzig
Vol. 17, No. 3/4 (Jul. - Oct., 1949), pp. 200-211
Published by: The Econometric Society
Stable URL: http://www.jstor.org/stable/1905523
Page Count: 12
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
Activities (or production processes) are considered as building blocks out of which a technology is constructed. Postulates are developed by which activities may be combined. The main part of the paper is concerned with the discrete type model and the use of a linear maximization function for finding the "optimum" program. The mathematical problem associated with this approach is developed first in general notation and then in term sof a dynamic system of equations expressed in matrix notation. Typical problems from the fields of inter-industryrelations, transportation nutrition, warehouse storage, and air transport are given in the last section.
Econometrica © 1949 The Econometric Society