Tatonnement Procedures for Linearly Constrained Convex Optimization

Markku Kallio and Seppo Salo
Additional contact information
Markku Kallio: IIASA, A-2361 Laxenburg, Austria
Seppo Salo: Helsinki School of Economics, Runeberginkatu 14-16, 00100 Helsinki, Finland

Management Science, 1994, vol. 40, issue 6, 788-797

Abstract: The emphasis in this article is to exploit the fact that precision requirements for solutions of most economic models in practice are moderate only. A simple approach is introduced for solving linearly constrained partial equilibrium models based on an iterative scheme similar to the simplex method. It allows large-scale models to be solved, within a practical tolerance, efficiently even in a micro computer environment. Extensions to linearly constrained convex optimization problems are presented. Finally, a set of computational tests on 68 linear programs from the NETLIB library is reported. Comparison of our approach with the simplex method (using MINOS 5.1) and with Karmarkar's algorithm is reported. For moderate precision requirements these preliminary results are highly encouraging.

Keywords: linear programming; large-scale optimization; partial equilibrium (search for similar items in EconPapers)
Date: 1994
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.40.6.788 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:40:y:1994:i:6:p:788-797

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().