SE 356. Operations Research - I
(3 - 1 - 0 - 0 - 4)
Linear Models: Formulation and Examples, Basic Polyhedral Theory- Convexity, Extreme points, Supporting hyperplanes etc, Simplex Algorithm- Algebraic and Geometrical approaches, Artificial variable technique, Duality Theory: Fundamental theorem, Dual simplex method, Primal-dual method, Sensitivity Analysis, Bounded Variable L.P.P. Transportation Problems: Models and Algorithms, Network Flows: Shortest path Problem, Max-Flow problem and Min-cost Flow problem, Dynamic Programming: Principle of optimality, Discrete and continuous models.
- REFERENCES:
- Linear Programming & Network Flows by M.S. Bazaraa & J. Jarvis.
- Linear & Combinatorial Programming by K.G. Murty.
- Linear Programming by S.K. Gupta.
- Concerned Department: Mathematics