## 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
Optimality Conditions for Lower Semi-continuous Functions
β Scribed by Chin Cheng Chou; Xinbao Li; Kung-Fu Ng; Shuzhong Shi
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 181 KB
- Volume
- 202
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
β¦ Synopsis
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 described in terms of generalized Chaney's subdifferentials and second-order derivatives.
π SIMILAR VOLUMES
In the present study optimal policies have been evaluated for the production of gramicidin S in multistage continuous culture. An economic objective function was developed which took account of the number and size of the reaction vessels, the costs involved in antibiotic extraction, substrate costs,