Prerequisite: Math 423
Post-optimality analysis, integer programming, goal program ming, the revised simplex method, the Karmarkar algorithm, bounded variables problems, sequencing problems (processing n jobs through two or k machines, and processing two jobs through k machines), scheduling using the Program Evaluation and Review Technique (PERT) and the Critical PathMethod (CPM), and dynamic programming