Better traffic flow the dataset traffic flow gives the delay time in seconds for simulation runs in dresden, germany, comparing the current timed traffic light system on each run to a proposed flexible traffic light system in which lights communicate traffic flow information to neighboring lights. on average, public transportation was delayed seconds under the timed system and seconds under the flexible system. since this is a matched pairs experiment, we are interested in the difference in times between the two methods for each of the simulations. for the differences , we were given that seconds with seconds. we wish to estimate the average time savings for public transportation on this stretch of road if the city of dresden moves to the new system. the standard error is for one set of bootstrap samples. find a confidence interval for the average time savings.

Acaterer knows he will need 60, 50, 80, 40 and 50 dinner napkins on five successive evenings. he can purchase new napkins initially at 25 cents each, after which he can have dirty napkins laundered by a fast one-day laundry service (i.e., dirty napkins given at the end of the day will be ready for use the following day) at 15 cents each, or by a slow two-day service at 8 cents each or both. the caterer wants to know how many napkins he should purchase initially and how many dirty napkins should be laundered by fast and slow service on each of the days in order to minimize his total costs. formulate the caterer’s problem as a linear program as follows (you must state any assumptions you make): a. define all variables clearly. how many are there? b. write out the constraints that must be satisfied, briefly explaining each. (do not simplify.) write out the objective function to be minimized. (do not simplify.)