Optimisation - Linear Integer Programming - Professor Raphael Hauser
Offered By: Alan Turing Institute via YouTube
Course Description
Overview
Explore linear integer programming and mixed integer programming in this comprehensive lecture by Professor Raphael Hauser from the Alan Turing Institute. Delve into supply chain management applications and learn about the branch and bound algorithm, including its use in solving the Traveling Salesman problem. Understand the mechanism of bounds, infeasibility, pruning by optimality, and LP relaxation. Examine fractional branching techniques and their implementation in optimization problems. Gain insights from a renowned expert with extensive experience in mathematics, theoretical physics, and operations research, whose work spans across numerical analysis, applied probability, and distributed computing.
Syllabus
Intro
Linear Integer Programming
Mixed Integer Programming
Supply Chain Management
Branch and Bound
Traveling Salesman
Branchandbound
Mechanism of Bounds
Example
Infeasibility
Pruning by Optimality
LP Relaxation
fractional branching
Taught by
Alan Turing Institute
Related Courses
Discrete OptimizationUniversity of Melbourne via Coursera Solving Algorithms for Discrete Optimization
University of Melbourne via Coursera Mathematical Optimization for Business Problems
IBM via Cognitive Class Reinforcement Learning in Recommender Systems - Some Challenges
Simons Institute via YouTube Neural Network Verification as Piecewise Linear Optimization
Institute for Pure & Applied Mathematics (IPAM) via YouTube