1

NAVAL
POSTGRADUATE
SCHOOL
MONTEREY, CALIFORNIA

SO 2410/3410 PROJECT 1
PROJECT TITLE

Ian Stafford Davis, MAJ, SF

&
Patrick Michael Flood, CPT, SF

24 August 2009

Course Professor: Professor William P. Fox

 2

ABSTRACT/EXECUTIVE SUMMARY

The purpose of this project is to create a model that will provide a possible solution to the issue
raised by the US Secret Service regarding the protection of the President while in Iraq. The US
Secret Service has assessed that the protection for the President during his previous visit to Iraq
was sub-optimal and needed to be improved. Given the constraints of the existing Force
structure, we will utilize a Linear Programming model in order to provide the US Secret
Service with an estimation of cost given their suggested requirements.
 3

TABLE OF CONTENTS

SECTION ……………………………………………………………….………………PAGE

COVER PAGE ……………………………………………………………………………..1

ABSTRACT/ EXECUTIVE SUMMARY ……………………………………………………..2
TABLE OF CONTENTS ………………………………………………………………..……3
INTRODUCTION OF THE PROBLEM ……………………………………………………..4
PROBLEM IDENTIFICATION STATEMENT ……………………………………………..4
ASSUMPTIONS AND VARIABLES DEFINED ……………………………………………..4
MODEL AND SOLUTION ……………………………………………………………………..5
STRENGTHS/ WEAKNESSES ……………………………………………………………..5
SUMMARIZED ANSWER …………………………………………………………………..…6
EXCEL WORKSHEET (APPENDIX) ………………………………………………….….7
 4

INTRODUCTION OF THE PROBLEM

During the President’s last visit to Iraq, the Secret Service was unhappy with the forces that were on
stand-by in case of trouble. Because of this we will create a stand-by force structure that will meet the
requirements for any future visits. All assessed requirements will be supported by the commanders in
Theater.

PROBLEM IDENTIFICATION STATEMENT

We must provide a recommendation to the CJCS on the optimum forces structure to protect the President
during his next visit to Iraq. That will go to the Secret Service. If the answers do not make good
common sense then resolve as an integer programming problem and interpret that solution in your
memorandum to the chairman for the Secret Service.

The Secret Service will pay for the required stand-by force.

ASSUMPTIONS AND VARIABLES DEFINED

The following are the facts:

1. Infantry Platoons (X1)/ Platoon Leaders (X2)
a. A Platoon consists of 20 Soldiers and 1 Officer.
b. Officers cost of $1000 each. 1 Officer must accompany each Platoon that is
deployed.
c. Soldiers can be obtained from at a cost of $500 each. There are 20 soldiers per
platoon.
2. Helicopters (X3)
a. Each helicopter has 3 Pilots (X4)
b. Pilots cost $3000 each
c. Helicopters cost $100,000 each
3. Ships (X5)
a. A Ship consists of 100 Sailors and 5 Naval Officers (X6)
b. Trained Naval Officers cost $2500 each
c. Sailors cost $500 each
d. Ships cost $250,000

The estimated units of effectiveness are:

1. Platoon: 1 Unit of Effectiveness
2. Helicopter: 5 Units of Effectiveness
3. Ship: 10 Units of Effectiveness
4. The entire stand-by force should have at least 300 Units of Effectiveness

Assumptions
1. The model assumes all elements will be at 100% strength (not realistic; full combat strength
is closer to 90% for actual units)
2. All elements will be immediately available for employment as the Stand-by Force
3. Tasked Commands would be responsible to maintain a 100% backfill for all elements in
order to maintain current operational posture
4. Commands would need to backfill equipment and personnel immediately
5. The duration and sustainment of the element is not factored into the model
 5

6. Fractional answers for the decision variables are acceptable

7. Decision variables are non-negative

Additional constraints are:

