In this note we use the concept of intersection cut, introduced by Balas for integer programming problems, to develop a cutting-plane algorithm for solving integer interval linear programming problems ...

Mixed-integer programs (MIPs) involving logical implications modeled through big-M coefficients are notoriously among the hardest to solve. In this paper, we propose and analyze computationally an ...

Formulate linear and integer programming problems for solving commonly encountered optimization problems. Understand how approximation algorithms compute solutions that are guaranteed to be within ...

This course examines formulation and solution of applicable optimization models, including linear, integer, nonlinear, and network problems, efficient algorithm methods, and use of computer modeling ...

Linear Programming: Basics, Simplex Algorithm, and Duality. Applications of Linear Programming: regression, classification and other engineering applications. Integer Linear Programming: Basics, ...