IME 470: INFORMATION AND POLICIES



Instructor Information | Course Description | Course Policies | Course Outline




INSTRUCTOR INFORMATION:

INSTRUCTOR: Canan Bilen Green
OFFICE: 202G CIE
EMAIL: canan_bilen_green@ndsu.nodak.edu
PHONE: (701) 231-7283-Office
PHONE: (701) 293-7847-Home
OFFICE HOURS: MW 1:00-3:0, R 3:00-5:00 or by appointment




COURSE DESCRIPTION:

Course provides a solid introduction to concepts and methods in operations research.
Topics include linear programming, transportation models, assignment models, integer programming
network flows, project management, nonlinear programming.
Practical examples will be used as to illustrate concepts.

TIME: MWF 9:00-9:50 AM
PLACE: CIE 207
TEXTBOOK:
Introduction to Management Science,
Bernard W. Taylor III, Sixth Edition 1999.
PREQUISITES: MATH 260

Instructor Information | Course Description | Course Policies | Course Outline



COURSE POLICIES:

GRADING

Percentage
Tentative Dates
Homework
20%
Weekly
Exam 1
20%
2/5, Friday 9:00-9:50 AM
Exam 2
20%
3/26, Friday 9:00-9:50 AM
Final
20%
5/7, Friday 7:30-7:30 AM
Quizzes (4)
15%
Unannounced
Project
5%
4/28, Friday 9:00-9:50 AM

Letter grades: 90-100 = A; 80-89 = B; 70-79 = C; 60-69 = D; <60 = F
Grade thresholds may be lowered at the discretion of the instructor.

HOMEWORK

Homework will be assigned on a weekly basis. Selected homework problems will be collected, and graded.
Late homework will be graded but given no credit. Please feel free to discuss course topics and assignments.
However, each student must complete their own work individually. Plagiarism will not be tolerated.
Please work neatly, show all your work, and clearly indicate all answers.
Homework solutions will be posted on the class web shortly after
assignment collection. Some homework will be discussed in class.

EXAMS

Exams will emphasize class material and homework exercises. Exams will not be a regurgitation of class material.
Rather, students are expected to apply concepts, techniques, and methods to new situations.
Exams will be closed book. Student must take exams at scheduled time.
Make-up exams will not be given if the student did not contact
the instructor prior to missing an exam.

Instructor Information | Course Description | Course Policies | Course Outline



COURSE OUTLINE

SESSION

Session

Date

Topic

HW Due

Reading

1

1/6 W

Introduction

   

2

1/8 F

Management science

Give 1st

Chapter 1

3

1/11 M

Linear programming

 

Chapter 2

4

1/13 W

Model formulation

   

5

1/15 F

Graphical solution

HW1

 

6

1/18 M

Martin Luther King, Jr. Day Holiday- No Class

   

7

1/20 W

Linear programming: computer solution

 

Chapter 3

8

1/22 F

Graphical solution

HW2

 

9

1/25 M

Linear programming: modeling examples

 

Chapter 4

10

1/27 W

Modeling examples, continued

   

11

1/29 F

Modeling examples, continued

HW3

 

12

2/1 M

Simplex solution method

 

Chapter 5

13

2/3 W

Simplex solution method

   

14

2/5 F

EXAM #1

   

15

2/8 M

Simplex solution method

   

16

2/10 W

Simplex solution method

   

17

2/12 F

Simplex solution method

HW4

 

18

2/15 M

Presidents Day Holiday- No Class

   

19

2/17 W

Post optimality analysis

   

20

2/19 F

Post optimality analysis, continued

HW5

 

21

2/22 M

Transportation problem

 

Chapter 6

22

2/24 W

Transportation problem, continued

   

23

2/26 F

Transportation problem, continued

HW6

 

24

3/1 M

Assignment problem

   

25

3/3 W

Assignment problem, continued

   

26

3/5 F

Assignment problem, continued

HW7

 

27

3/8 M

Spring Break- No Class

   

28

3/10 W

Spring Break- No Class

   

29

3/12 F

Spring Break- No Class

   

30

3/15 M

Integer programming

 

Chapter 7

31

3/17 W

Integer programming, continued

   

32

3/19 F

Integer programming, continued

HW8

 

33

3/22 M

Goal programming

 

Chapter 8

34

3/24 W

Goal programming, continued

   

35

3/26 F

EXAM #2

   

36

3/29 M

Network flows

 

Chapter 10

37

3/31 W

Network flows, continued

   

38

4/2 F

Recess -No Class

   

39

4/5 M

Recess -No Class

   

40

4/7 W

Network flows, continued

   

41

4/9 F

Network flows, continued

HW9

 

42

4/12 M

Project management

 

Chapter 11

43

4/14 W

Project management, continued

   

44

4/16 F

Project management, continued

HW10

 

45

4/19 M

Project management, continued

   

46

4/21 W

Project management, continued

   

47

4/23 F

Project management, continued

HW11

 

48

4/26 M

Nonlinear programming

 

Chapter 9

49

4/28 W

Nonlinear programming, continued

   
 

5/7 F

COMPREHENSIVE FINAL EXAM from 7:30 to 9:30 AM

   
Instructor Information | Course Description | Course Policies | Course Outline