摘要
讨论线性互补问题与Lemke互补转轴算法,将此算法推广到两类凸二次规划;指出两类线性互补问题,并可用简单公式算得互补基本可行解,而不必引入人工变量z_0。最后给出算例。
This paper deals with the linear complementary problem and Lemke's complementary pivoting algorithm. First, the algorithm is extended to some types of convex quadratic programming. Next, two types of linear complementary problem are presented. For such a problem, we can obtain one complementary basic feasible solution of the linear complementary problem by one formulation, without using the artificial variable z_0. Finally, some examples are given.
出处
《天津大学学报》
EI
CAS
CSCD
1992年第2期111-117,共7页
Journal of Tianjin University(Science and Technology)
关键词
线性互补问题
凸二次规划
人工变量
linear complementary problem, convex quadratic programming, Lemke's. complementary pivoting algorithm, complementary basic feasible solution, artificial variable
