Executive Development Programme in Integer Programming: Solving Discrete Optimization Problems

This program is designed for senior managers, data scientists, and operations researchers who need to apply advanced integer programming techniques to solve discrete optimization problems. Participants will gain a deep understanding of integer programming models and algorithms, enabling them to develop and implement sophisticated solutions to complex business challenges.

Attendees will learn to formulate real-world problems as integer programs, select appropriate solving techniques, and evaluate solution quality. By the end, they will be equipped to drive operational efficiency and strategic decision-making through advanced optimization methodologies.

1. 1. Introduction to Integer Programming: Learners will study the basics of integer programming, including problem formulation and modeling techniques. They will gain foundational skills in recognizing and formulating real-world discrete optimization problems.
2. 2. Linear Programming Foundations: The module covers linear programming concepts, duality, and sensitivity analysis, providing learners with the necessary background to understand more complex integer programming problems.
3. 3. Basic Integer Programming Techniques: Learners will explore simple integer programming methods such as branch and bound, cutting planes, and heuristics, gaining practical skills in solving small to medium-sized problems.
4. 4. Advanced Integer Programming Methods: The focus shifts to more sophisticated techniques like branch and cut, column generation, and Lagrangian relaxation, enabling learners to tackle larger and more complex optimization challenges.
5. 5. Mixed-Integer Programming: This module delves into mixed-integer programming, covering the formulation and solution of models with both integer and continuous variables, enhancing learners' ability to model real-world scenarios accurately.
6. 6. Constraint Programming: Learners will study constraint programming techniques and their integration with integer programming, learning how to effectively use constraints to model and solve optimization problems.
7. 7. Decomposition Methods: The module introduces decomposition techniques such as Benders decomposition and Dantzig-Wolfe decomposition, providing learners with methods to break down large problems into more manageable subproblems.
8. 8. Heuristic and Metaheuristic Approaches: Learners will explore various heuristic and metaheuristic algorithms, such as genetic algorithms and simulated annealing, gaining skills in applying these methods to find good solutions quickly.
9. 9. Applications in Network Design: This module focuses on applying integer programming to network design problems, including facility location, network flow, and transportation problems, enhancing learners' ability to solve practical network-related optimization challenges.
10. 10. Case Studies and Project Work: The final module involves working on real-world case studies and a project that integrates the skills learned throughout the program, providing learners with practical experience in solving complex discrete optimization problems.