Jump to ContentJump to Main Navigation
Logic of Choice and Economic Theory$
Users without a subscription are not able to see the full content.

S. N. Afriat

Print publication date: 1987

Print ISBN-13: 9780198284611

Published to Oxford Scholarship Online: November 2003

DOI: 10.1093/0198284616.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (oxford.universitypressscholarship.com). (c) Copyright Oxford University Press, 2022. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use.date: 03 July 2022

Optimal Programming

Optimal Programming

(p.377) V.1 Optimal Programming
Logic of Choice and Economic Theory

S. N. Afriat

Oxford University Press

This is the first of five chapters on optimal programming (the typical mathematics of economics) and related issues as related to choice making. It introduces the general ideas of optimal programming in economic terms, with reference to the programming problem of a firm. A theorem is proved that is basic to the entire subject, and requires no special assumptions about the programming functions. The ten sections of the chapter are: bounds, limits and maxima; programming problem of a firm; optimal programming theorem; input–output; output limit function; support gradients and marginal values; complementarity; shadow price decentralization; proof of the theorem; and Lagrange multipliers.

Keywords:   choice, complementarity, economic theory, input–output, Lagrange multipliers, mathematical economics, optimal programming, output limit function, shadow price

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .