Uttaranchal University

UIM
Department of Information Technology
Lesson Plan

Subject Code BCA -602 Subject Name Computer based Optimization

Techniques
Faculty Name : Mr. Deepak Pant

Objectives (Comprehensive):
The overall objectives of computer based optimization techniques are to give feasible solution to
hard problems. This also includes to a selection of the most feasible techniques, and explains
how, when and why they work. and possibilities to , will be explained. For some of the simpler
techniques, derive error estimates, demonstrating that the methods work to a specified accuracy.

Learning Outcomes:

1. The student will learn that how to apply CBOT methods to hard problems.
2. The student will able to solve the LPP formulation.
3. Will understand some aspects of computer programming.
4. Will understand the concepts of algorithms.
5. An ability to apply knowledge of computing, mathematics, science, and engineering
appropriate to the modeling and design of software.
6. Will implement the numerical using computer software and can apply them in example.

.Lecture Unit Topics to be covered Ref. book(s) with Date Remarks

No page number(s) covered
1 I Introduction to OR- definition “Operation
Research”,S.D.Sharma
,pp-3,4
2 I Historical devlopment “Operation
Research”,S.D.Sharma
,pp-3,4

3 I Appliction and limitation of “Operation

optimization methods Research”,S.D.Sharma
,pp-6,7,8

4 I Model formulation, “Operation

Research”,S.D.Sharma
 ,pp-10,11

5 I Model formulation “Operation

Research”,S.D.Sharma
,pp-3.1(3)

6 II Linear programming problem, “Operation

introduction Research”,S.D.Sharma
,pp-23

7 Formulation of LPP “Operation

Research”,S.D.Sharma
,pp- 3.2,3

8 II Graphical solution of LPP “Operation

Research”,S.D.Sharma
,pp-3.3, 26-30

9 II Simplex method “Operation

Research”,S.D.Sharma
,pp-5.1, 67

10 II Simplex method “Operation

Research”,S.D.Sharma
,pp-5.1, 67

11 II Solution of LPP by simplex method “Operation

Research”,S.D.Sharma
,pp-69

12 II Solution of LPP by simplex method “Operation

Research”,S.D.Sharma
,pp-69

13 II Artificial Variable techniques(Big M) “Operation

method Research”,S.D.Sharma
,pp-5.5, 84

14 II Two phase of simplex method “Operation

Research”,S.D.Sharma
,pp-5.5, 81

15 III Problem of degeneracy “Operation

Research”,S.D.Sharma
,pp-5.7, 95

16 III Dual simplex method “Operation

Research”,S.D.Sharma
,pp-7.1, 158
17 III Dual and primal problem “Operation
Research”,S.D.Sharma
,pp- 7.1, 159

18 III Duality and simplex method “Operation

Research”,S.D.Sharma
,pp- 7.1, 160

19 III Duality and simplex method “Operation

Research”,S.D.Sharma
,pp-7.1,160

20 III Solution of LPP “Operation

Using revised simplex method Research”,S.D.Sharma
,pp-7.1,164

21 III Special type of LPP “Operation

Research”,S.D.Sharma
,pp-11.1, 262

22 III Standard transposition problem “Operation

Research”,S.D.Sharma
,pp- 11.3, 263

23 III Standard transposition problem “Operation

Research”,S.D.Sharma
,pp- 11.3,263

24 III Balanced transportation problem “Operation

Research”,S.D.Sharma
,pp-11.4, 266

25 III VAM method “Operation

Research”,S.D.Sharma
,pp-11.8, 274

26 III Degeneracy in transportation problem “Operation

Research”,S.D.Sharma
,pp- 11.1, 297

27 III Assignment problem “Operation

Research”,S.D.Sharma
,pp-12.1, 352

28 III Solution of Assignment problem “Operation

Research”,S.D.Sharma
,pp-12.1

29 IV Hungarian method “Operation

Research”,S.D.Sharma
 ,pp-12.1 382

30 IV Game theory “Operation

Research”,S.D.Sharma
,pp-19.1, 3-15

31 IV Integer programming “Operation

Research”,S.D.Sharma
,pp-10.1, 234

32 IV Branch techniques “Operation

Research”,S.D.Sharma
,pp- 101, 251

33 IV Bound Techniques “Operation

Research”,S.D.Sharma
,pp- 10.1,253

34 IV Gomory plane method “Operation

Research”,S.D.Sharma
,pp-10.1, 237

35 IV Cut and Mix method “Operation

Research”,S.D.Sharma
,pp-10.1, 240

36 IV Binary lenear prgraming “Operation

Research”,S.D.Sharma
,pp

37 IV Dynamic programing “Operation

Research”,S.D.Sharma
,pp

38 IV Basic concepts “Operation

Research”,S.D.Sharma
,pp

39 IV Bellman optimality principle “Operation

Research”,S.D.Sharma
,pp

40 IV D.P models “Operation

Research”,S.D.Sharma
,pp

41 IV Queing Models, Notation and “Operation Research”,S

assumption, Elements of Queing model, Kalavathy ,pp-412
Charecteristics of Queing model
42 IV Measurement of system performance “Operation Research”,S
 Kalavathy ,pp-418

43 V Single channel queing model, Multiple “Operation Research”,S

channel model Kalavathy ,pp-418

44 V Other queuing model. “Operation Research”,S

Kalavathy ,pp-417

45 V Poisson arrival rate withdistribution “Operation Research”,S

Kalavathy ,pp-416

46 V Finite queue length “Operation Research”,S

Kalavathy ,pp-419

47 V Priority service model “Operation Research”,S

Kalavathy ,pp-422

48 V Priority service model “Operation Research”,S

Kalavathy ,pp-422

Reference Books:
1. Gross D., and Harris, C. M., “Fundamentals of queueing theory “, John Willey and Sons, NY.

2. Hillier F., and Lieberman, G. J. , “Introduction to Operation Research”, Holden Day ,NY.

3. Taha, H. A., “Operations Research – An Introduction”, McMillan Publishing Company, NY

Text Books:
1 S.D.Sharma” Operation Research”,Kedarnath.
2. Kalavathy S,”Operation Research”,Vikas publication.
Signature of Faculty Signature of HOD Signature of Director