Pairwise reactive sor algorithm for quadratic programming of net import spatial equilibrium models
An iterative method based on the successive overrelaxation (SOR) is proposed to solve quadratic programming of net important spatial equilibrium models. The algorithm solves the problem by updating the variables pairwise at each iteration. The principal feature of the algorithm is that the Lagrange...
Saved in:
| Published in | Mathematical programming Vol. 43; no. 1-3; pp. 175 - 186 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
01.01.1989
|
| Online Access | Get full text |
Cover
Loading…
| Summary: | An iterative method based on the successive overrelaxation (SOR) is proposed to solve quadratic programming of net important spatial equilibrium models. The algorithm solves the problem by updating the variables pairwise at each iteration. The principal feature of the algorithm is that the Lagrange multipliers corresponding to the constraints do not have to be calculated at each iteration as is the case in SOR based algorithms. Yet the Lagrange multipliers can easily be extracted from the solution values. |
|---|---|
| Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| ISSN: | 0025-5610 1436-4646 |
| DOI: | 10.1007/BF01582288 |