1. The force must have at least 300 Units of Effectiveness
2. Infantry and Marines must be employed as platoons
3. Every platoon must have a platoon leader
4. Every platoon must have 1 helicopter (with pilots)
5. Every helicopter must have 3 pilots
6. Every ship must have a crew (100 sailors and 5 Naval Officers)
7. Every 10 platoons must have 1 ship (with crew)

MODEL AND SOLUTION

MODEL (INTEGER):

MINIMIZE Z= ($500*20)X1+$1,000X2+$100,000X3+$3000X4+$250,000X5+($500*100+$2,500*5)X6  
Subject to            
Constraint 1 X1+5X5+10X5>=300        
Constraint 2 X1>=1          
Constraint 3 X2=X1          
Constraint 4 X3>=X1          
Constraint 5 X4=3X3          
Constraint 6 X6=X5          
Constraint 7 X5>=.1X1          
Assume X1, X2, X3, X4, X5, X6>=0 (Non-Negativity)    

SOLUTION:

The cost estimate is $6,486,000.00 in order to maintain a Stand-by Force given the requirements stated by
the US Secret Service.

STRENGTHS AND WEAKNESSES OF THE MODEL

STRENGTHS:

1. Provides a rough estimate for the cost of developing a Stand-by Force (in the absence of
additional requirements)
2. Identifies tasking required down to the individual resource level
3. Can provide a commander’s estimate for additional forces required if tasked with providing a
Stand-by Force

WEAKNESSES:
 6

1. The model assumes all elements will be at 100% strength (not realistic; full combat strength
is closer to 90% for actual units)
2. All elements will be immediately available for employment as the Stand-by Force
3. Tasked Commands would be responsible to maintain a 100% backfill for all elements in
order to maintain current operational posture
4. Commands would need to backfill equipment and personnel immediately
5. The duration and sustainment of the element is not factored into the model
6. Does not account for Command and Control or Support for the force
 7

SUMMARIZED ANSWER
Given the estimated requirement to provide 40 Platoons, 40 Platoon Leaders, 44 Helicopters, 132 Pilots, 4
Ships, and 4 Ships’ Crews (consisting of 100 Sailors and 5 Officers each), the cost estimate which will be
given to the CJCS and billed to the US Secret Service will be $6,486,000.00. The Integer version of the
Linear Progression Model was utilized due the fractional results expressed in personnel or material which
cannot be realistically fractionalized. The weaknesses of this model, when placed into the context of
reality, are great. It is not realistic that a commander in a Theater of Combat would be able to place what
is roughly the equivalent of a Division Task Force on hold for the President and still conduct effective
combat operations. All the commander’s existing units would need to be re-tasked in order to support the
President’s visit. It is also not realistic that 100% of the required units would be fully operational at any
given time due to logistical requirements (repair parts), fatigue, and other security or operational
requirements.
 8

A Linear Programming Problem

Cost per Item Cost and Effectiveness per System

Solder $ 500.00 Crew Leader Equipment Cost Effectiveness
Officer $ 1,000.00 Platoon 20 1 0 $ 11,000.00 1
Helo w maint. $ 100,000.00 Helo 0 3 1 $ 109,000.00 5
Pilot $ 3,000.00 Ship 100 5 1 $ 312,500.00 10
Ship /w maint $ 250,000.00
Crewman $ 500.00
Naval Officer $ 2,500.00

Constraints Planning Assumtions

1. Not less than 300 Units of Effectiveness 1. All elements will be at 100%
2. Not less than one Platoon consisting of 20 troops 2. All elements will be immediately available for employment
3. Every Platoon must have a Platoon Leader 3. Tasked Commands are responsible for backfill to maitain 100% strength
4. Every Platoon must have one Helicopter with a crew of 3 Pilots 4. Commands can immediately backfill shrotfall of equipment and personnel
5. Every Helicopter must have 3 Pilots 5. Duration and sustainment of the operations are irrelevent
6. Every Ship must have a crew constsiting of 100 Sailors and 5 Naval Officers 6. All Decision Variables are Integers
7. One ship with full crew is required for every 10 Platoons

