Reference no: EM132331864

Yuckdonald's is considering opening a series of restaurant along QVH. n possible locations are along a straight line and the distances of these locations from the start of QVH are in miles and in increasing order m1, m2, ...., mn. The constraints are as follows: 1. At each location, Yuckdonald may open one restaurant and expected profit from opening a restaurant at location i is given as pi 2. Any two restaurants should be at least k miles apart, where k is a positive integer We use a dynamic programming formulation to solve this problem. We define P[i] as follows