An approximation to the nondominated set of a multiobjective linear fractional programming problem
From MaRDI portal
Recommendations
- A computationally efficient algorithm to approximate the Pareto front of multi-objective linear fractional programming problem
- Approximating the nondominated set of an MOLP by approximately solving its dual problem
- APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING
- An approximation algorithm for convex multi-objective programming problems
- Approximating the noninferior set in multiobjective linear programming problems
Cites work
- A compromise procedure for the multiple objective linear fractional programming problem
- A reference point technique to compute nondominated solutions in MOLFP
- A simple method for obtaining weakly efficient points in multiobjective linear fractional programming problems
- An approximation method for the efficiency set of multiobjective programming problems
- An iterative approach to solve multiobjective linear fractional programming problems
- Approximation methods in multiobjective programming
- Computing non-dominated solutions in MOLFP
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Multiple Objective Linear Fractional Programming
- Norm-based approximation in bicriteria programming
- Note—Finding Certain Weakly-Efficient Vertices in Multiple Objective Linear Fractional Programming
- On the efficiency test in multi-objective linear fractional programming problems by Lotfi et al. 2010
- Programming with linear fractional functionals
- The controlled estimation method in the multiobjective linear fractional problem
- \(\epsilon\)-solutions in vector minimization problems
Cited in
(13)- Parametric approach to quadratically constrained multi-level multi-objective quadratic fractional programming
- A reference point technique to compute nondominated solutions in MOLFP
- The controlled estimation method in the multiobjective linear fractional problem
- APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING
- A computationally efficient algorithm to approximate the Pareto front of multi-objective linear fractional programming problem
- Approximating the nondominated set of an MOLP by approximately solving its dual problem
- Approximating the noninferior set in multiobjective linear programming problems
- On fuzzy linearization approaches for solving multi-objective linear fractional programming problems
- First- and second-order optimality conditions for multiobjective fractional programming
- An algorithm for quadratically constrained multi-objective quadratic fractional programming with pentagonal fuzzy numbers
- Fuzzy efficient iterative method for multi-objective linear fractional programming problems
- A taxonomy and review of the multi-objective fractional programming (MOFP) problems
- Covers and approximations in multiobjective optimization
This page was built for publication: An approximation to the nondominated set of a multiobjective linear fractional programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817230)