Utilizing the redundant constraints for the uplift payment elimination
Vadim Borokhov

TL;DR
This paper proposes a method using redundant constraints and their Lagrangian relaxation to eliminate uplift payments in non-convex power markets without affecting market prices or duality gaps.
Contribution
It introduces a novel approach to reduce uplift payments by exploiting redundant constraints that do not alter the centralized dispatch outcome.
Findings
Redundant constraints can be constructed to eliminate uplift payments.
Lagrangian relaxation of these constraints reduces uplift payments without changing the duality gap.
The approach applies to markets with fixed load and can be extended to price-sensitive load scenarios.
Abstract
A power market with non-convexities may not have an equilibrium price for power that provides economic stability of the centralized dispatch outcome. In this case, the market players are entitled to receive the uplift payments that compensate the economic profit lost when following the centralized dispatch. We consider a special class of the (possibly non-linear) redundant constraints that are redundant not only on the feasible set of the centralized dispatch optimization problem (and, therefore, do not change the centralized dispatch outcome) but also on the larger set obtained when the power balance constraint is relaxed. We show that the Lagrangian relaxation of these redundant constraints may reduce the uplift payments without changing the duality gap. For any given market price (or a pricing algorithm that sets the producer revenue as a function of its output volume) in a uninode…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
