Details

Resolution of Ties in Parametric Quadratic Programming

by Wang, Xianzhi

Abstract (Summary)
We consider the convex parametric quadratic programming problem when the end of the parametric interval is caused by a multiplicity of possibilities ("ties"). In such cases, there is no clear way for the proper active set to be determined for the parametric analysis to continue. In this thesis, we show that the proper active set may be determined in general by solving a certain non-parametric quadratic programming problem. We simplify the parametric quadratic programming problem with a parameter both in the linear part of the objective function and in the right-hand side of the constraints to a quadratic programming without a parameter. We break the analysis into three parts. We first study the parametric quadratic programming problem with a parameter only in the linear part of the objective function, and then a parameter only in the right-hand side of the constraints. Each of these special cases is transformed into a quadratic programming problem having no parameters. A similar approach is then applied to the parametric quadratic programming problem having a parameter both in the linear part of the objective function and in the right-hand side of the constraints.
Bibliographical Information:

Advisor:

School:University of Waterloo

School Location:Canada - Ontario

Source Type:Master's Thesis

Keywords:mathematics parametric quadratic programming ties

ISBN:

Date of Publication:01/01/2004

© 2009 OpenThesis.org. All Rights Reserved.