MRK Institute of Technology

(Approved by AICTE & Affiliated to Anna University)

Kattumannarkoil - 608 301.
LESSON PLAN
Subject Code : CS6704 No. of Hours : Theory - 45
Subject Name: RESOURCE MANAGEMENT TECHNIQUES Tutorial -15
Faculty Name: E.REVATHI Total - 60
Branch : B.E. –CSE
Year / Sem : IV/VII
Aim:
To develop the skills in the area of RESOUCE MANAGEMENT TECHNIQUES.
Objectives:
 Solve optimization problems using simplex method.
 Apply integer programming and linear programming to solve real-life applications.
 Use PERT and CPM for problems in project management

Unit Starting Finishing No. of

Unit Description Test Plan
No. Date Date Hours

1. Linear programming 12
IA–I

2. Duality and Network 12

Model
IA –II
Exam
3. Integer programming 12
Classical optimization
4. theory 12
IA–III
5. Object scheduling 12

TEXT BOOK
1. H.A. Taha, “Operation Research”, Prentice Hall of India, 2002.
REFERENCES:
1. PaneerSelvam, „Operations Research‟, Prentice Hall of India, 2002
2. Anderson „Quantitative Methods for Business‟, 8th Edition, Thomson Learning, 2002.
3. Winston „Operation Research‟, Thomson Learning, 2003.
4. Vohra,„Quantitative Techniques in Management‟, Tata McGraw Hill, 2002.
5. AnandSarma, „Operation Research‟, Himalaya Publishing House, 2003.
UNIT I LINEAR PROGRAMMING

S. Reference Estimated Mode of

Description
No. Books hours teaching*
Principal components of decision
1 1 BBP
problem
2 Modeling phases 1 BBP

3 LP Formulation and graphic solution 3 BBP

PaneerSelvam,
4 Resource allocation problems “Operations Research‟, 2 BBP
Prentice Hall of India,
2002
5 Simplex method 4 BBP

6 Sensitivity analysis 1 BBP

7 Coaching/Revision 5 -
8 Test Hours 2 -
TOTAL 19

UNIT II - DUALITY AND NETWORKS

S. Reference Estimated Mode of

Description
No. Books hours teaching*
9 Definition of dual problem 1 BBP
1. PaneerSelvam,
10 Primal – Dual relationships „Operations 1 BBP
Research‟, Prentice
11 Dual simplex methods Hall of India, 2002 3 BBP
 12 Post optimality analysis 2 BBP

13 Transportation model 2 BBP

14 Assignment model 2 BBP

15 Shortest route problem 1 BBP

16 Coaching/Revision 5 -

17 Test Hours -
2
TOTAL 19

UNIT III - INTEGER PROGRAMMING

S. Description Reference Estimated Mode of

No. Books hours teaching*
4
18 Cutting plan algorithm BBP
4
19 Branch and bound methods BBP
Anderson 4
20 Multistage (Dynamic) programming. „Quantitative Methods for BBP
Business‟, 8th Edition,
Thomson Learning, 2002 5
21 Coaching/Revision -

2
22 Test Hours -

TOTAL 19

UNIT IV -CLASSICAL OPTIMISATION THEORY

Estim
S. Reference Mode of
Description ated
No. Books teaching*
hours
AnandSarma, 1
23 Unconstrained external problems BBP
„Operation Research‟,
Himalaya Publishing 2
24 Newton – Ralphson method
House, 2003 BBP
25 Equality constraints 1 BBP
 2
26 Jacobean methods BBP
2
27 Lagrangian method BBP
1
28 Kuhn – Tucker conditions BBP
3
29 Simple problem BBP
5
30 Coaching/Revision -
2
31 Test Hours -

TOTAL 19

UNIT V - OBJECT SCHEDULING

Reference Estimated Mode of

S. No. Description Test
Books hours
Hours
teaching*
32 Network diagram representation 3 BBP

33 Critical path method 3 BBP

1. PaneerSelvam,
Time charts and resource No of
34 Hours as„Operations Research‟, 3 BBP
leveling No of Reason for
Coaching/
Unit Hours as per Prentice Hall of India,
Deviation 2002 If
Deviation: Revision
35 PERT per syllabus Lesson Any 3 BBP
plan
36 Coaching/Revision 5 -

37 Test Hours 2 -

TOTAL 19
S.No.
Difficulties of
1. I 09 12 3 solving simplex 2 5
method
Difficulties of
2. II 09 12 3 solving dual 2 5
simplex method
Difficulties of
3. III 09 12 3 solving integer 2 5
programming
To solve more
4. IV 09 12 3
problems. 2 5
 To solve more
5. V 09 12 3 problems 2 5
 Types of Classes Planned Conducted

Total Lecture Hours 60

Test Hours 10

Coaching/Revision 25

Grand Total 95

SUBJECT STAFF HOD PRINCIPAL