ON DUALITY THEORY OF CONIC LINEAR PROBLEMS

In this paper we discuss duality theory of optimization problems with a linear objective function and subject to linear constraints with cone inclusions, referred to as conic linear problems. We formulate the Lagrangian dual of a conic linear problem and survey some results based on the conjugate duality approach, where the questions of”no duality gap” and existence of optimal solutions are related to properties of the corresponding optimal value function. We discuss in detail applications of the abstract duality theory to the problem of moments, linear semi-infinite, and continuous linear programming problems.

[1]  A. Hoffman On approximate solutions of systems of linear inequalities , 1952 .

[2]  R Bellman,et al.  Bottleneck Problems and Dynamic Programming. , 1953, Proceedings of the National Academy of Sciences of the United States of America.

[3]  W. Rogosinski Moments of non-negative mass , 1958, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.

[4]  石井 恵一 On sharpness of Tchebycheff-type inequalities = チェビシェフ型不等式の最良性について , 1964 .

[5]  N. Levinson,et al.  A class of continuous linear programming problems , 1966 .

[6]  J. Kemperman The General Moment Problem, A Geometric Approach , 1968 .

[7]  R. Rockafellar Integrals which are convex functionals. II , 1968 .

[8]  Richard C. Grinold,et al.  Symmetric Duality for Continuous Linear Programs , 1970 .

[9]  R. Holmes Geometric Functional Analysis and Its Applications , 1975 .

[10]  Stephen M. Robinson,et al.  Regularity and Stability for Convex Multivalued Functions , 1976, Math. Oper. Res..

[11]  I. Ekeland,et al.  Convex analysis and variational problems , 1976 .

[12]  D. J. H. Garling,et al.  GEOMETRIC FUNCTIONAL ANALYSIS AND ITS APPLICATION , 1977 .

[13]  丸山 徹 Convex Analysisの二,三の進展について , 1977 .

[14]  H. Weinert Ekeland, I. / Temam, R., Convex Analysis and Variational Problems. Amsterdam‐Oxford. North‐Holland Publ. Company. 1976. IX, 402 S., Dfl. 85.00. US $ 29.50 (SMAA 1) , 1979 .

[15]  Werner Krabs,et al.  Optimization and approximation , 1979 .

[16]  Klaus Glashoff,et al.  Linear Optimization and Approximation , 1983 .

[17]  R. Rockafellar Conjugate Duality and Optimization , 1987 .

[18]  H. Landau Moments in mathematics , 1987 .

[19]  E. Anderson,et al.  Linear programming in infinite-dimensional spaces : theory and applications , 1987 .

[20]  Gautam Appa,et al.  Linear Programming in Infinite-Dimensional Spaces , 1989 .

[21]  Kenneth O. Kortanek,et al.  Semi-Infinite Programming: Theory, Methods, and Applications , 1993, SIAM Rev..

[22]  James E. Smith,et al.  Generalized Chebychev Inequalities: Theory and Applications in Decision Analysis , 1995, Oper. Res..

[23]  M. Pullan A Duality Theory for Separated Continuous Linear Programs , 1996 .

[24]  Elijah Polak,et al.  Semi-Infinite Optimization , 1997 .

[25]  M. Pullan Existence and duality theory for separated continuous linear programs , 1997 .

[26]  M. A. López-Cerdá,et al.  Linear Semi-Infinite Optimization , 1998 .