| |
Dec 15, 2025
|
|
|
|
|
ISE 7610 - Operations Research I - Combinatorial Optimization
Focuses on Combinatorial Optimization. The topics include algorithms and their computational complexity, convex optimization, linear programming, duality theory, solution techniques for integer programming and relaxation methods, transportation and various network problems, and finally stochastic programming methods.
Requisites:
Credit Hours: 2
Repeat/Retake Information: May not be retaken.
Lecture/Lab Hours: 2.0 lecture
Grades: Eligible Grades: A-F,WP,WF,WN,FN,AU,I
Learning Outcomes:
- Apply stochastic programming.
- Solve integer programming models and its relaxation methods.
- Solve transportation and network flow problems.
- Understand Computational Complexity.
- Understand Convex Optimization and Mathematical programming.
- Use linear programming and duality theory.
Add to Portfolio (opens a new window)
|
|
