Tatonnement Procedures for Linearly Constrained Convex Optimization

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.

• 저널Management Science · 40(6) · 788–797
• 토픽Advanced Optimization Algorithms Research · Numerical Analysis
• DOI10.1287/mnsc.40.6.788
• 저자Markku Kallio, Seppo Salo