This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Homework 9 Due date: December 4 1. Requisitions arrive daily at a data processing center, which occurs at the beginning of the day. The number of requisitions in a day is j with probability p j , j = 0 , 1 ,... . Right after the daily requisitions have arrived, a decision has to be made as to whether or not to process. The cost of processing a bath of any size is K (i.e., if we decide to process, then all of the requisitions still awaiting processing are simultaneously processed at a fixed cost K .) The processing time is short and negligible. A penalty cost of c per day per requisition is incurred while requisitions await processing. All requisition must be processed by time N , and the objective is to minimize the expected total costs. (a) Formulate this problem as a dynamic program. (b) Show that the optimal policy has the following form: it processes at time n if and only if the number of requisitions accumulated is greater than or equal to some number s n ....
View Full Document
- Spring '12