Discrete dynamic programming - additional problems

1. In the network provided below, find the shortest path from node 1 to node 10 and the shortest path
from node 2 to node 10.
2. A company mst meet the following demands on time! month 1, 1 nit! month 2, 1 nit" month #, 2
nits! month $, 2 nits. It costs %$ to place an order, and a %2 per-nit holding cost is assessed against each
month&s ending inventory. At the beginning of month 1, 1 nit is available. 'rders are delivered
instantaneosly.
(se a backward recrsion to determine an optimal ordering policy.
(se a forward recrsion to determine an optimal ordering policy.
(se the )agner-)hitin method to determine an optimal ordering policy.
(se the *ilver-+eal heristic to determine an ordering policy.
#. ,econsider -roblem 2, bt now sppose that demands need not be met on- time. Assme that all
lost demand is backlogged and that a % 1 per-nit shortage cost is assessed against the nmber of shortages
incrred dring each month. All demand mst be met by the end of month $. (se dynamic programming to
determine an ordering policy that minimi.es total cost.
$. Indianapolis Airlines has been told that it may schedle / flights per day departing from
Indianapolis. 0he destination of each flight may be 1ew 2ork, 3os Angeles, or +iami. 0he table below
shows the contribtion to the company&s profit from any given nmber of daily flights from Indianapolis to
each possible destination. 4ind the optimal nmber of flights that shold depart Indianapolis for each
destination.
Destinatio
n
1mber of planes
1 2 # $ 5 /
1ew 2ork 60 150 210 250 270 260
3os Angeles 100 185 275 #25 #50 250
+iami 80 160 2/5 #10 #50 #20
5. I am working as a cashier at the local convenience store. A cstomer&s bill is %1.08, and he gives me
%2.00. I want to give him change sing the smallest possible nmber of coins. (se dynamic programming
to determine how to give the cstomer his change. Does the answer sggest a general reslt abot giving
change9 ,esolve the problem if a 20c piece :in addition to other (nited *tates coins; were available.
5
$
#
8
6
7
/
1
0
2
1
#
2
$
2
$
#
2
$
2
2
2
5
#
$
2
#
/. A company needs to have a working machine dring each of the ne<t si< years. At present, it has a
new machine. At the beginning of each year, the company may keep the machine or sell it and by a new
one. A machine cannot be kept for more than three years. A new machine costs %5000. 0he revenes
earned by a machine, the cost of maintaining it, and the salvage vale that can be obtained by selling it at
the end of a year depend on the age of the machine :see the 0able provided below;. (se dynamic
programming to ma<imi.e the net profit earned dring the ne<t si< years.
7. A company needs the following nmber of workers dring each of the ne<t five years! year 1, 15"
year 2, #0" year #, 10" year $, #0" year 5, 20. At present, the company has 20 workers. =ach worker is
paid %#0,000 per year. At the beginning of each year, workers may be hired or fired. It costs %10,000 to hire
a worker and %20,000 to fire a worker. A newly hired worker can be sed to meet the crrent year&s worker
re>irement. Dring each year, 10?& of all workers >it :workers who >it do not incr any firing cost;.
)ith dynamic programming, formlate a recrsion that can be sed to minimi.e the total cost incrred in
meeting the worker re>irements of the ne<t five years.
Age of machine at the
beginning of year
0 1 2
,evenes
'perating
costs
*alvage
:at the
end of
year;
$500
500
#000
#000
700
1600
1500
1100
500