Optimality criteria for sum of fractional multiobjective optimization problem with generalized invexity | Zendy

Deepak Bhati | Zendy; Pitam Singh | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Optimality criteria for sum of fractional multiobjective optimization problem with generalized invexity

Author(s) -

Deepak Bhati,

Pitam Singh

Publication year - 2015

Publication title -

turkish journal of mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.454

H-Index - 27

eISSN - 1303-6149

pISSN - 1300-0098

DOI - 10.3906/mat-1411-22

Subject(s) - mathematics , fractional programming , mathematical optimization , optimization problem , multi objective optimization , field (mathematics) , nonlinear programming , pure mathematics , nonlinear system , physics , quantum mechanics

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research