Linear and Integer Programming

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (32)

Page 1 of 4

Optimization Problems: Path Finding and Portfolio Allocation

Covers optimization problems in path finding and portfolio allocation.

Convex Polyhedra and Linear Programs

Explores convex polyhedra, linear programs, and their optimization importance.

Linear Programming Techniques in Reinforcement Learning

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

Linear Programming Basics

Introduces linear programming basics, including optimization problems, cost functions, simplex algorithm, geometry of linear programs, extreme points, and degeneracy.

Linear Programming: Weighted Bipartite Matching

Covers linear programming, weighted bipartite matching, and vertex cover problems in optimization.

Optimal Transport: Rockafellar Theorem

Explores the Rockafellar Theorem in optimal transport, focusing on c-cyclical monotonicity and convex functions.

Optimisation Problem: Solving by FM

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

Solving Integer Linear Programs

Covers solving integer linear programs graphically, algorithmically, and through optimization methods.

Linear Programming: Convex Hull

Covers MAE regression, convex hull, reformulation advantages, and practical problems with decision variables and constraints.

Convex Optimization Problems: Theory and Applications

Explores convex optimization problems, optimality criteria, equivalent problems, and practical applications in transportation and robotics.