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
Local Sensitivity Analysis: Feasibility and Optimality
Graph Chatbot
Related lectures (32)
Previous
Page 3 of 4
Next
Unweighted Bipartite Matching
Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.
Simplex Algorithm: Basics
Introduces the Simplex algorithm for solving flow problems and handling negative cost cycles.
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.
Introduction to Optimization
Covers the basics of optimization, including historical perspectives, mathematical formulations, and practical applications in decision-making problems.
Optimisation Problem: Solving by FM
Covers the modelling and optimization of energy systems, focusing on solving optimization problems with constraints and variables.
Network Flows and LP Formulations
Explains network flows, LP formulations, simplex method, duality, and practical applications.
Linear Programming Basics
Covers the basics of linear programming and the simplex method, focusing on finding optimal solutions and handling degeneracy.
Integer Programs: Optimization and Constraints
Explores integer programs, nonconvex optimization, constraints, and geometric aspects of linear programming for optimal solutions.
Linear Programming Duality
Explores linear programming duality, covering constraints, variables, solutions, and the relationship between primal and dual LP.
Linear Programming Exercise
Covers exercises related to linear programming, focusing on solving optimization problems.