04.02.2015 Views

Stochastic Programming - Index of

Stochastic Programming - Index of

Stochastic Programming - Index of

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

BASIC CONCEPTS 51<br />

and hence<br />

P (λS 1 +(1− λ)S 2 ) ≥ min[P (S 1 ),P(S 2 )].<br />

As mentioned above, for the log-concave case necessary and sufficient<br />

conditions were derived first, and later corresponding conditions for quasiconcave<br />

measures were found.<br />

Proposition 1.6 Let P on Ξ=IR k be <strong>of</strong> the continuous type, i.e. have a<br />

density f. Then the following statements hold:<br />

• P is log-concave iff f is log-concave (i.e. if the logarithm <strong>of</strong> f is a concave<br />

function);<br />

• P is quasi-concave iff f −1/k is convex.<br />

The pro<strong>of</strong> has to be omitted here, since it would require a rather advanced<br />

knowledge <strong>of</strong> measure theory.<br />

Remark 1.4 Consider<br />

(a) the k-dimensional uniform distribution on a convex body S ⊂ IR k (with<br />

positive natural { measure µ) given by the density<br />

1/µ(S) if x ∈ S,<br />

ϕ U (x) :=<br />

0 otherwise<br />

(µ is the natural measure in IR k , see Section 1.4.1);<br />

(b) the exponential { distribution with density<br />

0 if x0 is constant);<br />

(c) the multivariate normal distribution in IR k described by the density<br />

ϕ N (x) :=γe − 1 2 (x−m)T Σ −1 (x−m)<br />

(γ > 0 is constant, m is the vector <strong>of</strong> expected values and Σ is the<br />

covariance matrix).<br />

Then we get immediately<br />

{ √<br />

k<br />

(a) ϕ − 1 k<br />

µ(S) if x ∈ S,<br />

U (x) = ∞ otherwise,<br />

implying by Proposition 1.6 that the corresponding propability measure<br />

P U is quasi-concave.<br />

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

Saved successfully!

Ooh no, something went wrong!