2013
DOI: 10.1080/02331934.2013.801473
|View full text |Cite
|
Sign up to set email alerts
|

Mixed integer parametric bilevel programming for optimal strategic bidding of energy producers in day-ahead electricity markets with indivisibilities

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 33 publications
0
4
0
Order By: Relevance
“…Consider the case that z i,t z i,t-1 1 first. Constraints (23) impose the restriction IRu i,t ≥ q i,t -q i,t-1 -ru i + 1, while constraints (24) impose the restriction IRu i,t ≤ q i,t −q i,t−1 +M i +m i −0.5ru i M i +m i +0.5ru i . Thus, IRu i,t is equal to 1 if and only if q i,t -q i,t-1 ru i .…”
Section: Single Period Necessary Optimality Conditionsmentioning
confidence: 99%
See 2 more Smart Citations
“…Consider the case that z i,t z i,t-1 1 first. Constraints (23) impose the restriction IRu i,t ≥ q i,t -q i,t-1 -ru i + 1, while constraints (24) impose the restriction IRu i,t ≤ q i,t −q i,t−1 +M i +m i −0.5ru i M i +m i +0.5ru i . Thus, IRu i,t is equal to 1 if and only if q i,t -q i,t-1 ru i .…”
Section: Single Period Necessary Optimality Conditionsmentioning
confidence: 99%
“…Next, consider the case z i,t 1, z i,t-1 0. Constraints (23) impose the restriction IRu i,t ≥ q i,t -m i − 0.5ru i + 1, while constraints (24) impose the restriction IRu i,t ≤ q i,t +M i M i +m i +0.5ru i . Thus, IRu i,t is equal to 1 if and only if q i,t m i + 0.5ru i , which denotes that the ramp-up constraint is binding in this case.…”
Section: Single Period Necessary Optimality Conditionsmentioning
confidence: 99%
See 1 more Smart Citation
“…Furthermore, we note that the solution of the bilevel problem represented in equation (5.33), which has been solved by discretization and "brute force" optimization is by itself a particularly challenging bilevel optimization problem. In a parallel to this thesis work [100], parametric integer programming has been employed to find a global optimal solution for an instance of this problem. Further elaboration and generalization of this approach is another direction for further research.…”
Section: Conclusion and Issues For Further Researchmentioning
confidence: 99%