Article ID: | iaor20014175 |
Country: | United Kingdom |
Volume: | 52 |
Issue: | 1 |
Start Page Number: | 48 |
End Page Number: | 54 |
Publication Date: | Jan 2001 |
Journal: | Journal of the Operational Research Society |
Authors: | Moore J.T., Weir J.D., Stoecker M.G. |
Keywords: | military & defence, programming: linear, programming: integer |
We develop an iterative approach for solving a linear programming problem with prioritized goals. We tailor our approach to preemptive goal programming problems and take advantage of the fact that at optimality, most constraints are not binding. To overcome the problems posed by redundant constraints, our procedure ensures redundant constraints are not present in the problems we solve. We apply our approach to the arsenal exchange model (AEM). AEM allocates weapons to targets using linear programs (LPs) formulated by the model. Our methodology solves a subproblem using a specific subset of the constraints generated by AEM. Violated constraints are added to the original subproblem and redundant constraints are not included in any of the subproblems. Our methodology was used to solve five test cases. In four of the five test cases, our methodology produced an optimal integer solution. In all five test cases, solution quality was maintained or improved.