Skip to content
naulon

Not checkedNot checked for notices yet.

Logarithmic penalty function method for invex multi-objective fractional programming problems

Mansur Hassan, Adam Baharum, Majid Khan Majahar Ali

Journal of Taibah University for Science · 2020

doi:10.1080/16583655.2020.1715051 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

In this paper, a new logarithmic penalty function method is used for solving nonlinear multi-objective fractional programming problems (MOFPP) involving invex objectives and constraints functions with respect to the same function η. This approach is implemented by modifying fractional objective function to $\alpha $-invex function, no parameterizations to multi-objective fractional programming problem are required. Furthermore, the constrained multi-objective FPP has been converted to a sequence of unconstrained optimization problems by adding a new logarithmic penalty function to each objective function.

Abstract licence: CC BY-NC

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.