A hybrid tabu-ascent algorithm for the linear bilevel programming problem

DOI10.1007/BF00121266zbMath0859.90097OpenAlexW2093490324MaRDI QIDQ1815061

Michel Gendreau, Gilles Savard, Patrice Marcotte

Publication date: 10 April 1997

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

Full work available at URL: https://doi.org/10.1007/bf00121266

zbMATH Keywords

NP-hard problemTabu Searchadaptive searchlinear bilevel programminglinear hirarchical decision process

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27) Hierarchical systems (93A13)

Related Items

Multilevel decision-making: a survey, A class of expected value bilevel programming problems with random coefficients based on rough approximation and its application to a production-inventory system, Metaheuristics for bilevel optimization: a comprehensive review, Application of Genetic Algorithm for Solving Bilevel Linear Programming Problems, Linear bilevel programming solution by genetic algorithm, A hybrid of genetic algorithm and particle swarm optimization for solving bi-level linear programming problem -- a case study on supply chain model, A stone resource assignment model under the fuzzy environment, A cooperative coevolution PSO technique for complex bilevel programming problems and application to watershed water trading decision making problems, Feature selection for classification models via bilevel optimization, Solving bi-level linear programming problem through hybrid of immune genetic algorithm and particle swarm optimization algorithm, A new approach for solving linear bilevel problems using genetic algorithms, A mixed-integer bilevel programming approach for a competitive prioritized set covering problem, A dynamic reformulation heuristic for generalized interdiction problems, Bi-level programming model and hybrid genetic algorithm for flow interception problem with customer choice, Bilevel model for production-distribution planning solved by using ant colony optimization, Application of particle swarm optimization algorithm for solving bi-level linear programming problem, Exact and inexact penalty methods for the generalized bilevel programming problem, A natural gas cash-out problem: a bilevel programming framework and a penalty function method, Bi-level programming problem in the supply chain and its solution algorithm, A New Method To Solve Bi-Level Quadratic Linear Fractional Programming Problems, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Uses Software

• XMP

Cites Work

• A sequential LCP method for bilevel linear programming
• Descent approaches for quadratic bilevel programming
• Bilevel and multilevel programming: A bibliography review
• The steepest descent direction for the nonlinear bilevel programming problem
• An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem
• A Branch and Bound Algorithm for the Bilevel Programming Problem
• A Note on: An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem
• The polynomial hierarchy and a simple model for competitive analysis
• On two-level optimization
• Tabu Search—Part I
• Tabu Search—Part II
• New Branch-and-Bound Rules for Linear Bilevel Programming
• Novel approaches to the discrimination problem
• Genetic algorithm based approach to bi-level linear programming
• A solution method for the linear static Stackelberg problem using penalty functions