Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 23 (1983) no. 3, pp. 602-608
Citer cet article
Nguyen Van Thoai; Hoang Tuy. Solving the linear complementarity problem through concave programming. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 23 (1983) no. 3, pp. 602-608. http://geodesic.mathdoc.fr/item/ZVMMF_1983_23_3_a8/
@article{ZVMMF_1983_23_3_a8,
author = {Nguyen Van Thoai and Hoang Tuy},
title = {Solving the linear complementarity problem through concave programming},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {602--608},
year = {1983},
volume = {23},
number = {3},
language = {en},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_1983_23_3_a8/}
}
TY - JOUR
AU - Nguyen Van Thoai
AU - Hoang Tuy
TI - Solving the linear complementarity problem through concave programming
JO - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY - 1983
SP - 602
EP - 608
VL - 23
IS - 3
UR - http://geodesic.mathdoc.fr/item/ZVMMF_1983_23_3_a8/
LA - en
ID - ZVMMF_1983_23_3_a8
ER -
%0 Journal Article
%A Nguyen Van Thoai
%A Hoang Tuy
%T Solving the linear complementarity problem through concave programming
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1983
%P 602-608
%V 23
%N 3
%U http://geodesic.mathdoc.fr/item/ZVMMF_1983_23_3_a8/
%G en
%F ZVMMF_1983_23_3_a8
The following complementarity problem is considered: to find $x\in R^n$, $y\in R^n$, satisfying the conditions $x\ge0$, $y\ge0$, $y=Ax-b$, $(x,y)=0$. A problem of linear programming is reducible to this statement, but not vice versa. The complementarity problem is shown to be reducible to a problem of concave programming with linear constraints and a piecewise linear target function.
