OR 647 Network Analysis

 

            Text:  Network Flows: Theory, Algorithms, and Applications, Ahuja, Magnanti, and Orlin,
                       Prentice-Hall, Englewood Cliffs, NJ, 1993.

            Course Objectives:

                          i) help students develop skills in formulating network models.
                         ii) discuss methods for solving network models and help students develop skills in using
                             these methods.

            Course Outline:

                        1. Theory and concepts
  
                  Preliminaries
                                        Linear Programming
                      Graphical method, Simplex tableau
                                    Definitions/terminology
                                    Key theorem 
                                    Unimodularity 
                                    Network Simplex Method 
                  Example 
                                             Obtaining a starting solution 
                                             Simplex method with bounds on the variables 
                                    Generalized Network Simplex Method
                                             Obtaining a starting solution   
                                    Out-of-Kilter Algorithm
                  Example
                                            OOK software 
                                    Lagrangian Relaxation 
                                            Example

                        2. Special Algorithms

                                    Spanning tree
                                    Shortest path
                                    Maximum flow
                                    Transportation
                                            Starting Solution Methods
                                    Assignment

                        3. Applications

                                    Project Scheduling
                                            Pert/Cost
                                    Production/Inventory Systems
                                    Location Problems
                                    Traveling Salesman Problem
                                    Telecommunications Networks
                                    Generalized Networks
                                    Miscellaneous Applications
 

           Grading:  The final grade is based on the results of homework, assigned journal readings, a project,
                            midterm exam, and a comprehensive final exam.
                            Item weights will be provided in class.

                    The grading scale is:  90-100% A   80-89% B   70-79% C   60-69% D   0-59% F.   
 

            Prerequisites:  OR 570 or GBA 661 or CS 440 or equivalent.