very large logistical problem arises in officer mobilization for the U.S. Marine Corps. During an international emergency, officers have to be mobilized from their current positions into billets required for the emergency. Based on rank, training and experience, each officer is qualified for some of the billets. Problems involving tens of thousands of officers and billets have to be solved in minutes to provide a rapid mobilization plan. A data set of consisting of 10 officer groups and 4 emergency billets is given in Mobilization - Shell.xlsx.

1. Determine a mobilization plan that meets, as much as possible, the demand for officers at the billets while minimizing the total miles traveled. In so doing, you should also make sure that the shortage in the number of officers does not exceed 25% for any of the billets. Create a spreadsheet model for this problem and solve it using Solver. Report the (actual) total miles that officers need to travel?

2. Now that you have found the optimal solution for the given number of officers, you have been asked to address the shortage issue. How many more officers are needed to address this issue? And to which officer group(s) should these new officers be added to fully meet the emergency billet demands? Explain your reasoning.

Distance Matrix:	Mobilization Billets
Initial Groups	1	2	3	4		# of Officers in Group
1	220.0	103.0	129.0	138.0		141
2	207.0	200.0	190.0	236.0		102
3	235.0	127.0	129.0	133.0		128
4	121.0	225.0	80.0	100.0		101
5	139.0	150.0	175.0	208.0		111
6	125.0	258.0	252.0	84.0		113
7	249.0	264.0	250.0	248.0		103
8	293.0	147.0	90.0	200.0		96
9	305.0	300.0	185.0	330.0		93
10	125.0	159.0	135.0	131.0		117
						% Shortage Allowed
# of Officers Required for Billet	278	353	328	169		25%