ORIE 5135

ORIE 5135

Course information provided by the 2026-2027 Catalog.

This course in Discrete Optimization is focused on Nondeterministic Polynomial-hard problems but with a very strong focus on the use of Mixed-Integer Linear Programming, general-purpose solvers to attack them.


Enrollment Priority Enrollment limited to: Cornell Tech students. Recommended prerequisites: ORIE 5380 or CS 5727 or some knowledge of linear programming.

Last 4 Terms Offered 2026SP, 2022SP

Learning Outcomes

  • Ability to express combinatorial optimization problems by models with linear constraints and integer variables.
  • Discriminate among various types of models depending on their solvability with modern mixed-integer programming solvers.
  • Analyze the complexity of the most important combinatorial optimization problems.
  • Understand, design and implement mixed-integer programming algorithms to solve the developed models.

View Enrollment Information

Syllabi: none
  •   Regular Academic Session. 

  • 3 Credits GradeNoAud

  •  7776 ORIE 5135   LEC 030

    • TR
    • Lodi, A

  • Instruction Mode: In Person

    Enrollment limited to: Cornell Tech students.