COS 313

Operation Research

Mathematical modeling; Linear programming; Formulating a linear program, Solving linear programs; Graphical method, Simplex method; Canonical form, Two phase Simplex method , Transportation problems; Transportation Simplex Method,Network problems; Shortest Path Problem, Minimum Spanning Tree, Maximum Flow problem, Minimum-cost Flow problem, Network Simplex Algorithm; Project  Scheduling Models (PSM and PERT); Game Theory; 11.1 Pure and Mixed strategies; Nonconstant-sum Games Inventory problems; Reliability problems; Dynamic programming. Network scheduling models (PERT & CPM).

Course Code
COS 313
Department
Computer Science
Campus
Sumas University
Level
300 Level, Undergraduate
Instructor
Sumas University Lecturer
Semester
First Semester
Credit
2 Units
Method
Lecture