Date of Award

3-23-2017

Document Type

Thesis

Degree Name

Master of Science in Operations Research

Department

Department of Operational Sciences

First Advisor

Raymond R. Hill, PhD.

Abstract

This paper compares linear programming and stable marriage approaches to the assignment problem under conditions of uncertainty. Robust solutions should exhibit reduced variability in the presence of one or more additional constraints. Several variations of each approach are compared with respect to solution quality, as measured by the overall social welfare among Officers and Assignments, and robustness as measured by the number of changes after a number of randomized perturbations. We examine the contrasts between these methods in the context of assigning Army Officers among a set of identified assignments. Additional constraints are modeled after realistic scenarios faced by Army assignment managers, with parameters randomized. The Pareto efficient approaches, relative to these measures of quality and robustness, are identified and subjected to a regression analysis. The coefficients of these models provide insight into the impact the different scenarios under study, as well as inform any trade-off decisions between Pareto-optimal approaches.

AFIT Designator

AFIT-ENS-MS-17-M-128

DTIC Accession Number

AD1051590

Share

COinS