ScholarLens Back to search
1994•OptimizationRequires access

Duality for multiobjective fractional programming involvingn-set functions sup*

Cheong Lai Jo, Dohee Kim, G.M. Lee

Open publisher page 15 citations

Abstract

For a multiobjective fractional programming problem (MFP) involving vector valued n-set functions, the dual problem (MFD) and the generalized dual problem (GMFD) are formulated and the concept of efficiency is used to prove the weak, strong and strict converse duality results between the associated parametric problem (MFP) λ and (MFD) under generalized ρ-convexity assumptions. Also, those duality results between (MFP) λ, and (GMFD) are obtained

About this research paper

What this paper is about

For a multiobjective fractional programming problem (MFP) involving vector valued n-set functions, the dual problem (MFD) and the generalized dual problem (GMFD) are formulated and the concept of efficiency is used to prove the weak, strong and strict converse duality results between the associated parametric problem (MFP) λ and (MFD) under generalized ρ-convexity assumptions. Also, those duality results between (MFP) λ, and (GMFD) are obtained

Why it matters

OpenAlex reports 15 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

For a multiobjective fractional programming problem (MFP) involving vector valued n-set functions, the dual problem (MFD) and the generalized dual problem (GMFD) are formulated and the concept of efficiency is used to prove the weak, strong and strict converse duality results between the associated parametric problem (MFP) λ and (MFD) under generalized ρ-convexity assumptions. Also, those duality results between (MFP) λ, and (GMFD) are obtained

Key concepts: Fractional programming, Mathematics, Duality (order theory), Strong duality, Converse, Wolfe duality, Convexity, Multiobjective programming

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Duality for multiobjective fractional programming involvingn-set functions sup* — Research Paper | ScholarLens