Coursera Linear and Discrete Optimization by Friedrich Eisenbrand

1. 01_Week_1/01_Introduction_to_linear_programming_11-33.mp426MB
2. 01_Week_1/02_Proving_optimality_of_a_feasible_solution_6-22.mp415.81MB
3. 01_Week_1/03_Definition_of_linear_programming_14-13.mp432.47MB
4. 01_Week_1/04_Applications-_Solving_systems_of_linear_equations_Line_fitting_and_Classification_18-37.mp447.8MB
5. 01_Week_1/05_Solutions_to_Optional_Assignment_1.mp426.34MB
6. 02_Week_2/01_Definition_of_vertices_12-44.mp427.97MB
7. 02_Week_2/02_Basic_solutions_20-12.mp443.52MB
8. 02_Week_2/03_Optimal_point_in_a_feasible_and_bounded_LP_16-29.mp437.19MB
9. 02_Week_2/04_Vertex_enumeration_algorithm_for_solving_LPs_9-26.mp421.31MB
10. 02_Week_2/05_Fourier-Motzkin_elimination_15-18.mp427.95MB
11. 02_Week_2/06_Programming_Tutorial-_Linear_Algebra_in_SymPy_9-21.mp410.65MB
12. 03_Week_3/01_Adjacency_of_vertices_and_idea_of_Simplex_algorithm_11-11.mp431.74MB
13. 03_Week_3/02_Moving_to_a_neighboring_vertex_26-46.mp475.2MB
14. 03_Week_3/03_Simplex_algorithm_in_basis_notation_17-03.mp447.27MB
15. 03_Week_3/04_Degenerate_case_and_Blands_pivoting_rule_14-17.mp442.76MB
16. 03_Week_3/05_Finding_an_initial_vertex_and_final_Simplex_algorithm_7-48.mp423.77MB
17. 04_Week_4/01_Algorithms_and_running_time_analysis_19-11.mp452.85MB
18. 04_Week_4/02_The_Euclidean_algorithm_6-45.mp414MB
19. 04_Week_4/03_Efficiency_of_a_single_iteration_of_the_simplex_algorithm_19-28.mp456.53MB
20. 04_Week_4/04_Running_time_of_the_simplex_algorithm_8-29.mp424.41MB
21. 04_Week_4/05_Graphs_of_polyhedra_and_their_diameter_20-20.mp460.74MB
22. 04_Week_4/06_Connected_layer_families_13-36.mp442.11MB
23. 04_Week_4/07_The_Kalai-Kleitman_bound_10-39.mp424.45MB
24. 05_Week_5/01_Linear_programming_duality_18-37.mp457.88MB
25. 05_Week_5/02_Farkas_Lemma_20-37.mp463.35MB
26. 05_Week_5/03_Matchings_and_Vertex_Covers_12-11.mp439.22MB
27. 05_Week_5/04_Towards_a_second_proof_of_weak_duality_21-14.mp459.88MB
28. 05_Week_5/05_Strong_duality_in_bipartite_graphs_17-51.mp445.49MB
29. 06_Week_6/01_Representing_graphs_5-39.mp411.67MB
30. 06_Week_6/02_Breadth_first_search_22-28.mp442.56MB
31. 06_Week_6/03_Algorithm_for_matchings_in_bipartite_graphs_17-37.mp433.27MB
32. 06_Week_6/04_The_Bellman-Ford_algorithm_27-13.mp452.66MB
33. 06_Week_6/05_Shortest_paths_and_linear_programming_4-44.mp49.44MB
34. 07_Week_7/01_Matchings_in_bipartite_graphs_9-43.mp419.05MB
35. 07_Week_7/02_Complementary_Slackness_4-29.mp48.22MB
36. 07_Week_7/03_Primal-dual_pairs_for_minimum_weight_bipartite_perfect_matching_10-40.mp420.18MB
37. 07_Week_7/04_Augmenting_the_dual_solution_16-27.mp433.29MB
38. 07_Week_7/05_Primal-dual_algorithm_for_minimum_weight_bipartite_perfect_matching_5-53.mp411.89MB