Tight MIP formulations of the power-based unit commitment problem (Q747751): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A polyhedral study of production ramping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-up/min-down polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-scale unit commitment under uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4649021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254875 / rank
 
Normal rank

Latest revision as of 22:48, 10 July 2024

scientific article
Language Label Description Also known as
English
Tight MIP formulations of the power-based unit commitment problem
scientific article

    Statements

    Tight MIP formulations of the power-based unit commitment problem (English)
    0 references
    0 references
    0 references
    0 references
    19 October 2015
    0 references
    convex hull
    0 references
    unit commitment
    0 references
    mixed integer programming
    0 references
    tight formulation
    0 references
    slow-start units
    0 references
    quick-start units
    0 references

    Identifiers