Chapter

Linear Programming

S. N. Afriat

in Logic of Choice and Economic Theory

Published in print November 1987 | ISBN: 9780198284611
Published online November 2003 | e-ISBN: 9780191595844 | DOI: http://dx.doi.org/10.1093/0198284616.003.0026
 Linear Programming

Show Summary Details

Preview

This is the third of five chapters on optimal programming (the typical mathematics of economics) and related issues as related to choice making. It discusses linear programming, which might appear to be a special case of convex programming, but is more substantial, and is really an embodiment of the theory of systems of linear inequalities (as reflected here). This chapter initiates the subject with reference to systems of linear inequalities and natural questions about them, and all LP (linear programming) theorems are encountered simply in pursuing those. Theorems about linear inequalities that have uses directly on their own are also derived (and are illustrated in many places in this book). The eight sections of the chapter are: linear inequalities; separation theorems; theorems of alternatives; polyhedra and polytopes; LP Duality Theorem; the pivot operation; the Simplex Algorithm; and BASIC program.

Keywords: choice; duality; economic theory; linear inequalities; linear programming; LP Duality Theorem; mathematical economics; optimal programming; pivot operation; polyhedra; polytopes; separation theorems; Simplex Algorithm; theorems of alternatives

Chapter.  13888 words.  Illustrated.

Subjects: Microeconomics

Full text: subscription required

How to subscribe Recommend to my Librarian

Buy this work at Oxford University Press »

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.