|
|
Avtomatika i Telemekhanika, 1989, Issue 3, Pages 44–55
(Mi at6234)
|
|
|
|
Deterministic Systems
Generalized convex programming
E. V. Tsoia, D. B. Yudinb a Vladimir
b Moscow
Abstract:
A method is proposed for solution of problems in convex programming which does not require completeness or monotoneity of binary relations and makes it possible for the concavity condition of the vector function to be replaced by a less restrictive condition that the functions and their relationships match.
Received: 02.09.1987
Citation:
E. V. Tsoi, D. B. Yudin, “Generalized convex programming”, Avtomat. i Telemekh., 1989, no. 3, 44–55; Autom. Remote Control, 50:3 (1989), 323–332
Linking options:
https://www.mathnet.ru/eng/at6234 https://www.mathnet.ru/eng/at/y1989/i3/p44
|
|