A deterministic bounding algorithm vs. a hybrid meta-heuristic to deal with a bilevel mixed-integer nonlinear optimization model for electricity dynamic pricing

DOI10.1016/j.cor.2023.106195OpenAlexW4321378898MaRDI QIDQ6164598

Maria João Alves, Carlos Henggeler Antunes, Inês Soares

Publication date: 4 July 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2023.106195

zbMATH Keywords

demand responsehybrid meta-heuristicdynamic tariffselectricity retail marketbi-level mixed-integer nonlinear programmingoptimal-value-function approach

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Bilevel optimization to deal with demand response in power grids: models, methods and challenges
• Global solution of nonlinear mixed-integer bilevel programs
• A deterministic bounding procedure for the global optimization of a bi-level mixed-integer problem
• On the Value of Binary Expansions for General Mixed-Integer Linear Programs
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem

This page was built for publication: A deterministic bounding algorithm vs. a hybrid meta-heuristic to deal with a bilevel mixed-integer nonlinear optimization model for electricity dynamic pricing