This course will explore the fundamental theories and methodologies of linear optimization and demonstrate how these techniques can be used to solve practical optimization problems. Two typical linear optimization techniques, linear programming and integer programming, will be introduced and discussed. The first part, linear programming, explores the simplex algorithm and the duality theory that act as the cornerstones of modern linear optimization solvers. The second part, integer programming, covers a broader range of topics in both methodology and applications, including problem modeling, model analysis, and decomposition- and relaxation-based solution methods. Implementation issues and industry cases will also be discussed.
Unlock more information by signing in with your HKUST account.