Lagrangian relaxation approach to the targeting problem

Naval Research Logistics

Volumn 46, Issue 6, 1999, Pages 640-653

  Kwon, Ojeong ^a   Kang, Donghan ^b   Lee, Kyungsik ^c   Park, Sungsoo ^b  

^a ROK Army HQ   (South Korea)

^b Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^c Electronics and Telecommunications Research Institute (ETRI)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

COST ACCOUNTING; HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; MILITARY APPLICATIONS; NONLINEAR PROGRAMMING; NUMERICAL METHODS; PROBLEM SOLVING;

BRANCH AND BOUND METHODS; LAGRANGIAN RELAXATION; TARGETING PROBLEM;

LAGRANGE MULTIPLIERS;

EID: 0033308910     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6750(199909)46:6<640::AID-NAV3>3.0.CO;2-Q     Document Type: Article

References (21)

1. M. Ash, Flood's assignment model for small kill levels, Oper Res 7 (1959), 258-260.
2. J. Bracken and G. McCormick, Selected application of non-linear programming, Wiley, New York, 1980.
3. J.F. Christ, E.W. Page, and G.A. Tagliarini, "Performance evaluation of a neural network for weapon-to-target assignment," Proc SPIE - Int Soc Opt Eng, Orlando, FL, 13-16 April 1993, pp. 676-681.
4. R.H. Day, Allocating weapons to target complexes by means of nonlinear programming, Oper Res 14 (1966), 992-1013.
5. M.L. Fisher, The Lagrangian relaxation method for solving integer programming problems, Manage Sci 27 (1981), 1-18.
6. M.L. Fisher, An application oriented guide to Lagrangian relaxation, Interfaces 15 (1985), 10-21.
7. G. Furman and J. Greenberg, Optimal weapon allocation with overlapping area defenses, Oper Res 21 (1973), 1291-1308.
8. M.R. Garey and D.S. Johnson, Computers and intractability, Freeman, San Francisco, 1979.
9. A. Geoffrion, Lagrangian relaxation for integer programming, Math Program Stud 2 (1974), 82-114.
10. P.A. Hosein and M. Athans, An asymptotic result for the multi-stage weapon-target allocation problem, Proc 29th IEEE Conf Decision Control, Honolulu, HI, 5-7 December 1990, pp. 240-245.
11. N.K. Jaiswal, P.K. Shrotri, and B.S. Nagabhushana, Optimal weapon mix, deployment and allocation problems in multiple layer defense, Am J Math Manage Sci 13 (1993), 53-82.
12. S.E. Kolitz, "Analysis of a maximum marginal return assignment algorithm," Proc 27th IEEE Conf Decision Control, Austin, TX, 7-9 December 1988, pp. 2431-2436.
13. F. Lemus and K. David, An optimum allocation of different weapons to a target complex, Oper Res 11 (1963), 787-794.
14. A. Manne, A target assignment problem, Oper Res 5 (1958), 346-351.
15. F. Miercort and R. Soland, Optimal allocation of missiles against area and point defenses, Oper Res 19 (1970), 605-617.
16. G. Nemhauser and L. Wolsey, Integer and combinatorial optimization, Wiley, New York, 1988, Chap. II.5.
17. N.T. O'Meara and R.M. Soland, Optimal strategies for problems of simultaneous attack against an area defense with impact-point prediction, Nav Res Logistics 39 (1992), 1-28.
18. D. Orin, Optimal weapons allocation against layered defenses, Nav Res Logistics 34 (1987), 605-617.
19. H. Sherali, S. Kim, and E. Parrish, Probabilistic partial set covering problem, Nav Res Logistics 38 (1991), 41-51.
20. E. Wacholder, A neural network-based optimization algorithm for the static weapon-target assignment problem, ORSA J Comput 1 (1989), 232-246.
21. F. Zu, Allocation of different weapons to a target complex, Proc Int Conf Syst Sci Eng (ICSSE '88), Beijing, China, July 1988, pp. 25-28.