scholarly journals Weapon Target Assignment

2021 ◽  
Author(s):  
Mohammad Babul Hasan ◽  
Yaindrila Barua
Keyword(s):  
Integer Programming ◽  
Objective Function ◽  
Optimization Problems ◽  
Optimization Techniques ◽  
Nonlinear Integer Programming ◽  
Integer Programming Problem ◽  
Combinatorial Optimization Problems ◽  
Target Assignment ◽  
Minimum Number ◽  
Np Complete

This chapter is mainly based on an important sector of operation research-weapon’s assignment (WTA) problem which is a well-known application of optimization techniques. While we discuss about WTA, we need some common terms to be discussed first. In this section, we first introduce WTA problem and then we present some prerequisites such as optimization model, its classification, LP, NLP, SP and their classifications, and applications of SP. We also discuss some relevant software tools we use to optimize the problems. The weapon target assignment problem (WTA) is a class of combinatorial optimization problems present in the fields of optimization and operations research. It consists of finding an optimal assignment of a set of weapons of various types to a set of targets in order to maximize the total expected damage done to the opponent. The WTA problem can be formulated as a nonlinear integer programming problem and is known to be NP-complete. There are constraints on weapons available of various types and on the minimum number of weapons by type to be assigned to various targets. The constraints are linear, and the objective function is nonlinear. The objective function is formulated in terms of probability of damage of various targets weighted by their military value.

Respecifying the weighting matrix of a quadratic objective function

Automatica ◽  
1978 ◽  
Vol 14 (6) ◽  
pp. 567-582 ◽  
Author(s):  
B. Rustem ◽  
K. Velupillai ◽  
J.H. Westcott
Keyword(s):  
Objective Function ◽  
Weighting Matrix ◽  
Quadratic Objective Function

SCHEDULING OPTIMIZATION OF KRI ASSIGNMENTS WITH BINARY INTEGER PROGRAMMING TO SECURE THE KOARMATIM SEA AREA

JOURNAL ASRO ◽  
2018 ◽  
Vol 9 (1) ◽  
pp. 86
Author(s):  
M Agus Arif H ◽  
Budi Santoso W ◽  
Ahmadi Ahmadi ◽  
Okol S Suharyo
Keyword(s):  
Integer Programming ◽  
Objective Function ◽  
Mathematical Formulation ◽  
Binary Integer Programming ◽  
Coverage Area ◽  
Entire Area ◽  
Excel Solver ◽  
Sea Area ◽  
Operation Scheduling

ABSTRACT Scheduling is an assignment activity related to a number of constraints, a number of events that can occur in a period of time and place or location so that the objective function as closely as possible can be fulfilled. In the hierarchy of decision making, scheduling is the last step before the start of an operation. Scheduling the assignment of KRI in Koarmatim is an interesting topic to be discussed and resolved using a mathematical method. The scheduling process of KRI assignments at Koarmatim is done to produce annual JOP / JOG. This process requires not only rapid follow-up, but also requires systematic steps. The scheduling of assignments applied by Koarmatim is currently carried out by personnel by not using mathematical calculations. The ship assignment scheduling process in this research was carried out using the Binary Integer Programming (BIP) method approach with the aim of minimizing costs and maximizing the purpose of the ship assignment. The scheduling observed was 25 ships carrying out operations for 52 weeks (1 year). The mathematical formulation of the BIP model is made up of one objective function and Three constraint functions. Then the development of the BIP model is then completed, the computer uses Excel Solver. The results obtained that the BIP model applied to scheduling KRI Koarmatim assignments is the maximum coverage area reached is 93,651,234 NM2, with an area safeguard level of 76,11 from the entire area of operating sector I to IX (1,230,442 NM2). BIP is an appropriate method to be used as a method in scheduling the assignment of KRI in Koarmatim.  Keywords: Scheduling, Ship assignments, Binary Integer Programming

Correct the Piecewise Linearization Error of Quadratic Objective Function in DC OPF Model

2019 ◽  
Vol 34 (6) ◽  
pp. 5083-5086
Author(s):  
Zhifang Yang ◽  
Wei Lin ◽  
Feng Qiu ◽  
Juan Yu ◽  
Gaofeng Yang
Keyword(s):  
Objective Function ◽  
Piecewise Linearization ◽  
Quadratic Objective Function ◽  
Linearization Error
Sign in / Sign up

Export Citation Format

Share Document