Georgia Institute of Technology
Finding feasible systems with subjective probability constraints with a military application
Abstract
dc:description.abstractWe consider the problem of determining feasible systems among a finite set of simulated alternatives with respect to probability constraints, where observations from stochastic simulations are Bernoulli distributed. Most statistically valid procedures for feasibility determination consider constraints on the means of normally distributed observations. When observations are Bernoulli distributed, one can still use the existing procedures by treating batch means of Bernoulli observations as basic observations. However, achieving approximate normality may require a large batch size, which can lead to the unnecessary waste of observations in reaching a decision. This thesis proposes procedures that utilize Bernoulli-distributed observations to determine feasibility. We allow for subjective constraints, meaning that thresholds can be tightened if too many systems are feasible or relaxed if no feasible system exists, and adding thresholds sequentially over multiple passes. We demonstrate that our procedures outperform an existing feasibility determination procedure for subjective constraints, originally developed for normal observations. We also show that the proposed procedure can be used to find a system with the largest or smallest probability. Next, we consider the problem of finding feasible combinations of army aviation assets, specifically attack helicopters and unmanned aerial vehicles, to counter enemy armored units in the presence of constraints on the expected total cost and the mission failure probability. Both performance measures need to be estimated by stochastic simulation of a battlefield. Moreover, the decision maker may be interested in how the feasible combinations change as the threshold values are tightened or loosened, which can help identify the bi-objective optimal solution. We formulate this problem as feasibility determination with subjective constraints and combine two feasibility determination procedures originally designed for mean and probability, respectively. A case study is performed for an imaginary battlefield scenario in the area near the Korean border with an agent-based simulation.
Degree
thesis:*- Level thesis:degree_level
- Masters
- Department dc:contributor.department
- Industrial and Systems Engineering
- Grantor dc:publisher
- Georgia Institute of Technology
- Year dc:date.issued
- 2024
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Kim, Taehoon
- Advisor dc:contributor.advisor
-
- Kim, Seong-Hee
- Committee members dc:contributor.committeemember
-
- Andradottir, Sigrun
- Zhou, Yuwei
Subjects
dc:subject × 4Identifiers
dc:identifier.*- Handle dc:identifier.uri
- https://hdl.handle.net/1853/75249