| Article ID: | iaor20013654 |
| Country: | Poland |
| Volume: | 25 |
| Issue: | 4 |
| Start Page Number: | 761 |
| End Page Number: | 772 |
| Publication Date: | Jan 1996 |
| Journal: | Control and Cybernetics |
| Authors: | Altman Anna |
| Keywords: | programming: linear |
The higher order primal–dual method for linear programming is extended to the case of separable convex quadratic optimization with linear constraints. The equivalents of separable objectives are considered. Computational results for modified Netlib problems are provided.