

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Material Type: Assignment; Class: Stochastic Optimization; Subject: Industrial & Systems Engr; University: Georgia Institute of Technology-Main Campus; Term: Fall 2007;
Typology: Assignments
1 / 2
This page cannot be seen from the preview
Don't miss anything!


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
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.