|Title:||Optimality Conditions For Convex Semi-infinite Programming Problems
|Authors:||A. Ben-Tal ,L. Kerzner and S. Zlobec
|Abstract:||This paper gives characterizations of optimal solutions for convex semi-infinate programming problems. These characterizations are free of a constraint qualification assumption. Thus they overcome the deficiencies of the semi-infinate versions of the Fritz John and the Kuhn-Tucker theories, which give only necessary or sufficient conditions for optimality, but not both. An application to the problem of the best linear Chebyshev approximation with constaints is demonstrated.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1975/CS/CS0065), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1975
To the main CS technical reports page
Computer science department, Technion