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 University Press
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/}
}
[1] 1. Ben-Israel, A., Linear equations and inequalities on finite dimensional, real or complex, vector spaces:. A unified theory, J. Math. Anal. Appl. 27 (1969), 367–389. Google Scholar
[2] 2. Farkas, J., Uber die Th?orie des einfachen Ungleichungen, J. Reine Angew. Math. 124 (1902), 1–24. Google Scholar
[3] 3. Kaul, R. N., On linear inequalities in complex space, Amer. Math. Monthl. 77 (1970), 955-960. Google Scholar
[4] 4. Levinson, N., Linear programming in complex space, J. Math. Anal. Appl. 14 (1966), 44–62. Google Scholar
Cité par Sources :