The Econometric Society An International Society for the Advancement of Economic Theory in its Relation to Statistics and Mathematics
Home Contacts
Econometrica

New Journals

Econometrica
Editorial Board
Journal News

Monograph Series

November 1970 - Volume 38 Issue 6 Page 889 - 906


p.889


Equivalence of Price and Quantity Formulations of Spatial Equilibrium: Purified Duality in Quadratic and Concave Programming

T. Takayama
A. D. Woodland

Abstract

In this paper, a first attempt is made to formulate a spatial equilibrium quadratic programming problem in its primal and "purified" dual forms. This formulation is in sharp contrast to the quadratic primal and dual forms formulated by Dorn [1] and Hanson [2]. Equivalence of the quantity and purified price formulations is formally proved. The proof is important because it permits the formulation of spatial equilibrium problems in terms of either the quantity domain or the price domain. The equivalence is then used to establish the mutually dual quadratic problems in quantify and price separately. The notion of a purified dual is extended to concave programming with linear inequality constraints to deal with spatial equilibrium involving nonlinear demand and supply functions.

Full content Login                                    

Note: to view the fulltext of the article, please login first and then click the "full content" button. If you are based at a subscribing Institution or Library or if you have a separate access to JSTOR/Wiley Online Library please click on the "Institutional access" button.
Prev | All Articles | Next
Go to top
Membership



Email me my password
Join/Renew
Change your address
Register for password
Require login:
Amend your profile
E-mail Alerting
The Society
About the Society
Society News
Society Reports
Officers
Fellows
Members
Regions
Meetings
Future Meetings
Past Meetings
Meeting Announcements
Google
web this site
   
Wiley-Blackwell
Site created and maintained by Wiley-Blackwell.
Comments? Contact customsiteshelp@wiley.com
To view our Privacy Policy, please click here.