Optimality conditions for convex semi‐infinite programming problems
Alona Ben‐Tal, L. Kerzner, S. Zlobec · Naval Research Logistics Quarterly · 1980
Abstract This paper gives characterization of optimal Solutions for convex semiinfinite programming problems. These characterizations are free of a constraint qualification assumption. Thus they overcome the deficiencies of the semiinfinite versions of the Fritz John and the Kuhn‐Tucker theories, which give only necessary or sufficient conditions for optimality, but not both.