12 Bailey Bliss is the campaign manager for Walter Glenn’s presidential campaign. He has D dollars to allocate to T winner-take-all primaries. If xt dollars are allocated to primary t, then with probability pt(xt), Glenn will win primary t and obtain vt delegates. With probability 1 

pt(xt), Glenn loses primary t and obtains no delegates. Glenn needs K delegates to be nominated. Use dynamic programming to help Bliss maximize Glenn’s probability of being nominated. What aspect of a real campaign does the present formulation ignore?