2008•Journal of Yibin UniversityRequires access

Optimality Condition and Duality Results for a Class of Multi-objective Fractional Programming Problems with Generalized Convexity

Min Xin-chang

Open publisher page 0 citations

Abstract

In the article,it introduces and studies a class of multi-objective fractional programming problems with perturbation under generalized convexity conditions.It claims that the multi-objective fractional programming problem is equivalent to the multi-objective programming problem and establish a sufficient optimality condition for the multi-objective fractional programming problem.It also obtains the weak and strong duality theorems for the multi-objective fractional programming problem.

About this research paper

What this paper is about

In the article,it introduces and studies a class of multi-objective fractional programming problems with perturbation under generalized convexity conditions.It claims that the multi-objective fractional programming problem is equivalent to the multi-objective programming problem and establish a sufficient optimality condition for the multi-objective fractional programming problem.It also obtains the weak and strong duality theorems for the multi-objective fractional programming problem.

Why it matters

A significance statement is not available in the OpenAlex record.

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 the article,it introduces and studies a class of multi-objective fractional programming problems with perturbation under generalized convexity conditions.It claims that the multi-objective fractional programming problem is equivalent to the multi-objective programming problem and establish a sufficient optimality condition for the multi-objective fractional programming problem.It also obtains the weak and strong duality theorems for the multi-objective fractional programming problem.

Key concepts: Fractional programming, Convexity, Duality (order theory), Mathematics, Mathematical optimization, Class (philosophy), Strong duality, Nonlinear programming

Related papers

Back to paper searchBrowse research topicsOriginal source
Optimality Condition and Duality Results for a Class of Multi-objective Fractional Programming Problems with Generalized Convexity — Research Paper | ScholarLens