Abstract
The purpose of this paper is to present some results on linear programming in measure spaces (LPM). We prove that, under certain conditions, the optimal value of an LPM is equal to the optimal value of the dual problem (DLPM). We also present two algorithms for solving various LPM problems and prove the convergence properties of these algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Anderson, E.J. (1983), A review of duality theory for linear programming over topological vector spaces, J. Math. Anal. Appl. 97, 380-392.
Glashoff, K. and Gustafson, S.A. (1982), Linear optimization and approximation, Springer, New York.
Goberna, M.A. and López, M.A. (1998), Linear Semi-Infinite Optimization, Wiley, Chichester.
Hettich, R. and Kortanek, K. (1993), Semi-infinite programming: Theory, method and application, SIAM Review, 35, 380-429.
Huser, H.G. (1982), Functional analysis, Wiley, Chichester.
Kellerer, H.G. (1988), Measure theoretic versions of linear programming, Math. Zeitschrift, 198, 367-400.
Kretschmer, K.S. (1961), Programmes in paired spaces, Can. J. Math., 13, 221-238.
Lai, H.C. and Wu, S.Y. (1992), Extremal points and optimal solutions for general capacity problems, Math. Programming (series A), 54, 87-113.
Lai, H.C. and Wu, S.Y. (1992), On linear semi-infinite programming problems, An algorithm, Numer. Funct. Anal. and Optimiz., 13(3/4), 287-304.
Lai, H.C. and Wu, S.Y. (1994), Linear programming in measure spaces, Optimization, 29, 141-156.
Narici, L. and Beckenstein, E. (1985), Topological vector spaces, Marcel Dekker, New York.
Reemtsen, R. and Görner, S. (1998), Numerical methods for semi-infinite programming; a survey. In Reemtsen R. and Ruckmann J-J., (eds), Semi-Infinite Programming, Kluwer Academic Publishers, Boston, MA, pp. 195-275.
Rudin, W. (1987), Real and Complex Analysis, McGraw-Hill, New York.
Rudin, W. (1991), Functional Analysis, McGraw-Hill, New York.
Wu, S.Y., Fang, S.C. and Lin, C.J. (1998), Relaxed cutting plane method for solving linear semi-infinite programming problems, Journal of Optimization Theory and Applications, 99, 759-779.
Wu, S.Y., Lin, C.J. and Fang, S.C. (2000), Relaxed cutting plane method for solving general capacity programming problems, to appear in Ann of Operations Research.
Yamasaki, M. (1968), Duality theorems in mathematical programming and their applications, J. Sci. Hiroshima Univ. Ser., A-I, 32, 331-356.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wen, C., Wu, S. Duality theorems and algorithms for linear programming in measure spaces. J Glob Optim 30, 207–233 (2004). https://doi.org/10.1007/s10898-004-8274-z
Issue Date:
DOI: https://doi.org/10.1007/s10898-004-8274-z