Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems
This paper is devoted to the study of nonsmooth generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be locally Lipschitz. We introduce a constraint qualification which is based on the Mordukhovich subdifferential. Then, we derive a Fritz-John type necessary optimality condition. Finally, interrelations between the new and the existing constraint qualifications such as the Mangasarian-Fromovitz, linear independent, and the Slater are investigated.
| Year of publication: |
2010
|
|---|---|
| Authors: | Kanzi, N. ; Nobakhtian, S. |
| Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 205.2010, 2, p. 253-261
|
| Publisher: |
Elsevier |
| Keywords: | Generalized semi-infinite programming Mordukhovich subdifferential Constraint qualification Lagrangian Optimality condition Nonsmooth optimization |
Saved in:
Saved in favorites
Similar items by person
-
Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems
Kanzi, N., (2010)
-
Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems
Kanzi, N., (2010)
-
An algorithm for generalized constrained multi-source Weber problem with demand substations
Nobakhtian, S., (2018)
- More ...