SUFFICIENCY IN NONSMOOTH MULTIOBJECTIVE FRACTIONAL PROGRAMMING
Sarita Sharma, I. Ahmad
Abstract
Open-access reader
Sarita Sharma, I. Ahmad
Abstract
Open-access reader
In this paper, Karush-Kuhn-Tucker type sufficient optimality conditions are obtained for a feasible point of a nonsmooth multiobjective fractional programming problem to be an efficient or properly efficient by using generalized ( $F,{\rho},{\sigma}$ )-type I functions.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, Karush-Kuhn-Tucker type sufficient optimality conditions are obtained for a feasible point of a nonsmooth multiobjective fractional programming problem to be an efficient or properly efficient by using generalized ( $F,{\rho},{\sigma}$ )-type I functions.
Key concepts: Fractional programming, Karush–Kuhn–Tucker conditions, Mathematics, Mathematical optimization, Type (biology), Sigma, Multiobjective programming, Point (geometry)