𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimality conditions for convex semi-infinite programming problems

✍ Scribed by A. Ben-Tal; L. Kerzner; S. Zlobec

Publisher
John Wiley and Sons
Year
1980
Tongue
English
Weight
923 KB
Volume
27
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

Optimality Conditions for Lower Semi-con
Optimality Conditions for Lower Semi-continuous Functions
✍ Chin Cheng Chou; Xinbao Li; Kung-Fu Ng; Shuzhong Shi πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 181 KB

Let f be a lower semi-continuous and bounded below function from a Banach Ε½ x space X into yΟ±, qΟ± where X is assumed to admit a Lipschitz smooth ''bump-function.'' Generalizing results of Chaney, we study optimality conditions for x g X to be a local minimum point of f. These conditions are describe