n=1 X = 4 e 0 .X) = 1 18 x = 2 18 X 18 fi*le:) 18 16 1-2-3 i35 There are three possible solutions giving a maximum profit of 18: Solution 1: 1 - 1 - 4 Solution 2: 2 - 4 - 4 Solution 3: 3 - 3 - 3. 9.24 Location of Production Plants A firm is considering a location problem for its production plant over the next 3 years. There are four feasible locations where there are adequate premises in each one to carry out the firm's production operations. Table 9.17 shows the annual renting costs (thousands of dollars) of all four premises for the next 3 years. Preparing a new plant at the beginning of the year costs $2,000 and closing it at the end of the year costs $1,000. Annual maintenance costs are cited in $10,000. Currently, the firm has no production plant operating. (a) Consider this problem with dynamic programming to describe the phase, the state, the decision variable and the recursive function. Specify how en+1 is calculated and what the possible states are in each phase, as well as the feasible decisions that can be made (b) Solve the