Title Page
Abstract
Contents
Chapter 1. Introduction 10
1.1. Background and Objective 10
1.2. Research method and Organization 13
Chapter 2. Literature review 14
2.1. Previous Research 14
2.2. WTA problem 16
2.2.1. Formulation 16
2.2.2. Lagrangian relaxation 17
2.1.2. Line Search method 18
2.2.3. Subgradient method 19
Chapter 3. Methodology 22
3.1. Assumption 22
3.2. Problem definition 26
3.3. Efficient Algorithm 28
3.3.1. Lagrangian relaxation 28
3.3.2. Sub-problems 31
3.3.3. Solving sub-problem L₁(x) 32
3.3.4. Solving sub-problem L₂(y) 33
3.3.5. Solving sub-problem L₃(z) 35
3.3.6. Line Search method 38
3.3.7. The Subgradient method 40
Chapter 4. Computational Results 43
4.1. Instances 43
4.2. Result : 2 weapons and 2 targets 44
4.3. Result : large size 46
Chapter 5 Conclusion 53
Bibliography 55
초록 58
〈Table 4-1〉 Instance rule 43
〈Table 4-2〉 Instances in 2 weapons and 2 targets 44
〈Table 4-3〉 Result of 2 weapons and 2 targets. 44
〈Table 4-4〉 Result of large size 1 47
〈Table 4-5〉 Result of large size 2 48
〈Figure 1-1〉 WTA example 11
〈Figure 1-2〉 Example of target allocation 12
〈Figure 2-1〉 Graph of subgradient in 2 dimensional 20
〈Figure 3-1〉 Enemy's counter-attack cases 23
〈Figure 3-2〉 Example of assignment 1 24
〈Figure 3-3〉 Example of assignment 2 25
〈Figure 3-4〉 Graph shape of L₂(y) 34
〈Figure 3-5〉 Graph shape of L₃(z) 36
〈Figure 4-1〉 Graph of result by instances 49
〈Figure 4-2〉 Weapon Target Assignment Example 1 50
〈Figure 4-3〉 Weapon Target Assignment Example 2 51
〈Figure 4-4〉 Weapon Target Assignment Example 3 52