Linear Programming 35: Ellipsoid Method I
Автор: Henry Adams
Загружено: 2020-10-27
Просмотров: 4365
Описание:
Linear Programming 35: Ellipsoid Method I
Abstract: We do the setup required to explain the ellipsoid method. The ellipsoid method proves that linear programs can be solved in polynomial time, but in practice the algorithm is typically not competitive with the simplex method.
This video accompanies the class "Linear Programming and Network Flows" at Colorado State University
https://www.math.colostate.edu/~adams...
We are following the book "Understanding and Using Linear Programming" by Jirí Matoušek and Bernd Gärtner
https://link.springer.com/book/10.100...
Our course notes are available at
https://www.math.colostate.edu/~adams...
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке: