Professional Documents
Culture Documents
Course Objectives
Course Contents
Week Topics
1 Shortest-Rout Algorithms for Cyclic Networks
2 Maximal-flow Problem
3 Matrix Definition of LP Problem.
4 Revised Simplex Method
5 Bounded Variables
6 Decomposition Algorithm.Parametric Linear Programming.
7 Parametric Linear Programming
8 Mid term
9 Applications of Integer Programming
10 Cutting-Plane Algorithms
11 Branch-And-Bound Method.
12 Zero-one Implicit Enumerations
13 Elements of Dynamic Programming
14 Problem of Dimensionality
15 Solution of Linear Programmesby Dynamic Programming.
16 presentations