Course Schedule and Catalog
Course Schedule - Fall Semester 2025
Meeting location information can now be found on student schedules in ESTHER (for students) or on the Course Roster in ESTHER (for faculty and instructors).Additional information available here.
Meeting location information can now be found on student schedules in ESTHER (for students) or on the Course Roster in ESTHER (for faculty and instructors).Additional information available here.
CMOR 441 001 (CRN: 14033)
LINEAR AND INTEGER PROGRAMMING
Long Title: LINEAR AND INTEGER PROGRAMMING
Department: Comp Appl Math Operations Rsch
Instructor: Perez Salazar, Sebastian
Meeting: 9:25AM - 10:40AM TR (25-AUG-2025 - 5-DEC-2025)
Part of Term: Full Term
Grade Mode: Standard Letter
Course Type: Lecture
Language of Instruction: Taught in English
Method of Instruction: Face to Face
Credit Hours: 3
Course Syllabus:
Course Materials: Rice Campus Store
Restrictions:
Must be enrolled in one of the following Level(s):
Undergraduate Professional
Visiting Undergraduate
Undergraduate
Prerequisites: (MATH 302 OR MATH 321 OR MATH 331) AND (CAAM 335 OR CMOR 302 OR CMOR 303 OR MATH 355 OR MATH 354)
Section Max Enrollment: 40
Section Enrolled: 23
Total Cross-list Max Enrollment: 60
Total Cross-list Enrolled: 35
Enrollment data as of: 15-DEC-2025 8:33PM
Final Exam: Scheduled Final Exam-OTR Room
Final Exam Time:
13-DEC-2025
2:00PM - 5:00PM S
Description: This course provides a rigorous introduction to linear optimization with continuous and integral variables. We explore the theory and algorithms of linear and integer programming. Topics studied in the linear programming part include polyhedral theory, duality, and algorithms for solving linear programs. Building on linear programming, the second part of this course studies linear optimization with integral variables. Here, the topics covered are integral polyhedra and perfect formulations, including TU matrices and TDI systems. We culminate with exact methodologies for integer programming, including branch-and-bound and cutting-plane techniques. This course provides the foundations for further studies in convex optimization, combinatorial optimization, and stochastic programming. Cross-list: CMOR 541. Recommended Prerequisite(s): CAAM 378 or CMOR 360