2013Journal of applied mathematics & informaticsOpen access

SUFFICIENCY IN NONSMOOTH MULTIOBJECTIVE FRACTIONAL PROGRAMMING

Sarita Sharma, I. Ahmad

Open full text 4 citations

Abstract

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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)

Related papers

Back to paper searchBrowse research topicsOriginal source
SUFFICIENCY IN NONSMOOTH MULTIOBJECTIVE FRACTIONAL PROGRAMMING — Research Paper | ScholarLens