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