Assignment 3 for Stochastic Optimization | ISYE 6664, Assignments of Systems Engineering

Material Type: Assignment; Class: Stochastic Optimization; Subject: Industrial & Systems Engr; University: Georgia Institute of Technology-Main Campus; Term: Fall 2007;

Typology: Assignments

Pre 2010

Uploaded on 08/05/2009

koofers-user-u4n
koofers-user-u4n šŸ‡ŗšŸ‡ø

10 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
ISyE 6664 Stochastic Optimization
Fall 2007
Assignment 3
Issued: September 20, 2007
Due: September 27, 2007
All problems in this assignment can be done in groups of 2.
Problem 1
We want to calculate the following expected value (d-dimensional integral) of fd(ω), where
ωis uniformly distributed on the hypercube [0,10]d:
Ed[fd(ω)] = [0,10]d
d
ī˜‚
i=1 10
āˆšĻ‰i
+ωisin(ω2
i)ī˜„1
10ddω
Note that this integral decomposes into a separate integral for each dimension, and is easy
to calculate exactly. Calculate the exact value of Ed[fd(ω)]. Now pretend that the integral
does not decompose. The objective is to empirically compare the efficiency of different
computational methods for approximating Ed[fd(ω)]. Use a multidimensional numerical
integration method of your choice, such as the trapezoid method or Simpson’s method.
Note: Do not simply calculate the one-dimensional integrals with a numerical integration
method and then use the results. Although that would be correct for this particular integral
because of its simple form, the point of the exercise is to compare the accuracy and efficiency
of different methods for computing multidimensional integrals. Also use a random sampling
method (Monte Carlo integration). Compute Ed[fd(ω)] with these methods, for d=1,2,...,
(see how large you can make dwith less than 2 hours of computing time) and for varying
number nof points ωjwhere the function fd(ωj) is evaluated. For each of these combinations
of method, d,andn, compute the root square error (which you can do exactly, but which is
random for the sampling method). For the sampling method, you may want to obtain a more
accurate estimate of the root mean square error by replicating the experiment a number of
times. Make plots of the root mean square error versus n, and compare the efficiency of the
methods for different d.
pf2

Partial preview of the text

Download Assignment 3 for Stochastic Optimization | ISYE 6664 and more Assignments Systems Engineering in PDF only on Docsity!

ISyE 6664 Stochastic Optimization

Fall 2007

Assignment 3

Issued: September 20, 2007

Due: September 27, 2007

All problems in this assignment can be done in groups of 2.

Problem 1 We want to calculate the following expected value (d-dimensional integral) of fd(ω), where ω is uniformly distributed on the hypercube [0, 10]d:

Ed[fd(ω)] =

[0,10]d

āˆ^ d

i=

[

ωi

  • ωi sin(ω^2 i )

]

10 d^

dω

Note that this integral decomposes into a separate integral for each dimension, and is easy to calculate exactly. Calculate the exact value of Ed[fd(ω)]. Now pretend that the integral does not decompose. The objective is to empirically compare the efficiency of different computational methods for approximating Ed[fd(ω)]. Use a multidimensional numerical integration method of your choice, such as the trapezoid method or Simpson’s method. Note: Do not simply calculate the one-dimensional integrals with a numerical integration method and then use the results. Although that would be correct for this particular integral because of its simple form, the point of the exercise is to compare the accuracy and efficiency of different methods for computing multidimensional integrals. Also use a random sampling method (Monte Carlo integration). Compute Ed[fd(ω)] with these methods, for d = 1, 2 ,.. ., (see how large you can make d with less than 2 hours of computing time) and for varying number n of points ωj^ where the function fd(ωj^ ) is evaluated. For each of these combinations of method, d, and n, compute the root square error (which you can do exactly, but which is random for the sampling method). For the sampling method, you may want to obtain a more accurate estimate of the root mean square error by replicating the experiment a number of times. Make plots of the root mean square error versus n, and compare the efficiency of the methods for different d.

ISyE 6664 Ā· Fall 2007 Ā· Assignment 3 2

Problem 2 Consider the following optimization problem:

min x∈{āˆ’ 1 , 0 , 1 }^3

{g(x) ≔ E[G(x, ω)]} (1)

where ω ∈ Ī© = R^9 , G(x, ω) ≔ a(ω)T^ x + xT^ B(ω)x

and a(ω) ≔ (0.1 + ω 1 , 0 .2 + ω 2 , 0 .3 + ω 3 )T

and

B(ω) ≔

1 + ω 11 , 0 .7 + ω 12 , 0 .8 + ω 13 0 .7 + ω 12 , 1 + ω 22 , 0 .9 + ω 23 0 .8 + ω 13 , 0 .9 + ω 23 , 1 + ω 33

Each ωi and ωij has mean 0. Note that it is easy to calculate g(x) for each x ∈ {āˆ’ 1 , 0 , 1 }^3 , and thus it is easy to solve the optimization problem (1) by enumeration. Go ahead and solve the optimization problem (1). Now pretend that it is not that easy to calculate g(x) for each x. Assume that the random variables ωi and ωij are all independent, with each ωi uniformly distributed on [āˆ’ 2 , 2], and each ωij uniformly distributed on [āˆ’ 1 , 1]. Use a ranking and selection method to choose a solution. Specify the method that you use. Compare the method’s actual performance with the method’s predicted performance. Evaluate the sensitivity of the performance of the method with respect to deviations from the assumptions of the method. Evaluate the efficiency of the method.