NJIT HONOR CODE

All Students should be aware that the Department of Mathematical Sciences takes the NJIT Honor code very seriously and enforces it strictly.  This means there must not be any forms of plagiarism, i.e., copying of homework, class projects, or lab assignments, or any form of cheating in quizzes and exams.  Under the Honor Code, students are obligated to report any such activities to the Instructor.


 

Mathematics 334-001:

OPERATIONS RESEARCH

FALL 2005

 

Course Schedule Link

ô   Instructor:  Prof. Tavantzis

ô   Textbook:  Operations Research, an Introduction by Hamdy A. Taha

ô   Grading Policy:  The final grade in this course will be determined as follows:

 

±    Homework:

 

1/3 of final grade

±    Quizzes:

 

1/3 of final grade

±    Final Exam:

 

1/3 of final grade

 

ô    Homework –Quiz – Exam Policy:  There will be HW assigned, collected and graded which will count 1/3 of the grade.  There will be short quizzes given regularly which will also count 1/3 of the grade.  And the Final Exam will count 1/3 as well.

 

 

Class Policies:

Attendance and Participation:  Students must attend all classes. Absences from class will inhibit your ability to fully participate in class discussions and problem solving sessions and, therefore, affect your grade. Tardiness to class is very disruptive to the instructor and students and will not be tolerated.

Makeup Exam Policy: There will be no makeup exams, except in rare situations where the student has a legitimate reason for missing an exam, including illness, death in the family, accident, requirement to appear in court, etc. The student must notify the Math office and the Instructor that he/she will miss an exam. In all cases, the student must present proof for missing the exam, e.g., a doctor's note, police report, court notice, etc., clearly stating the date AND times.

Cellular Phones:  All cellular phones and beepers must be switched off during all class times.

 

Course Topics:

 

Week

Topics:

 

 

Week 1

Graphical solutions and sensitivity analysis of simple linear programming problems. Use of software.

Week 2

Simplex method and applications.

Week 3

Duality.

Week 4

Transportation models.

Week 5

Transportation models( continued).

Week 6

Solution of linear programming problems using matrices.

Week 7

Integer linear programming.

Week 8

Game theory.

Week 9

Review of basic probability.

Week 10

Birth and death processes.

Week 11

Queuing models.

Week 12

Simulation.

Week 13

Nonlinear optimization, unconstrained.
* Thanksgiving Recess *

Week 14

Nonlinear optimization, constrained.

Week 15

Lagrange method and KKT conditions.

 

FINAL EXAM WEEK:  DECEMBER 15-21, 2005

 

Prepared By:  John Tavantzis

Last revised:  August 11, 2005