Proper efficiency in a linear fractional vector maximum problem with generalized convex constraints (Q1108934)
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: Proper efficiency in a linear fractional vector maximum problem with generalized convex constraints |
scientific article; zbMATH DE number 4068639
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Proper efficiency in a linear fractional vector maximum problem with generalized convex constraints |
scientific article; zbMATH DE number 4068639 |
Statements
Proper efficiency in a linear fractional vector maximum problem with generalized convex constraints (English)
0 references
1988
0 references
A vector maximum problem with fractional objectives and quasi-convex, differentiable constraints is considered. Using the Kuhn-Tucker theory necessary and sufficient conditions for an efficient solution are obtained if the Kuhn-Tucker constraint qualification or the Arrow- Hurwicz-Uzawa constraint qualification hold. Also it is proven that under a certain boundedness assumption an efficient point is properly efficient.
0 references
vector maximum problem
0 references
fractional objectives
0 references
quasi-convex, differentiable constraints
0 references
efficient solution
0 references
Kuhn-Tucker constraint qualification
0 references
0.9100847244262696
0 references
0.8960628509521484
0 references
0.8768221735954285
0 references
0.8584625720977783
0 references
