Disjunctive cuts for continuous linear bilevel programming
From MaRDI portal
Publication:2463829
DOI10.1007/s11590-006-0024-3zbMath1127.90069OpenAlexW2022954527MaRDI QIDQ2463829
Jean-Paul Haddad, Charles Audet, Gilles Savard
Publication date: 6 December 2007
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-006-0024-3
Related Items
Multilevel decision-making: a survey, Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints, A computational study for bilevel quadratic programs using semidefinite relaxations, Intersection Cuts for Bilevel Optimization, SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs, A survey on mixed-integer programming techniques in bilevel optimization, On Bilevel Optimization with Inexact Follower, Mixed-integer bilevel representability, Enhanced exact algorithms for discrete bilevel linear problems, A dynamic reformulation heuristic for generalized interdiction problems, On a class of bilevel linear mixed-integer programs in adversarial settings, A cutting plane method for bilevel linear programming with interval coefficients, Solving linear programs with complementarity constraints using branch-and-cut, A solution to bi/tri-level programming problems using particle swarm optimization, Closing the gap in linear bilevel optimization: a new valid primal-dual inequality, On the use of intersection cuts for bilevel optimization, The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem, Algorithms for Linear Bilevel Optimization, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Unnamed Item
- Lift-and-project for mixed 0-1 programming: recent progress
- Multicriteria approach to bilevel optimization
- A theoretical approximation scheme for Stackelberg problems
- Descent approaches for quadratic bilevel programming
- Links between linear bilevel and mixed 0-1 programming problems
- A bilevel programming approach to determining tax credits for biofuel production
- A symmetrical linear maxmin approach to disjoint bilinear programming
- Linear bilevel programming solution by genetic algorithm
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- New branch-and-Cut algorithm for bilevel linear programming
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- New Branch-and-Bound Rules for Linear Bilevel Programming
