Example: Abstract. This is a required page that displays the Roman numeral iii page number.
Note: the optional acknowledgments page follows the same format as the abstract page.
The title is centered in all capital letters one
keyboard return below the top one- inch
The solving of large, real world, combinatorial optimization problems has been of
interest to the operations research community for some time. Because the algorithms
used in solving these problems tend to have high computational time complexities
(Order N2 or greater), even the theoretical solutions are difficult to achieve. Dealing with
such problems in an industrial environment where other factors such as human
interaction and non-determinism are present make the problem solution, and further, the
implementation of the results, an even greater challenge. The contents of this document
describe a method that can be used to solve these problems in an industrial
environment. More specifically, the problems considered involve multiple objectives,
each objective either being a combinatorial optimization problem or one that is
somewhat subjective in its measurement. The method developed, which is grounded in
the Analytic Hierarchy Process, is then used to solve a life optimation problem at the
Coors Brewery in Golden, Colorado.
The first page of the
abstract is numbered
Roman numeral iii.