Duality in mathematical programming and some problems of convex analysis
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.
- Publication:
-
Russian Mathematical Surveys
- Pub Date:
- October 1970
- DOI:
- 10.1070/RM1970v025n05ABEH003800
- Bibcode:
- 1970RuMaS..25..171R