Skip to main content
Graph
Search
fr
|
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Linear Programming: Weighted Bipartite Matching
Graph Chatbot
Related lectures (31)
Previous
Page 2 of 4
Next
Optimization Programs: Piecewise Linear Cost Functions
Covers the formulation of optimization programs for minimizing piecewise linear cost functions.
Cutset Formulation: MST Problem
Explores the cutset formulation for the MST Problem and Gomory Cutting Planes method.
Optimisation Problem: Solving by FM
Covers the modelling and optimization of energy systems, focusing on solving optimization problems with constraints and variables.
Semi-Definite Programming
Covers semi-definite programming and optimization over positive semidefinite cones.
Hedging for LPs
Covers the concept of hedging for Linear Programs and the simplex method, focusing on minimizing costs and finding optimal solutions.
Introduction to Optimization
Covers the basics of optimization, including historical perspectives, mathematical formulations, and practical applications in decision-making problems.
Solving Linear Programs: SIMPLEX Method
Explains the SIMPLEX method for solving linear programs and optimizing the solution through basis variable manipulation.
Convex Optimization Problems: Theory and Applications
Explores convex optimization problems, optimality criteria, equivalent problems, and practical applications in transportation and robotics.
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.
Two-phase Simplex Algorithm: Introduction and Duality
Introduces the two-phase simplex algorithm and explores duality in linear programming.