REVIEW 1 cited by
Convex Hulls for the Unit Commitment Polytope
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
In this paper, we consider the polyhedral structure of the unit commitment polytope. In particular, we provide the convex hull results for the problem under the following different settings: 1) the convex hulls for the integrated minimum-up/-down time and ramping polytope under the general $T$ time period setting in which the ramping rate equals to the gap between the generation upper and lower bounds and equals to half of the gap between the generation upper and lower bounds, respectively, 2) the convex hull for the integrated minimum-up/-down time and ramping-up polytope for the problem under the general $T$ time period setting, and 3) the convex hull for the integrated minimum-up/-down time and ramping-down polytope for the problem under the general $T$ time period setting.
Forward citations
Cited by 1 Pith paper
-
Relax-and-Cut for Temporal SCUC Decomposition
A relax-and-cut temporal decomposition with partially relaxed look-ahead windows and dynamic N-1 cut separation solves SCUC faster than monolithic Gurobi while keeping primal gaps near 1%.
Discussion (0). Continue with ORCID to comment.