Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Lecture
Local Sensitivity Analysis: Feasibility and Optimality
Graph Chatbot
Related lectures (32)
Linear Programming: Weighted Bipartite Matching
Covers linear programming, weighted bipartite matching, and vertex cover problems in optimization.
Hedging for LPs
Covers the concept of hedging for Linear Programs and the simplex method, focusing on minimizing costs and finding optimal solutions.
Optimization Methods: Theory Discussion
Explores optimization methods, including unconstrained problems, linear programming, and heuristic approaches.
Optimisation with Constraints: Interior Point Algorithm
Explores optimization with constraints using KKT conditions and interior point algorithm on two examples of quadratic programming.
Energy System Modeling: Optimization and Performance Indicators
Explores energy system modeling using optimization techniques and performance indicators.
Simplex Algorithm: Tableau
MOOC: Optimization: principles and algorithms - Linear optimization
Covers the main idea behind the Simplex algorithm and explains the Tableau method for solving linear programming problems.
Unweighted Bipartite Matching
Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.
Optimisation Problem: Solving by FM
Covers the modelling and optimization of energy systems, focusing on solving optimization problems with constraints and variables.
Linear Programming Duality
Explores linear programming duality, covering constraints, variables, solutions, and the relationship between primal and dual LP.
Optimal Decision Making: Sensitivity Analysis
Log in to Mediaspace to watch this video
Covers sensitivity analysis in linear programming, focusing on optimal solutions and their sensitivities to changes.
Optimization Problems: Path Finding and Portfolio Allocation
Log in to Mediaspace to watch this video
Covers optimization problems in path finding and portfolio allocation.
Linear Programming Basics
Log in to Mediaspace to watch this video
Introduces linear programming basics, including optimization problems, cost functions, simplex algorithm, geometry of linear programs, extreme points, and degeneracy.
Simplex Algorithm: Exercises & Interpretation
Log in to Mediaspace to watch this video
Covers exercises on the Simplex Algorithm, optimizing solutions subject to linear constraints.
Linear Programming: Extreme Points
Log in to Mediaspace to watch this video
Explores extreme points in linear programming and the role of constraints in finding optimal solutions.
Linear Programming: Two-phase Simplex Algorithm
Log in to Mediaspace to watch this video
Covers the application of the two-phase Simplex algorithm to solve linear programming problems.
Cutset Formulation: MST Problem
Log in to Mediaspace to watch this video
Explores the cutset formulation for the MST Problem and Gomory Cutting Planes method.
Optimal Decision Making: Integer Programming
Log in to Mediaspace to watch this video
Covers integer programming, convex hulls, Gomory cutting planes, and branch and bound methods.
Two-phase Simplex Algorithm: Introduction and Duality
Log in to Mediaspace to watch this video
Introduces the two-phase simplex algorithm and explores duality in linear programming.
Relations Between Events
Log in to Mediaspace to watch this video
Explores relations between events, disjunctive constraints, and modeling with binary variables in optimization problems.
Linear Programming: Solving LPs
Log in to Mediaspace to watch this video
Covers the process of solving Linear Programs (LPs) using the simplex method.
Previous
Page 1 of 2
Next