Optimality conditions for convex semi-in
β
A. Ben-Tal; L. Kerzner; S. Zlobec
π
Article
π
1980
π
John Wiley and Sons
π
English
β 923 KB
## 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