Return to Index
Operations Research Models and Methods
 
Operations Research Models

Syllabus - Operations Research Models Class

Required Texts

Operations Research Models and Methods, Paul A. Jensen and Jonathan F. Bard, John Wiley Inc., 2003

 

Operations Research Models Workbook, 2003, by Paul A. Jensen

Computer Programs

Access to Microsoft Excel version 97 or later for Windows or Mac OS.  The Excel Solver Add-In will be used as well as add-ins from the ORMM collection. 

Syllabus

It is a mark of modern society that decisions must often be made under circumstances characterized by novel conditions, limited resources, conflicting goals, expensive experimentation, complex organizations, uncertainty, and short response time. Operations research (or the practical equivalent, management science) is a field of study explicitly devoted to aiding decision makers under such circumstances. The goal of operations research is to provide procedures for formulating models of decision-making problems, finding solutions to the models that optimize objective measures of merit, and implementing the solutions in an attempt to solve the problems. To this end a number of mathematical techniques have been developed that are exercised primarily with the help of a computer. This course is specifically concerned with modeling problems typically encountered in operations research studies and solving the problems with readily available computer programs. Subjects covered include linear programming, integer programming, nonlinear programming, network flow programming, probability models, queuing analysis and simulation.

This course is for senior level students or first year graduate students. The course is appropriate for students from a variety of disciplines.

This schedule is for a one semester course meeting three times a week for 50 minute sessions. The column labeled WB holds references to a workbook. Workbook sections are numbered in correspondence to book chapters. The column labeled ORMM holds references to the text. The abbreviation sup. refers to supplemental text on the CD that comes with ORMM. The column labeled Links holds links to other pages on this site.

Period

Subject

WB

ORMM

Links

1

Problem Solving Process

Ch. 1

2

Linear Programming/Excel

2.0
2.1-2.3
Models

3

Problem Solving 1

Computation

4

Solutions/Sensitivity Analysis

2.1
2.4-2.5

5

Problem Solving 2

6

Problem Classes

2.2
2.6

7

Problem Classes

8

Problem Solving 3

9

Nonlinear Objective

2.3
2.A.1 Sup.

10

Maximizing the Minimum

2.4
2.A.2 Sup.

11

Problem Solving 4

12

Goal Programming

2.5
2.A.3 Sup.

13

Network Flow Programming

5.0
5.1-5.3
Models

14

Problem Solving 5

Computation

15

Network Examples

5.1
5.4

16

Integer Programming

7.0
7.1-7.2
Models

17

Problem Solving 6

Computation

18

Nonlinear Objective

7.1
7.8

19

Fixed Charge, Location, Covering

7.2
7.4-7.7

20

Problem Solving 7

21

Nonlinear Programming

9.0
9.1-9.2
Models

22

Determining Convexity

9.2
9.3

23

Problem Solving 8

Computation

24

Review

25

Exam

26

Exam

27

Probability Models

11.0
21 Sup.

28

Discrete Distributions

11.1
21.3 Sup.

29

Problem Solving 9

30

Continuous Distributions

11.2
21.4 Sup.

31

Continuous Distributions

11.3

32

Problem Solving 10

33

Queuing Models

16.0
16.1-16.3

34

Queuing Models

16.1

35

Problem Solving 11

36

Queuing Networks

17.0
17.1-17.2

37

Queuing Networks

38

Problem Solving 12

39

Simulation

18.0
18.1-18.3

40

Simulation

18.1
21.5 Sup.

41

Problem Solving 13

42

Review

43

Exam

44

Final Exam


  
Return to Top

Operations Research Models and Methods
Internet
by Paul A. Jensen
Copyright 2004 - All rights reserved