{<47>>[1]
DISCRETE OPTIMIZATION MODELS
Peh H. Ng
Division of Science and Mathematics
University of Minnesota at Morris
Morris, Minnesota 56267
pehng@cda.morris.umn.edu
October 25, 1996
Abstract
Discrete optimization and integer programming provide a paradigm with which a variety of industry and real-world problems can be solved. In this presentation, we will consider two applications of discrete optimizations models. The first application (on scheduling) can be modeled as an integer linear programming problem; the second (on uncapacitated fixed charge network flow) is a mixed-integer problem with an underlying network structure that also has a graph-theoretic model.We will describe the aforementioned problems, present the issues involved in each of the models, and show the approaches through which these problems are solved.