04.02.2015 Views

Stochastic Programming - Index of

Stochastic Programming - Index of

Stochastic Programming - Index of

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

160 STOCHASTIC PROGRAMMING<br />

<br />

<br />

<br />

<br />

<br />

<br />

<br />

<br />

<br />

<br />

<br />

<br />

<br />

<br />

<br />

<br />

<br />

<br />

<br />

<br />

Figure 1 A map showing potential plant sites and actual fishing grounds for<br />

Southern Norway and the North Sea.<br />

The function Q(x, ξ) is called the recourse function, andQ(x) therefore the<br />

expected recourse function.<br />

In this chapter we shall look at only the case with fixed recourse, i.e. the<br />

case where W (ξ) ≡ W . Let us repeat a few terms from Section 1.4, in order<br />

to prepare for the next section. The cone pos W , mentioned in (4.17) <strong>of</strong><br />

Chapter 1, is defined by<br />

pos W = {t | t = Wy, y ≥ 0}.<br />

The cone pos W is illustrated in Figure 2. Note that<br />

Wy = h, y ≥ 0isfeasible ⇐⇒ h ∈ pos W.<br />

Recall that a problem has complete recourse if<br />

Among other things, this implies that<br />

pos W = R m .<br />

h(ξ) − T (ξ)x ∈ pos W for all ξ and all x.<br />

But that is definitely more than we need in most cases. Usually, it is more<br />

than enough to know that

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!