A Systematic Approach to Developing Algorithms in Operations Research

This talk provides an overview of the problem-solving process used in Operations Research and Management Science. The approach involves the use of mathematics and computers to build and analyze models of problems arising in many organizations. Emphasis here is given on presenting a systematic method for developing finite algorithms for solving combinatorial optimization problems. Two fundamental search strategies are presented. The greedy (or piece-by-piece) search strategy is illustrated with the traveling salesman problem. The finite improvement search strategy is illustrated with the traveling salesman and linear programming problems. Issues of optimality are discussed through the use of duality theory.

Interactive participation with the audience in developing some of these algorithms forms an integral part of the presentation.

Read this disclaimer.

Maintained by Janet Scholz <jscholz@grove.iup.edu>
Last Modified on Monday, 13-Aug-2001 16:53:06 EDT