CFM 13

Tjalling C. Koopmans, ed., Activity Analysis of Production and Allocation, John Wiley & Sons, 1951 [11,727 kb] [Table of Contents]


Abstract: 

Preliminary Pages [i-xiv]
PART ONE: Theory of Programming and Allocation
1 The Programming of Interdependent Activities: General Discussion, by Marshall K. Wood and George B. Dantzig [15]
2 The Programming of Interdependent Activities: Mathematical Model, by George B. Dantzig [19]
3 Analysis of Production as an Efficient Combination of Activities, by Tjalling C. Koopmans [33]
4 The Aggregate Linear Production Function and Its Applications to von Neumann’s Economic Model, by Nicholas Georgescu-Roegen [98]
5 Relaxation Phenomena in Linear Dynamic Models, by Nicholas Georgescu-Roegen [116]
6 Uses of Leontief’s Open Input-Output Models, by Harlan M. Smith [132]
7 Abstract of a Theorem Concerning Substitutability in Open Leontief Models, by Paul A. Samuelson [142]
8 Alternative Proof of the Substitution Theorem of Leontief Models in the Case of Three Industries, by Tjalling C. Koopmans [147]
9 Alternative Proof of the Substitution Theorem of Leontief Models in the General Case, by Kenneth J. Arrow [155]
10 Some Properties of a Generalized Leontief Model, by Nicholas Georgescu-Roegen [165]
PART TWO: Applications of Allocation Models
11 On the Choice of a Crop Rotation Plan, by Clifford Hildreth and Stanley Reiter [177]
12 Development of Dynamic Models for Program Planning, by Marshall K. Wood and Murray A. Geisler [189]
13 Representation in a Linear Model of Nonlinear Growth Curves in the Aircraft Industry, by Marshall K. Wood [216]
14 A Model of Transportation, by Tjalling C. Koopmans and Stanley Reiter [222]
15 Effects of Technological Change in a Linear Model, by Herbert A. Simon
     With comments by Ansley Coale and Yale Brozen [260]
16 The Accuracy of Economic Observations, by Oskar Morgenstern [282]
PART THREE: Mathematical Properties of Convex Sets
17 Convex Polyhedral Cones and Linear Inequalities, by David Gale [287]
18 Theory of Convex Polyhedral Cones, by Murray Gerstenhaber [298]
19 Linear Programming and the Theory of Games, by David Gale, Harold W. Kuhn, and Albert W. Tucker [317]
20 A Proof of the Equivalence of the Programming Problem and the Game Problem, by George B. Dantzig [330]
PART FOUR: Problems of Computation
21 Maximization of a Linear Function of Variables Subject to Linear Inequalities, by George B. Dantzig [339]
22 Application of the Simplex Method to a Game Theory Problem, by Robert Dorfman [348]
23 Application of the Simplex Method to a Transportation Problem, by George B. Dantzig [359]
23 Iterative Solution of Games by Fictitious Play, by George W. Brown [374]
25 Computational Suggestions for Maximizing a Linear Function Subject to Linear Inequalities, by George W. Brown and Tjalling C. Koopmans [377]
References [381]
Index of Names & Subject Index [387]