Exact methods: Gomory cuts

Related lectures (32)

Page 3 of 4

Explores mixed-integer linear programming, binary variables, 0-1 knapsack, assignment problems, and LP relaxation strength.

Covers the basics of linear programming and the simplex method, focusing on finding optimal solutions and handling degeneracy.

Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.

Explores finding the initial Basic Feasible Solution (BFS) in a linear program.

Explores modeling classic optimization problems as mixed integer linear problems, focusing on the knapsack problem and its applications.

Explores extreme points in linear programming and the role of constraints in finding optimal solutions.

Explores optimal decision making through discrete optimization, emphasizing binary variables and practical applications.

Explores solving discrete optimization problems by relaxing integrality constraints.

Covers the linear programming approach to reinforcement learning, focusing on its applications and advantages in solving Markov decision processes.

Explores energy system modeling using optimization techniques and performance indicators.