Outer Loop Planning

Abstract

In this chapter, we discuss the outer loop approach to solving multi-objective decision problems. In contrast to the inner loop approach—in which a single–objective algorithm for an SODP is adapted to apply to the corresponding MODP, by changing the summation and maximization operators into cross-sum and pruning operators—the outer loop approach leaves the single-objective algorithm intact. Instead, an MODP is solved as a series of scalarized (i.e., single-objective) problems, and single-objective algorithms are used as subroutines.