Contact us on (02) 8445 2300
For all customer service and order enquiries

Woodslane Online Catalogues

9780898715095 Academic Inspection Copy

Methods of Mathematical Economics

Linear and Nonlinear Programming, Fixed-Point Theorems
Description
Table of
Contents
Google
Preview
In this easy-to-read classic, readers learn Wolfe's method, which remains useful for quadratic programming, and the Kuhn-Tucker theory, which underlies quadratic programming and most other nonlinear programming methods. In addition, the author presents multiobjective linear programming, which is being applied in environmental engineering and the social sciences. The addition of a list of errata, new to this edition, should add to the book's popularity as well as its usefulness both in the classroom and for individual study.
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.
Google Preview content