Duality in mathematical programming and some problems of convex analysis
Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 25 (1970) no. 5, pp. 171-200

Voir la notice de l'article provenant de la source Math-Net.Ru

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.
@article{RM_1970_25_5_a6,
     author = {G. Sh. Rubinshtein},
     title = {Duality in mathematical programming and some problems of convex analysis},
     journal = {Trudy Matematicheskogo Instituta imeni V.A. Steklova},
     pages = {171--200},
     publisher = {mathdoc},
     volume = {25},
     number = {5},
     year = {1970},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/RM_1970_25_5_a6/}
}
TY  - JOUR
AU  - G. Sh. Rubinshtein
TI  - Duality in mathematical programming and some problems of convex analysis
JO  - Trudy Matematicheskogo Instituta imeni V.A. Steklova
PY  - 1970
SP  - 171
EP  - 200
VL  - 25
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/RM_1970_25_5_a6/
LA  - en
ID  - RM_1970_25_5_a6
ER  - 
%0 Journal Article
%A G. Sh. Rubinshtein
%T Duality in mathematical programming and some problems of convex analysis
%J Trudy Matematicheskogo Instituta imeni V.A. Steklova
%D 1970
%P 171-200
%V 25
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/RM_1970_25_5_a6/
%G en
%F RM_1970_25_5_a6
G. Sh. Rubinshtein. Duality in mathematical programming and some problems of convex analysis. Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 25 (1970) no. 5, pp. 171-200. http://geodesic.mathdoc.fr/item/RM_1970_25_5_a6/