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
Two-phase Simplex Algorithm: Introduction and Duality
Graph Chatbot
Related lectures (48)
Simplex Algorithm: Exercises & Interpretation
Log in to Mediaspace to watch this video
Covers exercises on the Simplex Algorithm, optimizing solutions subject to linear constraints.
Certificates: Existence and Proving
Log in to Mediaspace to watch this video
Explores certificates, proving solution existence, constraints, and linear programming duality.
Dual Translations in Linear Programming
Log in to Mediaspace to watch this video
Explores dual translations in linear programming, emphasizing primal and dual formulations and the significance of invertible submatrices.
Semi-Definite Programming
Log in to Mediaspace to watch this video
Covers semi-definite programming and optimization over positive semidefinite cones.
Branch & Bound: Optimization
Log in to Mediaspace to watch this video
Covers the Branch & Bound algorithm for efficient exploration of feasible solutions and discusses LP relaxation, portfolio optimization, Nonlinear Programming, and various optimization problems.
Linear Programming: Optimization and Constraints
Log in to Mediaspace to watch this video
Explores linear programming optimization with constraints, Dijkstra's algorithm, and LP formulations for finding feasible solutions.
Duality: Economic Interpretation
Log in to Mediaspace to watch this video
Explores duality in linear programming, strong duality, complementary slackness, and the economic interpretation of dual variables as prices.
Linear Optimization: Fundamentals
Log in to Mediaspace to watch this video
Covers the basics of linear optimization, including equations, polyhedrons, feasible directions, and optimal solutions.
Dynamic Programming: Steinitz Sequence
Log in to Mediaspace to watch this video
Explores dynamic programming with the Steinitz sequence to optimize solutions efficiently.
Linear Programming: Solving LPs
Log in to Mediaspace to watch this video
Covers the process of solving Linear Programs (LPs) using the simplex method.
Optimization Principles
Log in to Mediaspace to watch this video
Covers optimization principles, including linear optimization, networks, and concrete research examples in transportation.
Linear Programming Basics
Log in to Mediaspace to watch this video
Covers deriving basic linear program representation, finding solutions, and exploring optimality.
Lagrangian Duality: Convex Optimization
Log in to Mediaspace to watch this video
Explores Lagrangian duality in convex optimization, transforming problems into min-max formulations and discussing the significance of dual solutions.
Equality and Inequality Constraints: Optimization Conditions
Log in to Mediaspace to watch this video
Covers necessary optimality conditions for optimization with constraints and discusses cones and polar sets.
Duality Theorems
Log in to Mediaspace to watch this video
Explores duality theorems in linear programming, emphasizing optimal solutions and degeneracies.
Simplex Method: Phase 2
Log in to Mediaspace to watch this video
Delves into the second phase of the simplex method, emphasizing matrix operations for solving optimization problems with constraints.
Convex Polyhedra and Linear Programs
Log in to Mediaspace to watch this video
Explores convex polyhedra, linear programs, and their optimization importance.
ALM with Inequalities: Next Steps in Optimization
Log in to Mediaspace to watch this video
Explores the Augmented Lagrangian Method with equality and inequality constraints in optimization, emphasizing the importance of slack variables.
Optimization Programs: Piecewise Linear Cost Functions
Log in to Mediaspace to watch this video
Covers the formulation of optimization programs for minimizing piecewise linear cost functions.
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.
Previous
Page 2 of 3
Next