MINIMIZE Z= ($500*20)X1+$1,000X2+$100,000X3+$3000X4+$250,000X5+($500*100+$2,500*5)X6
Subject to
Constraint 1 X1+5X5+10X5>=300
Constraint 2 X1>=1
Constraint 3 X2=X1
Constraint 4 X3>=X1
Constraint 5 X4=3X3
Constraint 6 X6=X5
Constraint 7 X5>=.1X1
Assume X1, X2, X3, X4, X5, X6>=0 (Non-negativity)

Platoons PLs Helicopters Pilots Ships Ships' Crew

X1 X2 X3 X4 X5 X6 ANSWER
MINIMIZE $ 10,000.00 $ 1,000.00 $ 100,000.00 $ 3,000.00 $ 250,000.00 $ 62,500.00 $ 6,486,000.00
RHS
Constraint 1 1 0 5 0 10 0 300.000000000008 >= 300
Constraint 2 1 0 0 0 0 0 40.0000000000038 >= 1
Constraint 3 1 1 0 0 0 0 40.0000000000038 = 40
Constraint 4 1 0 1 0 0 0 44 >= 40
Constraint 5 0 0 1 1 0 0 132 = 132
Constraint 6 0 0 0 0 1 1 4.00000000000038 = 4
Constraint 7 1 0 0 0 0 1 4.00000000000038 >= 4

Decision Variable 40 40 44 132 4 4

Answer Report- Integers

Target Cell (Min)
Cell Name Original Value Final Value
$I$33 MINIMIZE ANSWER $ 6,482,142.86 $ 6,486,000.00 Tasking
Platoons c/o 40.0000000000038
Soldiers 800.000000000076
Adjustable Cells Platoon Leaders 40.0000000000038
Cell Name Original Value Final Value Helicopters 44
$B$43 Decision Variable X1 42.85714286 40 Pilots 132
$C$43 Decision Variable X2 42.85714286 40 Ships 4.00000000000038
$D$43 Decision Variable X3 42.85714286 44 Ship Crews c/o 4.00000000000038
$E$43 Decision Variable X4 128.5714286 132 Sailors 400.000000000038
$F$43 Decision Variable X5 4.285714286 4 Naval Officers 20.0000000000019
$G$43 Decision Variable X6 4.285714286 4

Constraints
Cell Name Cell Value Formula Status Slack
$I$35 Constraint 1 ANSWER 300 $I$35>=$K$35 Binding 0
$I$36 Constraint 2 ANSWER 40 $I$36>=$K$36 Not Binding 39
$I$37 Constraint 3 ANSWER 40 $I$37=$K$37 Not Binding 0
$I$38 Constraint 4 ANSWER 44 $I$38>=$K$38 Not Binding 4
$I$39 Constraint 5 ANSWER 132 $I$39=$K$39 Not Binding 0
$I$40 Constraint 6 ANSWER 4 $I$40=$K$40 Not Binding 0
$I$41 Constraint 7 ANSWER 4 $I$41>=$K$41 Binding 0
$B$43 Decision Variable X1 40 $B$43>=0 Not Binding 40
$C$43 Decision Variable X2 40 $C$43>=0 Not Binding 40
$D$43 Decision Variable X3 44 $D$43>=0 Not Binding 44
$E$43 Decision Variable X4 132 $E$43>=0 Not Binding 132
$F$43 Decision Variable X5 4 $F$43>=0 Not Binding 4
$G$43 Decision Variable X6 4 $G$43>=0 Not Binding 4
$B$43 Decision Variable X1 40 $B$43=integer Binding 0
$C$43 Decision Variable X2 40 $C$43=integer Binding 0
$D$43 Decision Variable X3 44 $D$43=integer Binding 0
$E$43 Decision Variable X4 132 $E$43=integer Binding 0
$F$43 Decision Variable X5 4 $F$43=integer Binding 0
$G$43 Decision Variable X6 4 $G$43=integer Binding 0