MOLFP

swMATH2999MaRDI QIDQ15534FDOQ15534

Author name not available (Why is that?)

Official website: http://www.sciencedirect.com/science/article/pii/S0377221706002013

Described by source

• Computing non-dominated solutions in MOLFP

Cited In (21)

• An exact method for a discrete multiobjective linear fractional optimization
• Scalarizing fuzzy multi-objective linear fractional programming with application
• Title not available (Why is that?)
• A reference point technique to compute nondominated solutions in MOLFP
• Fuzzy parametric iterative method for multi-objective linear fractional optimization problems
• A computationally efficient algorithm to approximate the Pareto front of multi-objective linear fractional programming problem
• 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
• 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
• Optimization over an integer efficient set of a multiple objective linear fractional problem
• A branch-bound cut technique for non-linear fractional multi-objective optimization problems
• Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique
• 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
• A taxonomy and review of the multi-objective fractional programming (MOFP) problems
• Enhancing computations of nondominated solutions in MOLFP via reference points
• An interactive method for multiple objective linear fractional programming problems
• On Pareto-optimality in the cross-efficiency evaluation
• A Branch \& Cut algorithm to compute nondominated solutions in MOLFP via reference points

This page was built for software: MOLFP