Methods of Mathematical Economics

Preface to the Classics Edition Preface Errata Chapter 1: Linear Programming. Introduction to Linear Programming Linear Programs and Their Duals How the Dual Indicates Optimality Basic Solutions The Idea of the Simplex Methods Separating Planes for Convex Sets Finite Cones and the Farkas Alternative The Duality Principle Perturbations and Parametric Programming The Simplex Tableau Algorithm The Revised Simplex Algorithm A Simplex Algorithm for Degenerate Problems Multiobjective Linear Programming Zero-Sum, Two-Person Games Integer Programming: Gomory's Method Network Flows Assignment and Shortest-Route Problems The Transportation Problem Chapter 2: Nonlinear Programming. Wolfe's Method for Quadratic Programming Kuhn-Tucker Theory Geometric Programming Chapter 3: Fixed-Point Theorems. Introduction to Fixed Points Contraction Mappings Garsia's Proof of the Brouwer Fixed-Point Theorem Milnor's Proof of the Brouwer Fixed-Point Theorem Barycentric Coordinates, Sperner's Lemma, and an Elementary Proof of the Brouwer Fixed-Point Theorem The Schauder Fixed-Point Theorem Kakutani's Fixed-Point Theorem and Nash's Theorem for n-Person Games Index.