Convexifactors, generalized convexity, and optimality conditions (Q700700)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Convexifactors, generalized convexity, and optimality conditions |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convexifactors, generalized convexity, and optimality conditions |
scientific article |
Statements
Convexifactors, generalized convexity, and optimality conditions (English)
0 references
8 October 2002
0 references
The authors make use of the concept of convexificators which was introduced by \textit{V. Jeyakumar} and \textit{D. T. Luc} [J. Optimization Theory Appl. 101, No. 3, 599--621 (1999; Zbl 0956.90033)] to establish some characterizations of quasiconvex and pseudoconvex functions. They prove also a rule for calculating a convexificator of a max function, and derive optimality conditions for inequality constrained programming problems.
0 references
convexificator
0 references
generalized convexity
0 references
constrained programming problem
0 references
0 references
