论文信息 - Duality in Semi-Infinite Linear Programming

Duality in Semi-Infinite Linear Programming

For the case of a consistent semi-infinite linear program, we provide several hypotheses, which are both necessary as well as sufficient, that there be no duality gap between the program and its formal dual (with attainment of value in the dual), for every linear objective function. Earlier work provided sufficient conditions for no duality gap for all linear objective functions, or a necessary and sufficient condition for no duality gap for a fixed linear criterion.

[1] Dennis F. Karney,et al. Duality gaps in semi-infinite linear programming—an approximation problem , 1981, Math. Program..

[2] K. S. Kretschmer,et al. Programmes in Paired Spaces , 1961, Canadian Journal of Mathematics.

[3] R. J. Duffin,et al. An Infinite Linear Program with a Duality Gap , 1965 .

[4] Abraham Charnes,et al. ON REPRESENTATIONS OF SEMI-INFINITE PROGRAMS WHICH HAVE NO DUALITY GAPS. , 1965 .

[5] J. Stoer,et al. Convexity and Optimization in Finite Dimensions I , 1970 .

[6] Charles E. Blair. A note on infinite systems of linear inequalities in Rn , 1974 .

[7] Robert G. Jeroslow. Uniform duality in semi-infinite convex optimization , 1983, Math. Program..

[8] Kennan T. Smith,et al. Linear Topological Spaces , 1966 .

[9] J. M. Borwein,et al. Direct theorems in semi-infinite convex programming , 1981, Math. Program..