LINEAR COMPLEMENTARITY-PROBLEMS AND MULTIPLE-OBJECTIVE PROGRAMMING

被引：16
|
作者：
KOSTREVA, MM
WIECEK, MM
机构：
[1] Department of Mathematical Sciences, Clemson University, Clemson, 29634-1907, SC
来源：
MATHEMATICAL PROGRAMMING | 1993年 / 60卷 / 03期
关键词：
LINEAR COMPLEMENTARITY PROBLEMS; EFFICIENT SOLUTIONS; MULTIPLE OBJECTIVE PROGRAMMING; COMPUTATIONAL COMPLEXITY;
D O I：
10.1007/BF01580619
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
An equivalence is demonstrated between solving a linear complementarity problem with general data and finding a certain subset of the efficient points of a multiple objective programming problem. A new multiple objective programming based approach to solving linear complementarity problems is presented. Results on existence, uniqueness and computational complexity are included.
引用
收藏
页码：349 / 359
页数：11
相关论文
共 50 条
12345