Integer Programming Basics

Related lectures (32)

Page 2 of 4

Covers the modelling and optimization of energy systems, focusing on solving optimization problems with constraints and variables.

Explores integer programs, nonconvex optimization, constraints, and geometric aspects of linear programming for optimal solutions.

Covers semi-definite programming and optimization over positive semidefinite cones.

Explores zero-sum games and the minimax theorem in Game Theory, emphasizing optimal strategies.

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

Covers sensitivity analysis in linear programming, focusing on optimal solutions and their sensitivities to changes.

Covers the concept of hedging for Linear Programs and the simplex method, focusing on minimizing costs and finding optimal solutions.

Explores energy system modeling using optimization techniques and performance indicators.

Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.

Covers the main idea behind the Simplex algorithm and explains the Tableau method for solving linear programming problems.