|
Avtomatika i Telemekhanika, 2007, Issue 3, Pages 33–46
(Mi at951)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Deterministic Systems
Algorithms to solve some problems of concave programming with linear constraints
S. I. Sergeev Moscow State University of Economics, Statistics and Informatics
Abstract:
Consideration was given to the separable problem of concave programming with linear constraints for which two groups of new algorithms relying on a unique theoretical basis were proposed. The first group of (precise) algorithms approximates the optimal value of a functional from below, the second group of (mostly approximate) algorithms, does this from above.
Citation:
S. I. Sergeev, “Algorithms to solve some problems of concave programming with linear constraints”, Avtomat. i Telemekh., 2007, no. 3, 33–46; Autom. Remote Control, 68:3 (2007), 399–412
Linking options:
https://www.mathnet.ru/eng/at951 https://www.mathnet.ru/eng/at/y2007/i3/p33
|
Statistics & downloads: |
Abstract page: | 232 | Full-text PDF : | 92 | References: | 49 | First page: | 1 |
|