Dibuat Diperiksa Mengetahui
Tanggal 11 Oktober 2014 Tanggal 11 Oktober 2014 Tanggal 11 Oktober 2014
Oleh Ira Ulya Oleh Sandi Kurnia Oleh Akbar Russavel N
Jabatan Asisten Jabatan Koordinator Tutorial Jabatan Koordinator Asisten
Tanda Tangan
Tanda Tangan
Tanda Tangan
DEPARTEMEN PENDIDIKAN NASIONAL
UNIVERSITAS ANDALAS FAKULTAS TEKNIK
JURUSAN TEKNIK INDUSTRI
LABORATORIUM PERENCANAAN DAN OPTIMASI SISTEM INDUSTRI
1. The sales manager for a publisher of college textbooks has six traveling salespeople to assign to three different regions of the country. She has decided that each region should be assigned at least one salesperson and that each individual salesperson should be restricted to one of the regions, but now she wants to determine how many salespeople should be assigned to the respective regions in order to maximize sales. The following table gives the estimated increase in sales (in appropriate units) in each region if it were allocated various numbers of salespeople:
Use dynamic programming to solve this problem
2. Use dynamic programming to solve this problem
3. Imagine that you have $5,000 to invest and that you will have an opportunity to invest
that amount in either of two investif ments (A or B) at the beginning of each of the next 3 years. Both investments have uncertain returns. For investment A you will either lose your money entirely or (with higher probability) get back $10,000 (a profit of $5,000) at the end of the year. For investment B you will get back either just your $5,000 or (with low probability) $10,000 at the end of the year. The probabilities for these events are as follows:
Dibuat Diperiksa Mengetahui
Tanggal 11 Oktober 2014 Tanggal 11 Oktober 2014 Tanggal 11 Oktober 2014
Oleh Ira Ulya Oleh Sandi Kurnia Oleh Akbar Russavel N
Jabatan Asisten Jabatan Koordinator Tutorial Jabatan Koordinator Asisten
Tanda Tangan
Tanda Tangan
Tanda Tangan
DEPARTEMEN PENDIDIKAN NASIONAL
UNIVERSITAS ANDALAS FAKULTAS TEKNIK
JURUSAN TEKNIK INDUSTRI
LABORATORIUM PERENCANAAN DAN OPTIMASI SISTEM INDUSTRI
You are allowed to make only (at most) one investment each year, and you can invest only
$5,000 each time. (Any additional money accumulated is left idle.) a. Use dynamic programming to find the investment policy that maximizes the
expected amount of money you will have after 3 years. b. Use dynamic programming to find the investment policy that maximizes the
probability that you will have at least $10,000 after 3 years.