UNIT I LINEAR PROGRAMMING MODELS
- Mathematical Formulation
- Graphical Solution of linear programming models
- Simplex method
- Artificial variable Techniques
- Variants of Simplex method
UNIT II TRANSPORTATION AND ASSIGNMENT MODELS
- Mathematical formulation of transportation problem
- Methods for finding initial basic feasible solution
- optimum solution
- Degeneracy
- Mathematical formulation of assignment models
- Hungarian Algorithm
- Variants of the Assignment problem
UNIT III INTEGER PROGRAMMING MODELS
- Formulation
- Gomory’s IPP method
- Gomory’s mixed integer method
- Branch and bound technique
UNIT IV SCHEDULING BY PERT AND CPM
- Network Construction
- Critical Path Method
- Project Evaluation and Review Technique
- Resource Analysis in Network Scheduling
UNIT V QUEUEING MODELS
- Characteristics of Queuing Models
- Poisson Queues (M / M / 1) : (FIFO / ∞ /∞), (M / M / 1) : (FIFO / N / ∞), (M / M / C) : (FIFO / ∞ / ∞), (M / M / C) : (FIFO / N / ∞) models.
