|
This article is cited in 15 scientific papers (total in 15 papers)
Duality in mathematical programming and some problems of convex analysis
G. Sh. Rubinshtein
Abstract:
In the paper we explain a general construction method for a problem that is dual in a certain sense to a given extremal problem and we illustrate the method by examples of various classes of problems of mathematical programming. In addition, we consider some problems in the theory of convex sets and convex functions, investigations that were stimulated chiefly by the needs of mathematical programming.
Received: 25.05.1970
Citation:
G. Sh. Rubinshtein, “Duality in mathematical programming and some problems of convex analysis”, Uspekhi Mat. Nauk, 25:5(155) (1970), 171–201; Russian Math. Surveys, 25:5 (1970), 171–200
Linking options:
https://www.mathnet.ru/eng/rm5408https://doi.org/10.1070/RM1970v025n05ABEH003800 https://www.mathnet.ru/eng/rm/v25/i5/p171
|
Statistics & downloads: |
Abstract page: | 608 | Russian version PDF: | 331 | English version PDF: | 24 | References: | 75 | First page: | 1 |
|