Optimization Technique

  Contents  

   1. Linear programming   

      1.1 introduction     

      1.2 construction of lp Model     

      1.3 graphical method linear programming: Simplex Method     

      1.4 introduction     

      1.5 the standard form of lp problem    

      1.6 simple algorithm: maximization case [all constraints are of the type ? ]

      1.7 simplex algorithm (minimization case)    

      1.8 special cases in simplex method    

      1.9 two phase method 

      1.10      linear programming: duality  

      1.11      Constructing the dual problem

      1.12      interpreting primal – dual optimum solutions   

      1.13      Dual Simplex Method    

      1.14      transportation Problem 

      1.15      Matrix Terminology     

      1.16      Test for Optimality    

      1.17      Variations in Transportation Problem     

 2. INTEGER PROGRAMMING  

      2.1 introduction     

      2.2 Types of Integer Programming Problems    

      2.3 Integer Programming Algorithm

   3     

      Queuing theory 

      3.1 introduction     

      3.2 Characteristics of Queuing Models  

      3.3 Waiting Time and Idle Time Costs   

      3.4 Transient and Steady State of the System 

       3.5      Single-Channel Queuing Theory   

4. Replacement theory

      4.1 introduction     

      4.2 Types of Failure 

      4.3 Replacement of Item Whose Efficiency Deteriorates with Time

      4.4 Replacement of items that fail completely

      4.5 Individual Replacement Policy

      4.6 Group Replacement Policy    

5. INVENTORY THEORY    

      5.1 Introduction     

      5.2 Inventory Control Problem    

      5.3 Inventory Models with Deterministic Demand     

6. PERT AND CPM   

      6.1 introduction     

      6.2 Network (Arrow Diagram) Logic

      6.3 Measure of Activity    

      6.4 Frequency Distribution Curve for PERT    

      6.5 PERT Computations

      6.6 Slack

      6.7 Critical Path    

      6.8 Probability of Meeting the Scheduled Dates     

      6.9 CPM Computations 

      6.10    Critical Path

      6.11    Float  

      6.12      Negative Float and Negative Slack  

      6.13      Updating (PERT and CPM)