|
|
|
|
|
Introduction to (modern) Polyhedral Geometry. This lecture defines convex sets and polyhedra and proves a few statements about convex sets and polyhedra.
|
|
Terminology for simplex method is defined in this lecture. This is written is matrix form. Examples are in the following lectures.
|
|
Traveling Salesman problem formulation continued. Discussion of non-negative multipliers, redundant (in)equalities, and their relationship.
|
|
This lecture formulates objective functions for the model in the previous lecture.
|
|
|
|
|
|
Videos and all other materials are copyright 2021 Matthias Köppe and shared as Open Educational Resources subject to the Creative Commons Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0)…
|
|
Videos and all other materials are copyright 2021 Matthias Köppe and shared as Open Educational Resources subject to the Creative Commons Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0)…
|
|
Videos and all other materials are copyright 2021 Matthias Köppe and shared as Open Educational Resources subject to the Creative Commons Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0)…
|
|
|
|
Fourier-Motzkin applied to Farkas lemma and duality
|
|
Fourier-Motzkin applied to Farkas lemma and duality
|
|
|
|
Negative transpose property; the dual of the dual LP is the primal LP. Strong duality theorem (with proof). notes-2020-11-13.pdf Videos and all other materials are copyright 2020 Matthias Köppe…
|