Bilevel aggregator-prosumers' optimization problem in real-time: a convex optimization approach

DOI10.1016/j.orl.2022.08.008OpenAlexW3193940471MaRDI QIDQ2084039

M. Kanat Camlibel, Jacquelien M. A. Scherpen, Koorosh Shomalzadeh

Publication date: 17 October 2022

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.06251

zbMATH Keywords

convex optimizationcomputational efficiencybilevel optimizationreal-time electricity market

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem
• New formulations and valid inequalities for a bilevel pricing problem
• A single-level reformulation of mixed integer bilevel programming problems
• A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs
• An overview of bilevel optimization
• Bilevel Programming Problems

This page was built for publication: Bilevel aggregator-prosumers' optimization problem in real-time: a convex optimization approach