Proper efficiency in a linear fractional vector maximum problem with generalized convex constraints (Q1108934): Difference between revisions
From MaRDI portal
Latest revision as of 18:01, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Proper efficiency in a linear fractional vector maximum problem with generalized convex constraints |
scientific article |
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
