Optimal policies for several stochastic extensions in which the distance that can be traveled on a load of fuel is a random variable are also being investigated. Configuration Planning Problem is to determine when to install what major equipment upgrade on which submarine hulls to simultaneously optimize a set of multiple objectives while satisfying technological and budgetary constraints over the planning horizon. This is a dynamic multiple-objective combinatorial optimization problem where the objectives include maximizing the detection of the enemy, minimizing detection by the enemy, maximizing the exchange ratio, and maximizing the number of mines delivered. The equipment upgrades include improved sonar, quieting measures, and improved firepower. We prove that one of our methods for obtaining an initial efficient solution is dual to the Chebychev Methods for determining an efficient solution.
Computational results demonstrate the effectiveness of our algorithms.
The types of polytopes that can be produced by facet splitting are classified. New results on polytopes produced by facet splitting are developed as well as general results in cutting polytopes. The work is relevant to Linear Programming Algorithms since it has been shown that polytopes produced by facet splitting satisfy the d-step conjecture. The theoretical work is complimented by extensive computational experience. Polling Systems are single server stochastic systems with multiple classes of jobs in separate queues that compete for service.