Generating the efficient set of multiobjective integer linear plus linear fractional programming problems

DOI10.1007/s10479-020-03581-0zbMath1460.90163OpenAlexW3013126693MaRDI QIDQ828869

Mustapha Moulaï, Yasmine Cherfaoui

Publication date: 5 May 2021

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-020-03581-0

zbMATH Keywords

integer programmingmultiobjective programmingfractional programmingbranch-and-cut

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Fractional programming (90C32)

Related Items (1)

Branch and cut method for solving integer indefinite quadratic bilevel programs

Cites Work

• Unnamed Item
• A branch-and-bound algorithm for maximizing the sum of several linear ratios
• An exact method for a discrete multiobjective linear fractional optimization
• The sum of a linear and linear fractional function and a three dimensional transportation problem
• Dual of the sum of a linear and linear fractional program
• Minimization of the sum of three linear fractional functions
• Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems
• On Maximizing a Sum of Ratios
• Equivalence in linear fractional programming
• BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
• Programming with linear fractional functionals
• Hyperbolic programming
• The sum of a linear and a linear fractional transportation problem with restricted and enhanced flow

This page was built for publication: Generating the efficient set of multiobjective integer linear plus linear fractional programming problems