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)
Optimal Decision Making: Sensitivity Analysis
Covers sensitivity analysis in linear programming, focusing on optimal solutions and their sensitivities to changes.
Linear Programming: Weighted Bipartite Matching
Covers linear programming, weighted bipartite matching, and vertex cover problems in optimization.
Optimization Problems: Path Finding and Portfolio Allocation
Covers optimization problems in path finding and portfolio allocation.
Hedging for LPs
Covers the concept of hedging for Linear Programs and the simplex method, focusing on minimizing costs and finding optimal solutions.
Linear Programming Basics
Introduces linear programming basics, including optimization problems, cost functions, simplex algorithm, geometry of linear programs, extreme points, and degeneracy.
Simplex Algorithm: Exercises & Interpretation
Covers exercises on the Simplex Algorithm, optimizing solutions subject to linear constraints.
Linear Programming: Extreme Points
Explores extreme points in linear programming and the role of constraints in finding optimal solutions.
Linear Programming: Two-phase Simplex Algorithm
Covers the application of the two-phase Simplex algorithm to solve linear programming problems.
Cutset Formulation: MST Problem
Explores the cutset formulation for the MST Problem and Gomory Cutting Planes method.
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.
Optimal Decision Making: Integer Programming
Covers integer programming, convex hulls, Gomory cutting planes, and branch and bound methods.
Two-phase Simplex Algorithm: Introduction and Duality
Introduces the two-phase simplex algorithm and explores duality in linear programming.
Relations Between Events
Explores relations between events, disjunctive constraints, and modeling with binary variables in optimization problems.
Linear Programming: Solving LPs
Covers the process of solving Linear Programs (LPs) using the simplex method.
Energy System Modeling: Optimization and Performance Indicators
Explores energy system modeling using optimization techniques and performance indicators.
Linear Optimization: Auxiliary Problem
Explores the formulation of the auxiliary problem in linear optimization and its role in optimal decision-making.
Linear Programming: Optimization and Duality
Introduces linear programming, optimization, and duality concepts with a focus on the simplex method and practical examples.
Simplex Algorithm: Tableau
Covers the main idea behind the Simplex algorithm and explains the Tableau method for solving linear programming problems.
Solving Linear Programs: SIMPLEX Method
Explains the SIMPLEX method for solving linear programs and optimizing the solution through basis variable manipulation.
Previous
Page 1 of 2
Next