Simplex Algorithm - Linear Programming - Algorithms Part 15
In this lecture, we discuss one method of solving linear programming problems: the simplex algorithm. In particular, we discuss a generalization of the simplex algorithm known as the two-phase simplex algorithm, which can be used to solve non-canonical tableaus for which the origin is not a basic feasible solution.
This is the last video I have planned for the algorithm series, meaning that this will likely be the end of this lecture series. I hope you all enjoyed it, and I hope you'll stick around for the future lectures I plan to release on other subjects!
Timestamps:
00:00 Introduction
00:25 Motivation
01:09 Simplex Algorithm (for canonical tableaus)
04:37 Two-Phase Simplex Algorithm
07:27 Conclusion
#linearprogramming #linearalgebra #simplexmethod #optimization #linearprogrammingproblem #algorithms #timecomplexity #computerscience #education
On this page of the site you can watch the video online Simplex Algorithm - Linear Programming - Algorithms Part 15 with a duration of hours minute second in good quality, which was uploaded by the user VarPi 16 March 2025, share the link with friends and acquaintances, this video has already been watched 3,249 times on youtube and it was liked by 68 viewers. Enjoy your viewing!
