Computing non-dominated solutions in MOLFP

DOI10.1016/j.ejor.2005.11.051zbMath1123.90065OpenAlexW2067946148MaRDI QIDQ877640

João Paulo Costa

Publication date: 3 May 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10316/5486

zbMATH Keywords

sum of linear ratiosmultiobjective linear fractional programmingweight indifference regions

Mathematics Subject Classification ID

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

Related Items (20)

Fuzzy parametric iterative method for multi-objective linear fractional optimization problems ⋮ A reference point technique to compute nondominated solutions in MOLFP ⋮ A practicable branch and bound algorithm for sum of linear ratios problem ⋮ An approach for solving fully fuzzy multi-objective linear fractional optimization problems ⋮ Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique ⋮ An efficient fuzzy mathematical approach to solve multi-objective fractional programming problem under fuzzy environment ⋮ Flexible fractional transportation problem with multiple goals: a pentagonal fuzzy concept ⋮ Finding a solution for Multi-Objective Linear Fractional Programming problem based on goal programming and Data Envelopment Analysis ⋮ Solution approach to multi-objective linear fractional programming problem using parametric functions ⋮ An exact method for a discrete multiobjective linear fractional optimization ⋮ An iterative approach to solve multiobjective linear fractional programming problems ⋮ Fuzzy efficient iterative method for multi-objective linear fractional programming problems ⋮ An improved method for solving multiobjective integer linear fractional programming problem ⋮ On Pareto-optimality in the cross-efficiency evaluation ⋮ On the efficiency test in multi-objective linear fractional programming problems by Lotfi et al. 2010 ⋮ An approximation to the nondominated set of a multiobjective linear fractional programming problem ⋮ MOLFP ⋮ Resource allocation: a common set of weights model ⋮ A computationally efficient algorithm to approximate the pareto front of multi-objective linear fractional programming problem ⋮ GENERATING PARETO OPTIMAL SOLUTIONS OF MULTI-OBJECTIVE LFPP WITH INTERVAL COEFFICIENTS USING E-CONSTRAINT METHOD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A branch-and-bound algorithm for maximizing the sum of several linear ratios
• Computational experience concerning payoff tables and minimum criterion values over the efficient set
• Goal programming with linear fractional criteria
• A unified monotonic approach to generalized linear fractional programming
• Minimization of the sum of three linear fractional functions
• Solving the sum-of-ratios problem by an interior-point method
• Conical partition algorithm for maximizing the sum of dc ratios
• An interactive method for multiple objective linear fractional programming problems
• Fractional programming: The sum-of-ratios case
• Multiple Objective Linear Fractional Programming
• Programming with linear fractional functionals
• A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems

This page was built for publication: Computing non-dominated solutions in MOLFP