Chapter

Minimum Paths

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.0027
 Minimum Paths

Show Summary Details

Preview

This is the fourth of five chapters on optimal programming (the typical mathematics of economics) and related issues as related to choice making, and discusses minimum paths. The eleven sections of the chapter are: connection costs; perpetuum mobile impossible; the triangle inequality; routes; scales; extension theorem; the lp [linear programming] formula; flow argument; elementary decomposition; ford and fulkerson; and shortest path algorithm in basic.

Keywords: choice; economic theory; linear programming; mathematical economics; minimum paths; shortest path algorithm

Chapter.  12210 words. 

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.