摘要: This paper studies a linear programming problem in measure spaces (LPM). Several results are obtained. First, the optimal value of LPM can be equal to dual (DLPM), but solution DLPM may not exist its feasible region. Sccond, :he relations between and extreme point region discussed. In order investigate conditions under which becomes an extremal point, inequality constraint is transformed equality constraint. Third, reformulated general capacity (GCAP) or semi-infinite (LSIP = SIP), appropriate restrictioiis, algorithm developed by authors [7] [8] applicable for developing approximation scheme
sci-hub.se 参考文章(8)
S. T. Rachev, Extreme functionals in the space of probability measures Stability Problems for Stochastic Models. pp. 320- 348 ,(1985) , 10.1007/BFB0074826
S. Å. Gustafson, K. O. Kortanek, Numerical treatment of a class of semi‐infinite programming problems Naval Research Logistics Quarterly. ,vol. 20, pp. 477- 504 ,(1973) , 10.1002/NAV.3800200310
Hang-Chin Lai, Soon-Yi Wu, On Linear Semi-Infinite Programming Problems: An Algorithm Numerical Functional Analysis and Optimization. ,vol. 13, pp. 287- 304 ,(1992) , 10.1080/01630569208816479
E.J. Anderson, A.S. Lewis, S.Y. Wu, The capacity problem Optimization. ,vol. 20, pp. 725- 742 ,(1989) , 10.1080/02331938908843493
Hans G. Kellerer, Measure theoretic versions of linear programming Mathematische Zeitschrift. ,vol. 198, pp. 367- 400 ,(1988) , 10.1007/BF01184672
H. C. Lai, S. Y. Wu, Extremal points and optimal solutions for general capacity problems Mathematical Programming. ,vol. 54, pp. 87- 113 ,(1992) , 10.1007/BF01586043
K. S. Kretschmer, Programmes in paired spaces Canadian Journal of Mathematics. ,vol. 13, pp. 221- 238 ,(1961) , 10.4153/CJM-1961-019-2
Edward J Anderson, Linear Programming In Infinite Dimensional Spaces Mugniram Bangur Memorial Engineering College, Jodhpur. ,(1970)