A reference point technique to compute nondominated solutions in MOLFP
From MaRDI portal
Publication:844509
DOI10.1007/s10958-009-9603-zzbMath1192.90189OpenAlexW2069539857WikidataQ57664310 ScholiaQ57664310MaRDI QIDQ844509
Publication date: 19 January 2010
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-009-9603-z
Related Items
Fuzzy parametric iterative method for multi-objective linear fractional optimization problems ⋮ Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique ⋮ A branch-bound cut technique for non-linear fractional multi-objective optimization problems ⋮ Enhancing computations of nondominated solutions in MOLFP via reference points ⋮ Finding a solution for Multi-Objective Linear Fractional Programming problem based on goal programming and Data Envelopment Analysis ⋮ An iterative approach to solve multiobjective linear fractional programming problems ⋮ Fuzzy efficient iterative method for multi-objective linear fractional programming problems ⋮ 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 ⋮ Resource allocation: a common set of weights model ⋮ A Branch & Cut Algorithm to Compute Nondominated Solutions in MOLFP via Reference Points ⋮ A computationally efficient algorithm to approximate the pareto front of multi-objective linear fractional programming problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- Computing non-dominated solutions in MOLFP
- Generalized fractional programming: Algorithms and numerical experimentation
- Fractional programming: Applications and algorithms
- Goal programming with linear fractional criteria
- Financial planning with fractional goals
- A simple method for obtaining weakly efficient points in multiobjective linear fractional programming problems
- Solving the sum-of-ratios problem by an interior-point method
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
- Multiple Objective Linear Fractional Programming
- Programming with linear fractional functionals
- Fractional Programming