Enhancing computations of nondominated solutions in MOLFP via reference points

DOI10.1007/s10898-013-0074-xzbMath1285.90056MaRDI QIDQ2434626

Maria João Alves, João Paulo Costa

Publication date: 6 February 2014

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-013-0074-x

zbMATH Keywords

branch and cut; reference points; multiple objective fractional programming

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C29: Multi-objective and goal programming

90C32: Fractional programming

Uses Software

• MOLFP

Cites Work

• Unnamed Item
• Unnamed Item
• A linear programming approach to test efficiency in multi-objective linear fractional programming problems
• A reference point technique to compute nondominated solutions in MOLFP
• Generalized fractional programming: Algorithms and numerical experimentation
• Fractional programming: Applications and algorithms
• Goal programming with linear fractional criteria
• A simple method for obtaining weakly efficient points in multiobjective linear fractional programming problems
• Fractional programming: The sum-of-ratios case
• Multiple Objective Linear Fractional Programming
• A Branch & Cut Algorithm to Compute Nondominated Solutions in MOLFP via Reference Points
• Programming with linear fractional functionals
• Fractional Programming