A Cutting Plane Approach to Solving Quadratic Infinite Programs on Measure Spaces

Journal of Global Optimization

Volumn 21, Issue 1, 2001, Pages 67-87

  Wu, S Y ^a  

^a NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

Author keywords

Algorithms; Cutting plane method; Infinite quadratic programming on measure spaces; Optimal solution; Optimal value

Indexed keywords

EID: 0035444570     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1017954323460     Document Type: Article

References (18)

1. Choquet, G. (1954), Theory of capacities, Annales de l'Institut Fourier 5: 131-295.
2. Fang, S.C., Lin, C.J. and Wu, S.Y. Relaxations of the cutting plane method for quadratic semi-infinite programming, (submitted).
3. Fang, S.C. and Puthenpura, S.C. (1993), Linear Optimization and Extensions: Theory and Algorithms, Prentice Hall, Englewood Cliffs, New Jersey.
4. Fang, S.C., Lin, C.J. and Wu, S.Y. (1994), On solving convex quadratic semi-infinite programming problems, Optimization 31: 107-125.
5. Fugled, B. (1960), On the theory of potentials in locally compact spaces. Acta Mathematica, 103: 139-215.
6. Hernandez-Lerma, O. and Lasserre, J.B. (1998), Approximation schemes for infinite linear programs, SIAM Journal on Optimization 8: 973-988.
7. Hettich, R. and Kortanek, K. (1993), Semi-infinite programming: theory, method and application, SIAM Review 35: 380-429.
8. Karlin, S. (1959), Mathematical Methods and Theory in Games, Programming and Economics, Pergamon, London.
9. Lai, H.C. and Wu, S.Y. (1992), Extremal points and optimal solutions for general capacity problems, Mathematical Programming, 54: 87-113.
10. Luenberger, D.G. (1984), Linear and Nonlinear Programming, Addison-Wesley, Reading, Massachusetts.
11. Ohtsuka, M. (1966), Generalized capacity and duality theorem in linear programming. Journal of Science, Hiroshima University Series A-I, 30: 45-56.
12. Ohtsuka, M. (1966), A generalization of duality theorem in the theory of linear programming. Journal of Science, Hiroshima University Series A-I, 30: 31-39.
13. Reemtsen, R. and Görner, S. (1998), Numerical methods for semi-infinite programming: a survey. In: R. Reemtsen and J-J. Rueckmann (eds), Semi-Infinite Programming, Kluwer Academic Publishers, Boston, pp. 195-275.
14. Tichatschke, R. and Nebeling, V. (1988), A cutting plane algorithm for solving quadratic semi-infinite programs. Optimization, 19: 803-817.
15. Wu, S.Y (1985), Linear programming in measure space. Ph.D. Dissertation, Cambridge University.
16. Wu, S.Y., (1985), The general capacity problem. In W. Oettli et al. (eds.), Methods of Operations Research, Oelgeschlager, Gunn and Hain.
17. Yamasaki, M., (1966), On a capacity problem raised in connection with linear programming. Journal of Science, Hiroshima University Series A-I, 30: 57-73.
18. Yosida, M. (1966), Some examples related to duality theorem in linear programming. Journal of Science, Hiroshima University Series A-I, 30: 41-43.