MATHS 456: Introduction to Operations Research (3)

Syllabus

1.      Prerequisites: MATHS 162 or 166, and MATHS 217, or permission of department chairperson.

2.      Course Description: Optimization techniques of linear programming, dynamic programming, and integer programming. Optimal solutions of PERT-CPM networks. Optimal decision strategies.

3.      Course Objectives: Introduce the students to techniques used in operations research. By the end of the course the students should have an in-depth knowledge of basic techniques of optimization and be able to apply this knowledge to real world problems.

4.      Course Rationale: Operations research tries to determine the optimal course of action of a decision under the restriction of limited resources. The applications of the course range from solving simple business problems such as optimizing a profit function with certain physical constraints, to managing mining operations or airplane traffic.

5.      Course Content: Topics include the simplex method, duality theory, network minimization problems, transportation problems, integer and dynamic programming, and constrained and unconstrained nonlinear extremal problems.

A.

Introduction

B.

Linear Programming

C.

Network and Transportation

D.

Dynamic Programming

E.

Integer Programming

F.

Optimal Nonlinear Programming

6.      Methods of Evaluating Student Performance: Course grades are determined primarily by student performance on tests and computer assignments, as well as possibly quizzes, homework, and class participation. Students are evaluated on content material and on their ability to communicate this material to others orally and/or in writing. The evaluation and weight of these various components are at the discretion of the individual instructor.

7.      Evaluation of the Course: The instruction of the course is evaluated by departmental student evaluations and peer evaluations. The course is reviewed and revised periodically by the Departmental Undergraduate Programs Committee.

J. Baglama, R. Pierce 1/2001; V. Mascioni, R. Pierce 4/2004; I. Livshits Spring 2006