Abstract: |
COURSE OUTLINE
The objective of this course is to introduce those real life problems which can be formulated as Linear Programming Problems ( LPP ). The course will be taught as a first course in optimization, hence all the concepts will be properly motivated and explained with examples.
Following will be discussed in particular:
Simplex Algorithm
Duality theory and its ramifications
Basic ideas of the Ellipsoid algorithm and Karmarkar’s algorithm
Special cases of LPP such as Transportation, Assignment and Network –flow
Dynamic programming and PERT/CPM algorithms
|