2019
DOI: 10.2298/fil1907149d
|View full text |Cite
|
Sign up to set email alerts
|

Efficient algorithms for solving nonlinear fractional programming problems

Abstract: In this paper, an efficient algorithm based on the Pascoletti-Serafini scalarization (PS) approach is proposed to obtain almost uniform approximations of the entire Pareto front of bi-objective optimization problems. Five test problems with convex, non-convex, connected, and disconnected Pareto fronts are applied to evaluate the quality of approximations obtained by the proposed algorithm. Results are compared with results of some algorithms including the normal constraint (NC), weighted c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 47 publications
0
2
0
Order By: Relevance
“…These compromise solutions, in which none of the objective functions can be improved in value without impairing at least one of the others, are often referred to as Pareto optimal or Pareto efficient (Neshatian and Zhang 2009). The set of all objective function values at the Pareto and weak Pareto solutions is said to be the Pareto front (or efficient set) of the multiobjective optimization problem (MOP) in the objective value space (Dolatnezhadsomarin et al 2019). In general, solving a MOP is associated with the construction of the Pareto frontier.…”
Section: Introductionmentioning
confidence: 99%
“…These compromise solutions, in which none of the objective functions can be improved in value without impairing at least one of the others, are often referred to as Pareto optimal or Pareto efficient (Neshatian and Zhang 2009). The set of all objective function values at the Pareto and weak Pareto solutions is said to be the Pareto front (or efficient set) of the multiobjective optimization problem (MOP) in the objective value space (Dolatnezhadsomarin et al 2019). In general, solving a MOP is associated with the construction of the Pareto frontier.…”
Section: Introductionmentioning
confidence: 99%
“…These compromise solutions, in which none of the objective functions can be improved in value without impairing at least one of the others, are often referred to as Pareto optimal or Pareto efficient Neshatian and Zhang (2009). The set of all objective function values at the Pareto and weak Pareto solutions is said to be the Pareto front (or efficient set) of the multi-objective optimization problem (MOP) in the objective value space Dolatnezhadsomarin et al (2019). In general, solving a MOP is associated with the construction of the Pareto frontier.…”
Section: Introductionmentioning
confidence: 99%