Least-index resolution of degeneracy in quadratic programming
- 1 December 1980
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 18 (1) , 127-137
- https://doi.org/10.1007/bf01588308
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Algorithmic equivalence in quadratic programming, I: A least-distance programming problemJournal of Optimization Theory and Applications, 1979
- Notes on Bland’s pivoting rulePublished by Springer Nature ,1978
- New Finite Pivoting Rules for the Simplex MethodMathematics of Operations Research, 1977
- The general quadratic optimization problemMathematical Programming, 1973
- Optimality conditions for quadratic programmingMathematical Programming, 1971
- A note on cycling in the simplex methodNaval Research Logistics Quarterly, 1969
- Symmetric dual quadratic programsQuarterly of Applied Mathematics, 1963
- QUADRATIC PROGRAMMING. A VARIANT OF THE WOLFE-MARKOWITZ ALGORITHMSPublished by Defense Technical Information Center (DTIC) ,1961
- The generalized simplex method for minimizing a linear form under linear inequality restraintsPacific Journal of Mathematics, 1955
- Optimality and Degeneracy in Linear ProgrammingEconometrica, 1952