Linear Inequalities Over Complex Cones
Canadian mathematical bulletin, Tome 16 (1973) no. 1, pp. 19-21
Voir la notice de l'article provenant de la source Cambridge
The basic solvability theorems of Farkas [2] and Levinson [4] were recently extended in different directions by Ben-Israel [1] and Kaul [3].The theorem stated in this note generalizes both results of Ben-Israel and Kaul and is applicable to nonlinear programming over complex cones.
Berman, Abraham. Linear Inequalities Over Complex Cones. Canadian mathematical bulletin, Tome 16 (1973) no. 1, pp. 19-21. doi: 10.4153/CMB-1973-005-x
@article{10_4153_CMB_1973_005_x,
author = {Berman, Abraham},
title = {Linear {Inequalities} {Over} {Complex} {Cones}},
journal = {Canadian mathematical bulletin},
pages = {19--21},
year = {1973},
volume = {16},
number = {1},
doi = {10.4153/CMB-1973-005-x},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1973-005-x/}
}
Cité par Sources :