A reference point technique to compute nondominated solutions in MOLFP

DOI10.1007/S10958-009-9603-ZMaRDI QIDQ844509zbMATH OpenOpenAlexWikidataFDO

Authors N. E. Zubov

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

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Fractional programming (90C32)

Recommendations

• Enhancing computations of nondominated solutions in MOLFP via reference points
• Computing non-dominated solutions in MOLFP
• A Branch \& Cut algorithm to compute nondominated solutions in MOLFP via reference points
• An interactive method for multiple objective linear fractional programming problems
• An approximation to the nondominated set of a multiobjective linear fractional programming problem

Cites work

• A branch-and-bound algorithm for maximizing the sum of several linear ratios
• A simple method for obtaining weakly efficient points in multiobjective linear fractional programming problems
• Computing non-dominated solutions in MOLFP
• Financial planning with fractional goals
• Fractional Programming
• Fractional programming: Applications and algorithms
• Generalized fractional programming: Algorithms and numerical experimentation
• Goal programming with linear fractional criteria
• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 1095224 (Why is no real title available?)
• scientific article; zbMATH DE number 1417900 (Why is no real title available?)
• Multiple Objective Linear Fractional Programming
• Programming with linear fractional functionals
• 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

Cited in

(17)

• Use of reference points of MOLP problems analysis
• Reference point approximation method for the solution of bicriterial nonlinear optimization problems
• Finding a weights-restricted efficient (extreme) point and using it for solving MOLP problems.
• Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique
• On the efficiency test in multi-objective linear fractional programming problems by Lotfi et al. 2010
• An iterative approach to solve multiobjective linear fractional programming problems
• Fuzzy efficient iterative method for multi-objective linear fractional programming problems
• Resource allocation: a common set of weights model
• Enhancing computations of nondominated solutions in MOLFP via reference points
• A branch-bound cut technique for non-linear fractional multi-objective optimization problems
• An approximation to the nondominated set of a multiobjective linear fractional programming problem
• 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
• A computationally efficient algorithm to approximate the Pareto front of multi-objective linear fractional programming problem
• Fuzzy parametric iterative method for multi-objective linear fractional optimization problems
• Finding efficient and properly efficient solutions of MOLFP problems based on linear approaches
• Computing non-dominated solutions in MOLFP

Describes a project that uses

Uses Software

• MOLFP

This page was built for publication: A reference point technique to compute nondominated solutions in MOLFP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844509)