Skip to main content

Abstract

In this chapter, we investigate the solution set of the minimum runtime and downtime conditions of a power plant, introduced in Section 3.1.3. When a plant is switched on, these restrictions ensure that the plant keeps running for a certain number of time steps and when it is turned off, it must remain off for a certain number of time steps, too. In our problem these restrictions have to be considered for the coal power plant in order to avoid increased thermal stress. In this chapter, we study the underlying 0/1 polytope for the stochastic formulation where uncertainty is modeled by a set of scenarios, as described in Section 3.2. Thus, we will call it stochastic switching polytope. For our studies, we used the software packages PORTA and POLYMAKE, see [CL] and [GJ00], in order to obtain a complete linear description of small instances.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Vieweg+Teubner Verlag | Springer Fachmedien Wiesbaden GmbH

About this chapter

Cite this chapter

Mahlke, D. (2011). Polyhedral Study of Stochastic Switching Polytopes. In: A Scenario Tree-Based Decomposition for Solving Multistage Stochastic Programs. Vieweg+Teubner. https://doi.org/10.1007/978-3-8348-9829-6_4

Download citation

Publish with us

Policies and ethics