## 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
β¦ LIBER β¦
First Order Optimality Conditions for Generalized Semi-Infinite Programming Problems
β Scribed by J. J. Ye; S. Y. Wu
- Publisher
- Springer
- Year
- 2008
- Tongue
- English
- Weight
- 330 KB
- Volume
- 137
- Category
- Article
- ISSN
- 0022-3239
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Optimality conditions for convex semi-in
β
A. Ben-Tal; L. Kerzner; S. Zlobec
π
Article
π
1980
π
John Wiley and Sons
π
English
β 923 KB
Necessary optimality conditions for nons
β
Nader Kanzi
π
Article
π
2010
π
Springer US
π
English
β 179 KB
First-order optimality conditions for tw
β
Li-Ping Pang; Ming-Zheng Wang; Zun-Quan Xia
π
Article
π
2008
π
Elsevier Science
π
English
β 310 KB
## a b s t r a c t We investigate two classes of generalized nonsmooth semi-infinite optimization problems in this paper, that is, the generalized convex semi-infinite optimization problem and the generalized Lipscitz semi-infinite optimization problem. Their first order necessary optimality condit
First and second-order necessary and suf
β
H. Maurer; J. Zowe
π
Article
π
1979
π
Springer-Verlag
π
English
β 562 KB
First-order necessary conditions for gen
β
T. Guinn
π
Article
π
1967
π
Elsevier Science
π
English
β 208 KB
Global Parametric Sufficient Optimality
β
G. J. Zalmai; Qing-hong Zhang
π
Article
π
2007
π
Institute of Applied Mathematics, Chinese Academy
π
English
β 251 KB