Computing non-dominated solutions in MOLFP
From MaRDI portal
Publication:877640
DOI10.1016/J.EJOR.2005.11.051zbMATH Open1123.90065OpenAlexW2067946148MaRDI QIDQ877640FDOQ877640
Authors: 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
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
- Programming with linear fractional functionals
- Title not available (Why is that?)
- Solving the sum-of-ratios problem by an interior-point method
- Fractional programming: The sum-of-ratios case
- Title not available (Why is that?)
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- A unified monotonic approach to generalized linear fractional programming
- A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- Minimization of the sum of three linear fractional functions
- Conical partition algorithm for maximizing the sum of dc ratios
- Goal programming with linear fractional criteria
- Multiple Objective Linear Fractional Programming
- Title not available (Why is that?)
- An interactive method for multiple objective linear fractional programming problems
Cited In (23)
- An exact method for a discrete multiobjective linear fractional optimization
- A reference point technique to compute nondominated solutions in MOLFP
- Fuzzy parametric iterative method for multi-objective linear fractional optimization problems
- Approximating the nondominated set of an MOLP by approximately solving its dual problem
- An efficient fuzzy mathematical approach to solve multi-objective fractional programming problem under fuzzy environment
- Solution approach to multi-objective linear fractional programming problem using parametric functions
- An iterative approach to solve multiobjective linear fractional programming problems
- A practicable branch and bound algorithm for sum of linear ratios problem
- An improved method for solving multiobjective integer linear fractional programming problem
- Flexible fractional transportation problem with multiple goals: a pentagonal fuzzy concept
- Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique
- An approximation to the nondominated set of a multiobjective linear fractional programming problem
- MOLFP
- 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 approach for solving fully fuzzy multi-objective linear fractional optimization problems
- Finding a solution for Multi-Objective Linear Fractional Programming problem based on goal programming and Data Envelopment Analysis
- Resource allocation: a common set of weights model
- A branch \& cut technique to solve a weighted-sum of linear ratios
- Title not available (Why is that?)
- On Pareto-optimality in the cross-efficiency evaluation
- GENERATING PARETO OPTIMAL SOLUTIONS OF MULTI-OBJECTIVE LFPP WITH INTERVAL COEFFICIENTS USING E-CONSTRAINT METHOD
- A computationally efficient algorithm to approximate the pareto front of multi-objective linear fractional programming problem
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)
