This lecture covers the concept of optimal decision making using discrete optimization, focusing on binary variables and their applications in practical problems. Topics include mixed-integer linear programming, the 0-1 knapsack problem, and modeling with binary variables. The instructor discusses LP relaxation, the strength of formulations, and modeling with exponentially many constraints.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on Mediaspace