Prerequisites:
3-0-0-9
Course Contents
Introduction, Mathematical Modeling, Linear programming Formulation, solution procedures, Duality, Sensitivity, Applications, Network methods Max Flow, Min cost, Shortest path, Dynamic programming Sequential decisions, Principle of optimality, Applications Integer Programming Formulation, Nonlinear Programming. Applications and solution methods.
Topics
Current Course Information
Instructor(s):
Number of sections:
Tutors for each section:
Schedule for Lectures:
Schedule for Tutorial:
Schedule for Labs: