#1
July 15th, 2016, 09:40 AM
| |||
| |||
VTU OR Notes
Can you provide me the Syllabus/Notes of the OR (Operations Research) elective course in B.E (Engineering) - Computer Science (CSE) as offered by Visvesvaraya Technological University (VTU)?
Last edited by Harsh Pandit; July 19th, 2016 at 09:31 AM. |
#2
July 19th, 2016, 09:31 AM
| |||
| |||
Re: VTU OR Notes
Part A Unit-1 Introduction, Linear Programming – 1 Introduction: The origin, nature and impact of OR; Defining the problem and gathering data; Formulating a mathematical model; Deriving solutions from the model; Testing the model; Preparing to apply the model; Implementation . Introduction to Linear Programming: Prototype example; The linear programming (LP) model. Unit-2 LP – 2, Simplex Method – 1 Assumptions of LP; Additional examples. The essence of the simplex method; Setting up the simplex method; Algebra of the simplex method; the simplex method in tabular form; Tie breaking in the simplex method Unit-3 Simplex Method – 2 Adapting to other model forms; Post optimality analysis; Computer implementation Foundation of the simplex method. Unit-4 Simplex Method – 2, Duality Theory The revised simplex method, a fundamental insight. The essence of duality theory; Economic interpretation of duality, Primal dual relationship; Adapting to other primal forms Part B Unit-5 Duality Theory and Sensitivity Analysis, Other Algorithms for LP The role of duality in sensitive analysis; The essence of sensitivity analysis; Applying sensitivity analysis. The dual simplex method; Parametric linear programming; The upper bound technique. Unit-6 Transportation and Assignment Problems The transportation problem; A streamlined simplex method for the transportation problem; The assignment problem; A special algorithm for the assignment problem. Unit-7 Game Theory, Decision Analysis Game Theory: The formulation of two persons, zero sum games; Solving simple games- a prototype example;Games with mixed strategies; Graphical solution procedure; Solving by linear programming, Extensions. Decision Analysis: A prototype example; Decision making without experimentation; Decision making with experimentation; Decision trees. Unit-8 Metaheuristics The nature of Metaheuristics, Tabu Search, Simulated Annealing, Genetic Algorithms. |