ScholarLens Back to search
2006•Taiwanese Journal of MathematicsRequires access

NONSMOOTH MULTIOBJECTIVE FRACTIONAL PROGRAMMING WITH GENERALIZED INVEXITY

Do Sang Kim

Open publisher page 7 citations

Abstract

In this paper, we consider nonsmooth multiobjective fractional programming problems involving locally Lipschitz functions. We introduce the property of generalized invexity for fractional function. We present necessary optimality conditions, sufficient optimality conditions and duality relations for nonsmooth multiobjective fractional programming problems, which is for a weakly efficient solution under suitable generalized invexity assumptions.

About this research paper

What this paper is about

In this paper, we consider nonsmooth multiobjective fractional programming problems involving locally Lipschitz functions. We introduce the property of generalized invexity for fractional function. We present necessary optimality conditions, sufficient optimality conditions and duality relations for nonsmooth multiobjective fractional programming problems, which is for a weakly efficient solution under suitable generalized invexity assumptions.

Why it matters

OpenAlex reports 7 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, we consider nonsmooth multiobjective fractional programming problems involving locally Lipschitz functions. We introduce the property of generalized invexity for fractional function. We present necessary optimality conditions, sufficient optimality conditions and duality relations for nonsmooth multiobjective fractional programming problems, which is for a weakly efficient solution under suitable generalized invexity assumptions.

Key concepts: Mathematics, Fractional programming, Lipschitz continuity, Duality (order theory), Property (philosophy), Applied mathematics, Mathematical optimization, Multiobjective programming

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
NONSMOOTH MULTIOBJECTIVE FRACTIONAL PROGRAMMING WITH GENERALIZED INVEXITY — Research Paper | ScholarLens