Eneko C. Clemente

Dimensionality Reduction in Bilevel Linear Programming

  • Eneko C. Clemente
  • Oleg A. Prokopyev
    • Categories Bilevel Optimization, Combinatorial Optimization, Polyhedra Tags , ,

    We consider bilevel programs that involve a leader, who first commits to a mixed-integer decision, and a follower, who observes this decision and then responds rationally by solving a linear program (LP). Standard approaches often reformulate these bilevel optimization problems as single-level mixed-integer programs by exploiting the follower’s LP optimality conditions. These reformulations introduce either … Read more

    On Local Search in Bilevel Mixed-Integer Linear Programming

  • Eneko C. Clemente
  • Oleg A. Prokopyev
    • Categories Bilevel Optimization, Game Theory, Other Topics Tags , ,

    Two-level hierarchical decision-making problems, where a leader’s choice influences a follower’s action, arise across key business and public-sector domains, from market design and pricing to defense. These problems are typically modeled as bilevel programs and are known to be notoriously hard to solve at scale. In single-level combinatorial optimization, especially for challenging instances, local search … Read more