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 Relaxation in Optimization
Graph Chatbot
Related lectures (31)
Previous
Page 2 of 4
Next
Primal-dual Optimization III: Lagrangian Gradient Methods
Explores primal-dual optimization methods, emphasizing Lagrangian gradient techniques and their applications in data optimization.
Introduction to Optimization and Operations Research
Covers fundamental concepts of optimization and operations research, exploring real-world examples and key topics over a semester.
Optimization Problems: Path Finding and Portfolio Allocation
Covers optimization problems in path finding and portfolio allocation.
Duality: Duality in Linear Optimization
Covers the concept of linear optimization and the duality relationship between primal and dual problems.
Optimisation Problem: Solving by FM
Covers the modelling and optimization of energy systems, focusing on solving optimization problems with constraints and variables.
Optimal Decision Making: Sensitivity Analysis
Covers sensitivity analysis in linear programming, focusing on optimal solutions and their sensitivities to changes.
Simplex Algorithm: Basics
Introduces the Simplex algorithm for solving flow problems and handling negative cost cycles.
Linear Programming Duality
Explores the concept of duality in linear programming and its practical implications in optimization.
Dynamic Programming: Steinitz Sequence
Explores dynamic programming with the Steinitz sequence to optimize solutions efficiently.
Branch & Bound: Optimization
Covers the Branch & Bound algorithm for efficient exploration of feasible solutions and discusses LP relaxation, portfolio optimization, Nonlinear Programming, and various optimization problems.
