A deterministic bounding algorithm vs. a hybrid meta-heuristic to deal with a bilevel mixed-integer nonlinear optimization model for electricity dynamic pricing
From MaRDI portal
Publication:6164598
Recommendations
- A semivectorial bilevel programming approach to optimize electricity dynamic time-of-use retail pricing
- A deterministic bounding procedure for the global optimization of a bi-level mixed-integer problem
- Dynamic pricing in the electricity retail market: a stochastic bi-level approach
- Bilevel model for retail electricity pricing
- A bilevel approach to optimize electricity prices
Cites work
- A deterministic bounding procedure for the global optimization of a bi-level mixed-integer problem
- A value-function-based exact approach for the bilevel mixed-integer programming problem
- Bilevel optimization to deal with demand response in power grids: models, methods and challenges
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Global solution of nonlinear mixed-integer bilevel programs
- On the Value of Binary Expansions for General Mixed-Integer Linear Programs
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6164598)