Operations Research

Course Title: Operations Research

Course No: ORS255

Nature of the Course: THEORY

Semester: 4

Full Marks: 80 + 20

Pass Marks: 32 + 8

Credit Hours: 3

Course Description

The course covers fundamental concepts of operations research including introduction, optimization, queuing models theory of games, decision theory, and networking analysis.

Course Objectives

The main objective of this course is to develop knowledge and skill to the students on the Operations research tools and techniques such as optimization, queuing theory, theory of games, decision theory and networking analysis.

Course Contents

1. Introduction

3 hrs

1.1. History, Development of operations research

1.2. Objective of OR

1.3. Scope of OR

1.4. Nature and Definition of OR

1.5. Characteristics of OR

1.6. Scientific Method in OR

1.7. Models and Modeling in OR

1.8. Limitation of OR

1.9. Applications of OR

2. Optimization

17 hrs

2.1. Linear Programming I: Formulation and Graphic Solution

Introduction to Linear programming problem

Formulation of linear programming problem

General statement of linear programming problem

Assumptions underlying linear programming

Solution to linear programming-graphic method

Some special cases in linear programming

2.2. Linear Programming II: Simplex Method

Simplex method

Solution to maximization problems

Solution to minimization problems

Big-M method

Some special cases in linear programming

2.3. Transportation Problem

VAM method for generating initial basic feasible solution

Testing Optimality condition by using MODI Method

Balanced and unbalanced transportation problem

2.4. Assignment Problem

Introduction

Hungarian Assignment Method (HAM)

Some special cases: Unbalanced assignment problems, constrained assignment problem

3. Queuing Models

6 hrs

3.1. Introduction

3.2. Economies of the queuing problem

3.3. Queuing system and its essential elements

3.4. Types of queuing model

Single channel system

Multi-channel system

3.5. Operating characteristics of single channel system (Poisson-exponential single server model-infinite population)

3.6. Poisson-exponential multiple server model-infinite population

4. Theory of Games

6 hrs

4.1. Introduction

4.2. Basic terminologies

4.3. Two persons zero-sum game

4.4. Pure strategy and mixed strategy

4.5. Dominance rule

4.6. Algebraic method

4.7. Arithmetic method

4.8. Graphical method

5. Decision Theory

5 hrs

5.1. Introduction

5.2. Decision making environment

5.3. Decision making criteria under risk

EMV criterion

EOL criterion

EVPI

5.4. Decision tree analysis

5.5. Marginal analysis

5.6. Decision making criteria under uncertainty

6. Networking Analysis

8 hrs

6.1. PERT/CPM networks

6.2. Scheduling the activities

Earliest and Latest Times

Time-cost trade off analysis

Text Books

1.Sharma, J.K. (2013). Operations Research Theory and application. (5th ed). New Delhi: Laxmi Publications
2.Operations Research: An Introduction, Handy A. Taha, 10/e, Pearson

Notes:

This syllabus follows the official BIT curriculum of Tribhuvan University. In case of any doubt or revision, the university’s published syllabus shall be considered authoritative.

Operations Research

Operations Research

Select University

Select Program

TabFlux . Operations Research . TU . BIT