Linear Programming and Economic Analysis
โ Scribed by Robert Dorfman, Paul A. Samuelson, Robert M. Solow
- Publisher
- Dover Publications
- Year
- 1987
- Tongue
- English
- Leaves
- 544
- Series
- Dover Books on Computer Science
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
Designed primarily for economists and those interested in management economics who are not necessarily accomplished mathematicians, this text offers a clear, concise exposition of the relationship of linear programming to standard economic analysis. The research and writing were supported by The RAND Corporation in the late 1950s.
Linear programming has been one of the most important postwar developments in economic theory, but until publication of the present volume, no text offered a comprehensive treatment of the many facets of the relationship of linear programming to traditional economic theory. This book was the first to provide a wide-ranging survey of such important aspects of the topic as the interrelations between the celebrated von Neumann theory of games and linear programming, and the relationship between game theory and the traditional economic theories of duopoly and bilateral monopoly.
Modern economists will especially appreciate the treatment of the connection between linear programming and modern welfare economics and the insights that linear programming gives into the determinateness of Walrasian equilibrium. The book also offers an excellent introduction to the important Leontief theory of input-output as well as extensive treatment of the problems of dynamic linear programming.
Successfully used for three decades in graduate economics courses, this book stresses practical problems and specifies important concrete applications.
๐ SIMILAR VOLUMES
<p>Along with the traditional material concerning linear programming (the simplex method, the theory of duality, the dual simplex method), <em>In-Depth Analysis of Linear Programming</em> contains new results of research carried out by the authors. <br/> For the first time, the criteria of stability
<p>In <em>Linear Programming: A Modern Integrated Analysis</em>, both boundary (simplex) and interior point methods are derived from the complementary slackness theorem and, unlike most books, the duality theorem is derived from Farkas's Lemma, which is proved as a convex separation theorem. The ted
<div>This book covers all aspects of linear programming from the two-dimensional LPs and their extension to higher dimensional LPs, through duality and sensitivity analysis and finally to the examination of commented software outputs.<br>The book is organised into three distinct parts: the first par
<p><p>This text covers the basic theory and computation for mathematical modeling in linear programming. It provides a strong background on how to set up mathematical proofs and high-level computation methods, and includes substantial background material and direction. Paris presents an intuitive an
Aimed at final year undergraduate students, this is the first volume to publish in a new series of text covering core subjects in operational research in an accessible student-friendly format. This volume presents simulation paired with inventory control. The Operational Research Series aims to pr