Least-index resolution of degeneracy in quadratic programming |
| |
Authors: | Yow-Yieh Chang Richard W. Cottle |
| |
Affiliation: | (1) Department of Operations Research, Stanford University, 94305 Stanford, CA, USA |
| |
Abstract: | In this study, we combine least-index pivot selection rules with Keller's algorithm for quadratic programming to obtain a finite method for processing degenerate problems.Research and reproduction of this report were partially supported by National Science Foundation Grant MCS76-81259; and the Office of Naval Research Contract N00014-75-C-0267. |
| |
Keywords: | Degeneracy Quadratic Programming Least Index Rules Keller's Algorithm |
本文献已被 SpringerLink 等数据库收录! |