Graduate Course Proposal Form Submission Detail - ESI6448
Edit function not enabled for this course.
Approved, Permanent Archive
Course Change Information (for course changes only):
- Department and Contact Information
Tracking Number Date & Time Submitted 1739 2006-10-12 Department College Budget Account Number Industrial and Management Systems Engineering EN 2103-000-00 Contact Person Phone Nan Kong 45553 firstname.lastname@example.org
- Course Information
Prefix Number Full Title ESI 6448 Integer Programming Is the course title variable? N Is a permit required for registration? N Are the credit hours variable? N Is this course repeatable? If repeatable, how many times? 0 Credit Hours Section Type Grading Option 3 C - Class Lecture (Primarily) R - Regular Abbreviated Title (30 characters maximum) Integer Prog. Course Online? Percentage Online -
ESI 6491 Linear Programming and Network Optimization
The course will present the theory and algorithms of integer programming, with emphasis on its applications in engineering. The tentative topics include integer programming formulation and relaxation and decomposition algorithms.
A. Please briefly explain why it is necessary and/or desirable to add this course.
With the advance of computing technology, we are able to solve effectively large-scale real-world optimization problems that involve discrete decisions (e.g., yes/no decisions). These problems are referred to as integer programs that arise in almost all i
B. What is the need or demand for this course? (Indicate if this course is part of a required sequence in the major.) What other programs would this course service?
Thie course serves as a graduate-level elective for both master and Ph.D. students in IMSE depatment. It is also expceted to serve other graduate students from CS, CivilE, and Business, just name a few.
C. Has this course been offered as Selected Topics/Experimental Topics course? If yes, how many times?
D. What qualifications for training and/or experience are necessary to teach this course? (List minimum qualifications for the instructor.)
A Ph.D. degree in Industrial Engineering, or in other technical disciplines such as Operations Research/Management, Applied Mathematics, Computer Science.
- Other Course Information
The course objective is to introduce the theory and algorithms of integer programming, with emphasis on its power and applicability for solving discrete optimization problems.
B. Learning Outcomes
The students will: (1) acquire a basic understanding of integer programming techniques applied for real-world decision making problems; (2) learn basic optimization concepts in integer programming; and (3) learn computational implementation and experimentation of integer programming solution techniques.
C. Major Topics
The tentative topics include MIP formulation, optimality and relaxation, Well-studied network optimization problems, branch and bound and its variations, and cutting planes.
"Integer Programming" by L. A. Wolsey. 1998. New York: John Wiley & Sons.
"Integer and Combinatorial Optimization" bt G. L. Nemhauser and L. A. Wolsey. 1999. John Wiley & Sons.
E. Course Readings, Online Resources, and Other Purchases
F. Student Expectations/Requirements and Grading Policy
G. Assignments, Exams and Tests
H. Attendance Policy
I. Policy on Make-up Work
J. Program This Course Supports
- Course Concurrence Information