Optimization Technique

Contents

1.   Linear Programming

1.   Introduction  

2.   Construction of LP Model  

3.   Graphical Method    

4.   Linear Programming: Simplex Method    

5.   Simple Algorithm: Maximization Case  

6.   Simplex Algorithm (Minimization Case) 

7.   Special Cases in Simplex Method 

8.   Two Phase Method    

9.   Linear Programming: Duality     

10.  Constructing the Dual Problem   

11.  Interpreting Primal – Dual Optimum Solutions

12.  Dual Simplex Method 

13.  Transportation Problem   

14.  Test for Optimality 

15.  Variations in Transportation Problem  

Solved Problems   

2.   Sequential Model and Related Problems

1.   Introduction  

2.   Processing of n Jobs through One Machine    

3.   Processing n Jobs through Two Machines

3.   Queuing Theory    

1.   Introduction  

2.   Characteristics of Queuing Models     

3.   Waiting Time and Idle Time Costs

4.   Transient and Steady States of the System   

5.   Single-Channel Queuing Theory   

4.   Replacement Theory

1.   Introduction  

2.   Types of Failure   

3.   Replacement of Item Whose Efficiency Deteriorates with Time   

4.   Replacement of items that fail Completely   

5.   Individual Replacement Policy   

6.   Group Replacement Policy  

5.   Inventory Theory  

1.   Introduction  

2.   Inventory Control Problem 

3.   Inventory Models with Deterministic Demand  

Solved Examples   

6.   PERT & CPM  

1.   Introduction  

2.   Network (Arrow Diagram) Logic   

3.   Measure of Activity 

4.   Frequency Distribution Curve for PERT 

5.   PERT Computations   

6.   Slack   

7.   Critical Path 

8.   Probability of Meeting the Scheduled Dates  

9.   CPM Computations    

10.  Critical Path 

11.  Float   

12.  Negative Float and Negative Slack     

13.  Updating (PERT and CPM)   

Solved Examples