Recommendations
- A reference point technique to compute nondominated solutions in MOLFP
- A branch \& cut technique to solve a weighted-sum of linear ratios
- scientific article; zbMATH DE number 3865006
- Enhancing computations of nondominated solutions in MOLFP via reference points
- An interactive method for multiple objective linear fractional programming problems
Cites work
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 1342815 (Why is no real title available?)
- scientific article; zbMATH DE number 1095224 (Why is no real title available?)
- A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- A unified monotonic approach to generalized linear fractional programming
- An interactive method for multiple objective linear fractional programming problems
- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- Conical partition algorithm for maximizing the sum of dc ratios
- Fractional programming: The sum-of-ratios case
- Goal programming with linear fractional criteria
- Minimization of the sum of three linear fractional functions
- Multiple Objective Linear Fractional Programming
- Programming with linear fractional functionals
- Solving the sum-of-ratios problem by an interior-point method
Cited in
(25)- Fuzzy parametric iterative method for multi-objective linear fractional optimization problems
- Resource allocation: a common set of weights model
- An improved method for solving multiobjective integer linear fractional programming problem
- An exact method for a discrete multiobjective linear fractional optimization
- Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique
- Flexible fractional transportation problem with multiple goals: a pentagonal fuzzy concept
- An approximation to the nondominated set of a multiobjective linear fractional programming problem
- Fuzzy efficient iterative method for multi-objective linear fractional programming problems
- On Pareto-optimality in the cross-efficiency evaluation
- A branch \& cut technique to solve a weighted-sum of linear ratios
- Approximating the nondominated set of an MOLP by approximately solving its dual problem
- A computationally efficient algorithm to approximate the Pareto front of multi-objective linear fractional programming problem
- An efficient fuzzy mathematical approach to solve multi-objective fractional programming problem under fuzzy environment
- scientific article; zbMATH DE number 3865006 (Why is no real title available?)
- An iterative approach to solve multiobjective linear fractional programming problems
- Generating Pareto optimal solutions of multi-objective LFPP with interval coefficients using \(\epsilon \)-constraint method
- MOLFP
- Solution approach to multi-objective linear fractional programming problem using parametric functions
- Finding a solution for multi-objective linear fractional programming problem based on goal programming and data envelopment analysis
- A Branch \& Cut algorithm to compute nondominated solutions in MOLFP via reference points
- An approach for solving fully fuzzy 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
- Enhancing computations of nondominated solutions in MOLFP via reference points
- On the efficiency test in multi-objective linear fractional programming problems by Lotfi et al. 2010
This page was built for publication: Computing non-dominated solutions in MOLFP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877640)
