Portal de Periódicos da CAPES

Optimality conditions for convex semi‐infinite programming problems

1980; Wiley; Volume: 27; Issue: 3 Linguagem: Inglês

10.1002/nav.3800270307

1931-9193

Alona Ben‐Tal, L. Kerzner, S. Zlobec,

Advanced Topology and Set Theory

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.