A deterministic bounding procedure for the global optimization of a bi-level mixed-integer problem
From MaRDI portal
Publication:2029945
DOI10.1016/j.ejor.2020.09.015zbMath1487.90492OpenAlexW3087571207MaRDI QIDQ2029945
Carlos Henggeler Antunes, Inês Soares, Maria João Alves
Publication date: 4 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.09.015
global optimizationbi-level optimizationdemand responsepricing problemmixed-integer linear programming modeldynamic tariffselectricity retail market
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Economic models of real-world systems (e.g., electricity markets, etc.) (91B74)
Related Items
Dynamic pricing and strategic retailers in the energy sector: a multi-leader-follower approach, Job scheduling under time-of-use energy tariffs for sustainable manufacturing: a survey, A deterministic bounding algorithm vs. a hybrid meta-heuristic to deal with a bilevel mixed-integer nonlinear optimization model for electricity dynamic pricing
Cites Work
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- Enhanced exact algorithms for discrete bilevel linear problems
- Linear bilevel programming with upper level constraints depending on the lower level solution
- Global solution of bilevel programs with a nonconvex inner program
- Discrete linear bilevel programming problem
- Global solution of nonlinear mixed-integer bilevel programs
- A trilevel model for best response in energy demand-side management
- Global optimization of mixed-integer bilevel programming problems
- Intersection Cuts for Bilevel Optimization
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
- A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem
- The Mixed Integer Linear Bilevel Programming Problem