Read without ads and support Scribd by becoming a Scribd Premium Reader.
See Premium Plans
 
Operation ResearchModule 1
Unit 1
1.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
1.1
 
 Introduction1.2
 
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
1.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
1.1
 
 Introduction1.2
 
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
1.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
Search
Search History:
Searching...
Result 00 of 00
00 results for result for
  • p.
    • Notes
    Load more