In eduladder you can Ask,Answer,Listen,Earn and Download Questions and Question papers.

Watch related videos of your favorite subject.

Connect with students from different parts of the world.

Apply or Post Jobs, Courses ,Internships and Volunteering opportunity. For FREE

See Our team

Wondering how we keep quality?

Got unsolved questions? Ask Questions

GATE
GMAT
CBSE
NCERT
Career
Interview
Railway
UPSC
NID
NIFT-UG
NIFT-PG
PHP
AJAX
JavaScript
Node Js
Shell Script
Research

You are here:Open notes-->VTU-->10cs661-Operation-research

**10cs661 Operation research**

# How to study this subject

Introduction, Linear Programming – 1

6 hours

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

7 hours

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

6 hours

Adapting to other model forms; Post optimality analysis; Computer implementation Foundation of the simplex method.

Unit-4

Simplex Method – 2, Duality Theory

7 hours

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

7 hours

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

7 hours

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

6 hours

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

6 hours

The nature of Metaheuristics, Tabu Search, Simulated Annealing, Genetic Algorithms.

# Official Notes

Add contents here

# Notes from other sources

# Model question papers

Add contents here

# Previous year question papers

Add contents here

# Useful links

Add contents here