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
Convex Polyhedra and Linear Programs
Graph Chatbot
Related lectures (30)
Previous
Page 2 of 3
Next
Solving Linear Programs: SIMPLEX Method
Explains the SIMPLEX method for solving linear programs and optimizing the solution through basis variable manipulation.
Dijkstra's Algorithm: All-Pairs
Covers Dijkstra's algorithm and its application to the all-pairs shortest path problem.
Optimization Algorithms
Covers optimization algorithms, convergence properties, and time complexity of sequences and functions.
Simplex Algorithm: Basics
Introduces the Simplex algorithm for solving flow problems and handling negative cost cycles.
KKT and Convex Optimization
Covers the KKT conditions and convex optimization, discussing constraint qualifications and tangent cones of convex sets.
Simplex Algorithm: Tableau
Covers the main idea behind the Simplex algorithm and explains the Tableau method for solving linear programming problems.
Convex Optimization: Introduction and Sets
Covers the fundamentals of convex optimization, including mathematical problems, minimizers, and solution concepts, with an emphasis on efficient methods and practical applications.
Optimization: Classical Problems
Covers classical optimization problems, brute force algorithms, and integer linear optimization.
Convex Optimization Problems: Theory and Applications
Explores convex optimization problems, optimality criteria, equivalent problems, and practical applications in transportation and robotics.
Optimization Methods: Theory Discussion
Explores optimization methods, including unconstrained problems, linear programming, and heuristic approaches.
