An Algorithm for the Solution of a Quadratic Programming Problem, with Application to Constrained Matrix and Spatial Price Equilibrium Problems

A Nagurney and Referee H K Chen
Additional contact information
A Nagurney: Department of General Business and Finance, School of Management, University of Massachusetts, Amherst, MA 01003, USA
Referee H K Chen: 2230 Newmark Civil Engineering Laboratory, 205 North Mathews Avenue, Urbana, IL 61801, USA

Environment and Planning A, 1989, vol. 21, issue 1, 99-114

Abstract: In this paper a quadratic programming problem is considered. It contains, as special cases, formulations of constrained matrix problems with unknown row and column totals, and classical spatial price equilibrium problems with congestion. An equilibration algorithm, which is of the relaxation type, is introduced into the problem. It resolves the system into subproblems, which in turn, can be solved exactly, even in the presence of upper bounds. Also provided is computational experience for several large-scale examples. This work identifies the equivalency between constrained matrix problems and spatial price equilibrium problems which had been postulated, but, heretofore, not made.

Date: 1989
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1068/a210099 (text/html)

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:sae:envira:v:21:y:1989:i:1:p:99-114

DOI: 10.1068/a210099

Access Statistics for this article

More articles in Environment and Planning A
Bibliographic data for series maintained by SAGE Publications ().