Über die ä quivalenz der allgemeinen quadratischen optimierungsaufgabe zu einer linearen parametrischen komplementären optimierungsaufgabe

Abstract

It is proved that the general quadratic programming problem is not equivalent to the linear complementary programming problem obtained from the K. M. Tucker conditions, if the performance functional is unbounded. A linear parametric complementary optimization problem is assigned to the quadratic programming problem such that equivalence holds in any case.