# Consider again the CHB Inc. problem described in Problem 10. Suppose only a limted number of PPBs can be placed. CHB would like to place this limited number of PPBs in counties so that the allowable branches can reach the

Consider again the CHB Inc. problem described in Problem 10. Suppose only a limted number of PPBs can be placed. CHB would like to place this limited number of PPBs in counties so that the allowable branches can reach the maximum possible population. The file CHBPop contains the county adjacency matrix described in Problem 10 as well as the population of each county.
a. Assume that only a fixed number of PPBs, denoted k, can be established. Formulate a linear binary integer program that will tell CHB Inc. where to locate the fixed number of PPBs in order to maximize the population reached. (Hint: Review the Ohio Trust formulation in Section 9.4. Introduce variable yi = 1 if it is possible to establish a\ branch in county i, and yi = 0 otherwise; that is, if county i is covered by a PPB, then
the population can be counted as covered.).
b. Suppose that two PPBs can be established. Where should they be located to maximize the population served?
c. Solve your model from part a for allowable number of PPBs ranging from 1 to 10. In other words, solve the model 10 times, k set to 1,2, . . . , 10. Record the population reached for each value of k. Graph the results of part b by plotting the population reached versus number of PPBs allowed. Based on their cost calculations, CHB considersan additional PPB to be a fiscally prudent only if it increases the population reached by at least 500,000 people. Based on this graph, what is the number of PPBs you recommend to be implemented?

## This problem has been solved!

Do you need an answer to a question different from the above? Ask your question!
Related Book For

## Essentials of Business Analytics

ISBN: 978-1285187273

1st edition

Authors: Jeffrey Camm, James Cochran, Michael Fry, Jeffrey Ohlmann, David Anderson, Dennis Sweeney, Thomas Williams

Posted Date: November 21, 2015 02:24:01