Mathematical Programming and Economic Theory

This paper, which is based on the remarks offered during a plenary address at the May 1989 CORS/TIMS/ORSA meeting in Vancouver, discusses the analogy between economic institutions and algorithms for solving mathematical programming problems. The simplex method for solving linear programs can be interpreted as a search for market prices that equilibrate the demand for factors of production with their supply. A possible interpretation in terms of the internal organization of a large firm is offered for Lenstra's integer programming algorithm.

[1]  The Economics of Control , 1975 .

[2]  Ralph E. Gomory,et al.  INTEGER PROGRAMMING AND PRICING , 1960 .

[3]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[4]  László Lovász,et al.  Algorithmic theory of numbers, graphs and convexity , 1986, CBMS-NSF regional conference series in applied mathematics.

[5]  László Lovász,et al.  The Shapes of Polyhedra , 1990, Math. Oper. Res..

[6]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .

[7]  A. Lerner,et al.  The Economics of Control , 1944 .