those are variable names

3. (Class 12 + 14) The following table provides the data for a dynamic lot-sizing problem over the next 5 weeks. Week Time Period 1 1 50 $300 $4 $1 2 2 20 $200 $3 $1 3 3 40 $300 $4 $1 K 4 80 $400 $2 $1 5 50 $300 $1 NA C (a) [10 points] Determine the cost of each subplan that is possible in this problem (i.e., g(s, t) for s = 1, 2, 3, 4, 5 and t > s). (b) [5 points) From time period 1, apply the generalization of the least unit cost per demand rolling horizon procedure to determine the subplan out of period 1. You should focus on the total costs (including fixed ordering costs, inventory costs, and production costs) per unit demand as you vary the ending time period of the subplan. (c) [10 points] Apply the 'subplan algorithm to determine f(s) for s = 1,2,3,4,5. (d) [5 points] Based on your results for (c), determine the periods which you order in this problem in order to minimize the total costs. 3. (Class 12 + 14) The following table provides the data for a dynamic lot-sizing problem over the next 5 weeks. Week Time Period 1 1 50 $300 $4 $1 2 2 20 $200 $3 $1 3 3 40 $300 $4 $1 K 4 80 $400 $2 $1 5 50 $300 $1 NA C (a) [10 points] Determine the cost of each subplan that is possible in this problem (i.e., g(s, t) for s = 1, 2, 3, 4, 5 and t > s). (b) [5 points) From time period 1, apply the generalization of the least unit cost per demand rolling horizon procedure to determine the subplan out of period 1. You should focus on the total costs (including fixed ordering costs, inventory costs, and production costs) per unit demand as you vary the ending time period of the subplan. (c) [10 points] Apply the 'subplan algorithm to determine f(s) for s = 1,2,3,4,5. (d) [5 points] Based on your results for (c), determine the periods which you order in this problem in order to minimize the total costs