The Location Set Covering Disruption Problem

Author

Richard A. Sheldon

Date of Award

3-2025

Document Type

Thesis

Degree Name

Master of Science in Operations Research

Department

Department of Operational Sciences

First Advisor

Brian J. Lunday, PhD

Abstract

This research models and analyzes a variant of the Location Set Covering Problem (LSCP) in a bilevel, game theoretic setting by posing the LSCP as a non-cooperative attacker-defender Stackelberg game, where facilities are to be emplaced by the defender from a boarder set of potential facility locations to cover a set of demands; however, an attacker removes the possibility of emplacing q specific facility locations with the objective to remove the maximum weighted value demands, and then lexicographically maximize the cost of coverage of remaining demands. A novel methodology leveraging lexicographic programming computed an optimal solution for 98% of all tested instances.

AFIT Designator

AFIT-ENS-MS-25-M-200

Comments

An embargo was observed for this posting.

Approved for Public Release. PA Case Number on file.

Recommended Citation

Sheldon, Richard A., "The Location Set Covering Disruption Problem" (2025). Theses and Dissertations. 8199.
https://scholar.afit.edu/etd/8199