Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more
Standard view
Full view
of .
Look up keyword or section
Like this

Table Of Contents

0 of .
Results for:
No results containing your search query
P. 1
Operations Research

Operations Research

Ratings: (0)|Views: 36,683|Likes:
Published by venkatesh

More info:

Published by: venkatesh on Feb 03, 2011
Copyright:Attribution Non-commercial


Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less





Operation ResearchModule 1
Unit 1
Origin of Operations Research1.2
Concept and Definition of OR1.3
Characteristics of OR1.4
 Applications of OR1.5
Phases of OR
Unit 2
2.1 Introduction to Linear Programming2.2 General Form of LPP2.3 Assumptions in LPP2.4 Applications of Linear Programming2.5 Advantages of Linear Programming Techniques2.6 Formulation of LP Problems
Unit 3
3.1 Graphical solution Procedure3.3 Definitions3.3 Example Problems3.4
Special cases of Graphical method 3.4.1
 Multiple optimal solution3.4.2
 No optimal solution3.4.3
Unbounded solution
Module 2
Unit 1
Steps to convert GLPP to SLPP1.3
Some Basic Definitions1.4
 Introduction to Simplex Method 1.5
Computational procedure of Simplex Method 1.6 
Worked Examples
Unit 2
2.1 Computational Procedure of Big – M Method (Charne’s Penalty Method)2.2 Worked Examples2.3 Steps for Two-Phase Method 2.4 Worked Examples
Unit 3
3.1 Special cases in Simplex Method 3.1.1 Degenaracy3.1.2 Non-existing Feasible Solution3.1.3 Unbounded Solution3.1.4 Multiple Optimal Solutions
Module 3
Unit 1
The Revised Simplex Method 1.2
Steps for solving Revised Simplex Method in Standard Form-I 1.3
Worked Examples
Unit 2
2.1 Computational Procedure of Revised Simplex Table in Standard Form-II 2.2 Worked Examples2.3 Advantages and Disadvantages
Unit 3
3.1 Duality in LPP3.2 Important characteristics of Duality3.3 Advantages and Applications of Duality3.4 Steps for Standard Primal Form3.5 Rules for Converting any Primal into its Dual3.6 Example Problems3.7 Primal-Dual Relationship
3.8 Duality and Simplex Method 
Module 4
Unit 1
Computational Procedure of Dual Simplex Method 1.3
Worked Examples1.4
 Advantage of Dual Simplex over Simplex Method 
Unit 2
2.1 Introduction to Transportation Problem2.2 Mathematical Formulation2.3 Tabular Representation2.4 Some Basic Definitions2.5 Methods for Initial Basic Feasible Solution
Unit 3
3.1 Examining the Initial Basic Feasible Solution for Non-Degeneracy3.2 Transportation Algorithm for Minimization Problem3.3 Worked Examples
Module 5
Unit 1
 Introduction to Assignment Problem1.2
 Algorithm for Assignment Problem1.3
Worked Examples1.4
Unbalanced Assignment Problem1.5
 Maximal Assignment Problem
Unit 2
2.1 Introduction to Game Theory2.2 Properties of a Game2.3 Characteristics of Game Theory2.4 Classification of Games

Activity (169)

You've already reviewed this. Edit your review.
shereenyahya liked this
1 hundred thousand reads
PriyankaSharma liked this
ap021 liked this
Melese Alemayehu added this note
justalistener added this note
Nice description of graphical method. However has the same limitations.
Jain Joseph liked this
1 thousand reads
1 hundred reads
GK Maylomin liked this

You're Reading a Free Preview

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->