论文信息 - Duality in mathematical programming and some problems of convex analysis

Duality in mathematical programming and some problems of convex analysis

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.

G. Rubinshteîn

[1] David Hilbert,et al. The Foundations of Geometry , 1903, The Mathematical Gazette.

[2] J. Neumann. Zur Theorie der Gesellschaftsspiele , 1928 .

[3] A. Charnes,et al. An Introduction to Linear Programming. , 1953 .

[4] L. Kantorovitch,et al. On the Translocation of Masses , 1958 .

[5] B. V. Dean,et al. Studies in Linear and Non-Linear Programming. , 1959 .

[6] H. Coxeter,et al. Introduction to Geometry. , 1961 .

[7] G. Zoutendijk,et al. Methods of Feasible Directions , 1962, The Mathematical Gazette.

[8] W. Dorn. Non-Linear Programming--A Survey , 1963 .

[9] Lucien W. Neustadt,et al. An Abstract Variational Theory with Applications to a Broad Class of Optimization Problems. I. General Theory , 1966 .

[10] Lucien W. Neustadt,et al. An Abstract Variational Theory with Applications to a Broad Class of Optimization Problems. II. Applications , 1967 .