QA 525 (Quantitative Approaches for Decision Making)

Exam #2 Study Checklist

4. Special Models in Linear Programming

• Transportation Models

• LP Formulation

Supply > Demand

Supply < Demand

Undesirable Routes

• Heuristic Methods

Northwest Corner

Minimum Cost

Vogel's Approximation (VAM)

• Optimization by the Transportation Simplex Method (aka Modified Distribution or MODI method)

• Transshipment Problems - LP Formulation

• Transfers between Transshipment Nodes

• Capacitated Transshipment Routes

• Direct Source to Destination Routes

Transfers between Transshipment Nodes

Capacitated Transshipment Routes

Direct Source-to-Destination Routes

• Heuristic Methods

 

• Assignment Problems

• LP Formulation

Jobs > Individuals

Jobs < Individuals

Job that requires Multiple Individuals

Individual that can handle Multiple Jobs

Undesirable Assignments

• Optimization by the Hungarian Algorithm

5. Handling Violations Of Linear Programming Conditions

• Integer Programming

• LP Formulation

• Graphical Solutions

• Branch & Bound

• Goal Programming

• LP Formulation

Preemptive Priorities

Priority Weights

Soft Constraints

Hard Constraints

4. Network Flow Problems

• Shortest Path Problem

• LP Formulation

• Shortest Path Algorithm

• Minimal Spanning Tree & MST Algorithm

• Maximum Flow Problem

• LP Formulation

• Minimum Flow Algorithm

• Minimum Cost Maximum Flow Problem

• LP Formulation

• NO OOK!!!!!!!!!!!!!!

• Traveling Salesman Problem

Return to the QA 525 Virtual Classroom