Proper efficiency in a linear fractional vector maximum problem with generalized convex constraints
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.
quasi-convex, differentiable constraints
scientific article; zbMATH DE number 4068639