LESSON PLAN

Sub Name : OPERATIONS RESEARCH Sub Code : 11ME 501 Branch: MechanicalEngg. Semester : V Hours and Credit: L-T-P-C (3 1 0 4)

UNIT I LINEAR PROGRAMMING

12(L)

Introduction - Formulation of linear programming models Assumptions-Graphical solution procedure solving LPP using simplex algorithm Degeneracy, Revised Simplex Method Duality theory - Interpretation of dual variables- Primal Dual Relationships Role of duality in sensitivity analysis - Dual simplex method Objective: To understand and apply operations research techniques to industrial operations.

Session No

Topics to be covered

Time (min) 55 55 55 55 55

Ref

Teaching Method BB BB BB BB BB

Introduction
1

Formulation of linear programming models

2

Graphical solution procedure

3 4 5 6 7 8 9 10 11 12

solving LPP using simplex algorithm solving LPP using simplex algorithm Degeneracy Revised Simplex Method Duality theory Interpretation of dual variables Primal Dual Relationships Primal Dual Relationships Role of duality in sensitivity analysis Dual simplex method

1,2 55 55 55 55 55 55 55 BB BB BB BB BB BB BB

UNIT II TRANSPORTATION & ASSIGNMENT MODEL

12(L)

Transportation problems, transportation simplex method Assignment problems, Hungarian method- LP formulation of transportation and Assignment networks- Traveling sales man problem Objective: To create awareness about utilization of resources through various optimization techniques.

Session No 1

Topics to be covered

Time (min) 55 55 55 55 55

Ref

Teaching Method BB BB BB BB BB

Transportation problems Transportation simplex method

2

Transportation simplex method

3 4 5 6 7 8 9 10 11 12

Assignment problems -Hungarian method Assignment problems -Hungarian method Assignment problems -Hungarian method LP formulation of transportation LP formulation of transportation LP formulation of Assignment networks LP formulation of Assignment networks Traveling sales man problem Traveling sales man problem

2 55 55 55 55 55 55 55 BB BB BB BB BB BB BB

UNIT III INVENTORY MODELS

12(L)

Purchase model with no shortages manufacturing model with no shortage Purchase model with shortage Manufacturing model with shortages model with price breaks Objective: To create awareness about utilization of resources through various optimization techniques.

Session No 1

Topics to be covered

Time (min) 55 55 55 55 55 55 55 55 55 55 55 55

Ref

Teaching Method BB BB BB BB

Purchase model with no shortages Purchase model with no shortages

2

Manufacturing model with no shortage

3 4 5 6 7 8 9 10 11 12

Manufacturing model with no shortage Purchase model with shortage Purchase model with shortage Manufacturing model with shortages Manufacturing model with shortages Manufacturing model with shortages Model with price breaks Model with price breaks Revision

BB BB BB BB BB BB BB BB

UNIT IV NETWORK MODELS

12(L)

Maximal flow problem Shortest route problem Minimal spanning tree problem - Project networks, CPM, PERT, Crashing of networks, L P model for crashing project costing and control. Objective: To create awareness about utilization of resources through various optimization techniques.

Session No 1

Topics to be covered

Time (min) 55 55 55 55 55 55 55 55 55 55 55 55

Ref

Teaching Method BB BB BB BB

Maximal flow problem Shortest route problem

2

Minimal spanning tree problem

3 4 5 6 7 8 9 10 11 12

Project networks introduction CPM Continuation of CPM Continuation of CPM PERT Continuation of PERT Continuation of PERT Crashing of networks L P model for crashing project costing and control.

BB BB BB BB BB BB BB BB

UNIT V QUEUING AND REPLACEMENT MODELS

12(L)

Queuing theory terminology Single server, multi server, Limited queue capacity applications Markov chains.Replacement models Money value, present worth factor and discount rate.

Objective: To develop the basic of Metaheuristics techniques in different fields.

Session No 1

Topics to be covered

Time (min) 55 55 55 55 55 55 55 55 55 55 55 55

Ref

Teaching Method BB BB BB BB

Queuing theory terminology Single server

2

multi server
3 4 5 6 7 8 9 10 11 12

Continuation of Single server & multi server Limited queue capacity applications Markov chains Replacement models Money value Replacement models Money value Replacement models present worth factor Replacement models present worth factor Replacement models discount rate Revision

4,5

BB BB BB BB BB BB BB BB