•  
  •  
 

Turkish Journal of Mathematics

DOI

10.3906/mat-1411-22

Abstract

The sum of a fractional program is a nonconvex optimization problem in the field of fractional programming and it is difficult to solve. The development of research is restricted to single objective sums of fractional problems only. The branch and bound methods/algorithms are developed in the literature for this problem as a single objective problem. The theoretical and algorithmic development for sums of fractional programming problems is restricted to single objective problems. In this paper, some new optimality conditions are proposed for the sum of a fractional multiobjective optimization problem with generalized invexity. The optimality conditions are obtained by using a modified objective approach and equivalency with the original problem is established.

Keywords

Multiobjective programming, sum of ratio, multiobjective linear fractional programming, optimality and duality, saddle point criteria

First Page

900

Last Page

912

Download

Included in

Mathematics Commons

Share

COinS