Complexity of circumscribed and inscribed ellipsoid methods for solving equilibrium economical models

DOI10.1016/0096-3003(92)90079-GzbMath0769.90013MaRDI QIDQ1207805

M. E. Primak, Donald J. Newman

Publication date: 16 May 1993

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

zbMATH Keywords

Arrow-Debreu modellinear utility functionsellipsoid methodsexchange-production model

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90) Abstract computational complexity for mathematical programming problems (90C60) General equilibrium theory (91B50)

Related Items

A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property ⋮ An auction-based market equilibrium algorithm for a production model ⋮ Methods of centers for variational inequalities and linear programming

Cites Work

• An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
• Extensions of Lemke's algorithm for the linear complementarity problem
• Uniqueness of the solution in some equilibrium economic models
• Location of the Maximum on Unimodal Surfaces
• Existence of an Equilibrium for a Competitive Economy
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item