A genetic algorithm for solving linear fractional bilevel problems
From MaRDI portal
Publication:1026550
DOI10.1007/s10479-008-0416-0zbMath1163.90759OpenAlexW1966330430MaRDI QIDQ1026550
Herminia I. Calvete, Carmen Galé, Pedro M. Mateo
Publication date: 25 June 2009
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-008-0416-0
Related Items (4)
Metaheuristics for bilevel optimization: a comprehensive review ⋮ Systematic evolutionary algorithm for general multilevel Stackelberg problems with bounded decision variables (SEAMSP) ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ A genetic algorithm using a finite search space for solving nonlinear/linear fractional bilevel programming problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the quasiconcave bilevel programming problem
- Practical bilevel optimization. Algorithms and applications
- Solving linear fractional bilevel programs.
- Foundations of bilevel programming
- Linear bilevel programming solution by genetic algorithm
- A new approach for solving linear bilevel problems using genetic algorithms
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Feature Article—Genetic Algorithms for the Operations Researcher
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Genetic algorithm based approach to bi-level linear programming
- Programming with linear fractional functionals
This page was built for publication: A genetic algorithm for solving linear fractional bilevel problems