Entry optimization using mixed integer linear programming

Article

DOI: 10.1007/s12555-014-0270-6

Cite this article as:
Baek, S., Moon, S. & Kim, H.J. Int. J. Control Autom. Syst. (2016) 14: 282. doi:10.1007/s12555-014-0270-6
  • 79 Downloads

Abstract

An appropriate selection of agents to participate in a confrontation such as a game or combat depends on the types of the opposing team. This paper investigates the problem of determining a combination of agents to fight in a combat between two forces. When the types of enemy agents committed to the combat are not known, game theory provides the best response to the opponent. The entry game is solved by using mixed integer linear programming (MILP) to consider the constraints on resources in a game theoretic approach. Simulations for the examples involving three different sets of military forces are performed using an optimization tool, which demonstrates that the optimal entry is properly selected corresponding to the opposing force.

Keywords

Decision making game theory military operation MILP (mixed integer linear programming) resource allocation 

Copyright information

© Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers and Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.School of Mechanical and Aerospace Engineering and Institute of Advanced Aerospace TechnologySeoul National UniversitySeoulKorea

Personalised recommendations