A genetic approach for solving bi-level programming problems

MaRDI QIDQ4612273zbMATH OpenFDO

Authors Eghbal Hosseini, Isa Nakhai Kamalabadi

Publication date 31 January 2019

Full work available at URL https://camo.ici.ro/journal/vol15/v15c13.pdf

zbMATH Keywords

genetic algorithmKarush-Kuhn-Tucker conditionslinear bi-level programming problem

Mathematics Subject Classification ID

Linear programming (90C05) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A solution methodology of bi-level linear programming based on genetic algorithm
• Linear bilevel programming solution by genetic algorithm
• Genetic algorithm for solving quadratic bilevel programming problem
• Application of Genetic Algorithm for Solving Bilevel Linear Programming Problems
• An adaptive genetic algorithm for solving bilevel linear programming problem

Cited in

(7)

• A proposed approach for solving rough bi-level programming problems by genetic algorithm
• Lagrangean relaxation-based algorithm for bi-level problems
• Genetic algorithm for solving quadratic bilevel programming problem
• Enhancing the solution method of linear bi-level programming problem based on enumeration method and dual method
• Enhancing the solution method of linear bi-level programming problem based on combining PSO algorithm with a modified genetic algorithm
• Genetic algorithm based approach to bi-level linear programming
• A solution methodology of bi-level linear programming based on genetic algorithm

This page was built for publication: A genetic approach for solving bi-level programming problems

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