Course Details
Subject {L-T-P / C} : CE6032 : Operations Research { 3-0-0 / 3}
Subject Nature : Theory
Coordinator : Dr. Ujjal Chattaraj
Syllabus
Optimization Problem Formulation Introduction to Linear Programming Formulations, Linear Programming Solutions- Graphical Methods, Linear Programming Solutions - Simplex Algorithm, Simplex Algorithm-Minimization Problems, Primal Dual Relationships, Duality Theorems Traditional Optimization Techniques: Lagrangean, Kuhn-Tucker, Linear Programming, Integer Programming, Marginal Analysis, Sensitivity Analysis Non-Traditional Optimization Techniques: Genetic Algorithm Decision Analysis: Introduction to Probability, Decision under Certainty, Decision under Risk, Decision under Uncertainty, Game Theory Markov Chains Queuing Systems Project Scheduling: Program Evaluation and Review Technique (PERT) and Critical Path Method (CPM), Time Chart and Resource Leveling Parameter Estimation Hypothesis Testing Regression Analysis Network Analysis: Travelling Salesman Problem, Shortest Path: Moore’s Algorithm, Dijkastra’s Algorithm, Floyd’s Algorithm.
Course Objectives
- Civil Engineering operation
- Planning and scheduling methodologies to complicated Civil Engineering problems
- System operation and improvement
- Routing methodologies to networks
Course Outcomes
Mastery in real life solution to emergent Engineering problems
Essential Reading
- H.A. Taha, Operations Research, Prentice Hall of India
- F. S. Hillier and G. J. Lieberman, Introduction to Operations Research, Tata McGraw-Hill
Supplementary Reading
- D.N. Gujarati, Basic Econometrics, Tata McGraw-Hill
- K. Deb, Multi-Objective Optimization using Evolutionary Algorithms, John Wiley & Sons