Generating the efficient set of multiobjective integer linear plus linear fractional programming problems
DOI10.1007/S10479-020-03581-0zbMATH Open1460.90163OpenAlexW3013126693MaRDI QIDQ828869FDOQ828869
Authors: Yasmine Cherfaoui, Mustapha Moulai 
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
Recommendations
- An improved method for solving multiobjective integer linear fractional programming problem
- Optimizing a linear fractional function over the integer efficient set
- Optimization over an integer efficient set of a multiple objective linear fractional problem
- An exact method for a discrete multiobjective linear fractional optimization
- An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program
Multi-objective and goal programming (90C29) Fractional programming (90C32) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10)
Cites Work
- Programming with linear fractional functionals
- An approach for multiobjecive linear plus linear fractional programming problem
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- Minimization of the sum of three linear fractional functions
- The sum of a linear and a linear fractional transportation problem with restricted and enhanced flow
- On Maximizing a Sum of Ratios
- 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
- Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems
- Equivalence in linear fractional programming
- Hyperbolic programming
- An exact method for a discrete multiobjective linear fractional optimization
Cited In (3)
- An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications
- An improved method for solving multiobjective integer linear fractional programming problem
- Branch and cut method for solving integer indefinite quadratic bilevel programs
This page was built for publication: Generating the efficient set of multiobjective integer linear plus linear fractional programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q828869)
