A computationally efficient algorithm to approximate the pareto front of multi-objective linear fractional programming problem

DOI10.1051/ro/2018083zbMath1425.90107OpenAlexW2890988800MaRDI QIDQ5244299

Milan Stanojević, Bogdana Stanojević

Publication date: 20 November 2019

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2018083

zbMATH Keywords

fractional programmingefficient solutionmultiple objective programmingnon-dominated point0th order approximation

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Fractional programming (90C32)

Related Items (1)

Parametric approach to quadratically constrained multi-level multi-objective quadratic fractional programming

Uses Software

• MOLFP

Cites Work

• Unnamed Item
• Global solutions to fractional programming problem with ratio of nonconvex functions
• Maximizing for the sum of ratios of two convex functions over a convex set
• A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
• Constructing a Pareto front approximation for decision making
• A linear programming approach to test efficiency in multi-objective linear fractional programming problems
• A reference point technique to compute nondominated solutions in MOLFP
• Computing non-dominated solutions in MOLFP
• Bicriteria linear fractional programming
• On the efficiency test in multi-objective linear fractional programming problems by Lotfi et al. 2010
• The controlled estimation method in the multiobjective linear fractional problem
• An iterative approach to solve multiobjective linear fractional programming problems
• A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
• Equispaced Pareto front construction for constrained bi-objective optimization
• Finding representative systems for discrete bicriterion optimization problems
• Approximation methods in multiobjective programming
• An approximation to the nondominated set of a multiobjective linear fractional programming problem
• Multiple Objective Linear Fractional Programming

This page was built for publication: A computationally efficient algorithm to approximate the pareto front of multi-objective linear fractional programming problem