chapter  6
6 The computation of equilibria for the Walrasian model: a personal account
ByHERBERT E. SCARF
Pages 28

Some early history I was a graduate student in the Department of Mathematics at Princeton from September 1951 until June 1954. After graduation I left Princeton for the RAND Corporation. One of the major reasons for choosing RAND rather than a more conventional academic position was my desire to be involved in applied rather than abstract mathematics. I could not have selected a better location for this particular goal. George Dantzig had arrived recently and was in the process of applying linear programming techniques to a growing body of basic problems. Richard Bellman was convinced that all optimization problems with a dynamic structure (and many others) could fruitfully be formulated, and solved, as dynamic programs. Ray Fulkerson and Lester Ford had turned their attention to network flow problems, a topic which became the springboard for the fertile field of combinatorial optimization. Dantzig and Fulkerson studied the Traveling Salesman problem and other early examples of what ultimately became known, under the guidance of Ralph Gomory, as integer programming.1