Scribd
Upload
2 views3 pages

Math 330 Course Outline

MATH 330: Operations Research I is a 3 credit hour course that focuses on applying mathematical techniques to solve decision problems across various fields. The course covers topics such as linear programming, transportation and assignment models, network models, and queuing models, with an emphasis on problem identification, formulation, and interpretation. Assessment includes continuous assessments (30%) and end-of-trimester examinations (70%).

Uploaded by

bosiboribeatrice25
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views3 pages

Math 330 Course Outline

MATH 330: Operations Research I is a 3 credit hour course that focuses on applying mathematical techniques to solve decision problems across various fields. The course covers topics such as linear programming, transportation and assignment models, network models, and queuing models, with an emphasis on problem identification, formulation, and interpretation. Assessment includes continuous assessments (30%) and end-of-trimester examinations (70%).

Uploaded by

bosiboribeatrice25
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

MATH 330: Operations Research I (3 Credit hours)

Prerequisite: MATH 110

Purpose of the Course:

This course is designed to develop the skills of the learner in employing mathematics in addressing
aspects of decision problems arising in a wide variety of fields through problem identification,
formulation, solving, and interpretation.

Expected Learning Outcomes of the Course:

At the end of the course, the learner should be able to:

 Define operations research.

 state the procedure of problem identification, formulation, solving, and interpretation

 Apply various O.R techniques in solving practical problems

COURSE CONTENT:

Introduction: model and problem formulation. Linear programming: characteristics, assumptions,


methods of solution – graphical and simplex method. Duality and sensitivity analysis. Transportation
and Assignment models. Formulation and methods of solution. Network models: spanning trees,
shortest networks problems,maximum flow,CPM/PERT. . Queuing models: structure and
components, examples, single and multi channel.

COURSE OUTLINE

WEEK/LECTURE TOPIC SUB-TOPIC

1 INTRODUCTION -definition

-model and problem formulation

2 LINEAR PROGRAMMING -characteristics

-assumptions

-limitations

-formulation
3 LINEAR PROGRAMMING solution-graphical method

4 LINEAR PROGRAMMING solution-simplex method

5 LINEAR PROGRAMMING -duality

-sensitivity analysis

6 TRANSPORTATION formulation and solution


MODEL
-n-w corner method

-lcm

-vam

7 CAT I

8 ASSIGNMENT MODEL formulation and solution

-minimization

-maximization

9 NETWORK MODELS -spanning trees

-shortest network

-network diagrams

10 NETWORK MODELS cpm/pert

-floats

11 QUEUING MODELS -structures and components

-solutions

12 QUEUING MODELS -single and multi channels

13 CAT II

14 &15 EXAMS
Mode of Delivery:

 Lectures

 Tutorials

 Independent study

 Group discussions

Instructional Materials and/or Equipment:

 Computer installed with MATLAB

Course Assessment:

 Continuous Assessments 30%

 End of Trimester Examinations 70%

Core Reading Materials for the Course:

 Bronson, R. and Naadimuthu, G.: Schaum's Outline of Operations Research; McGraw Hill, 2008.

 Jensen, P. A. and Bard, J. F.: Operations Research Models and Methods; McGraw-Hill, 2008.

 Naidu, N. V. R. Babu, K. M. and Rajendra, G.: Operations Research; Prentice Hall, 2006.

Recommended Reference Materials:

 Taha, H. A.: Operations Research: An Introduction; Prentice Hall, 2006

You might also like