Def and Proofs Flashcards
Convex Combination
Convex Set
Convex Function
Check Convexity + P
Local optimal solution is also global optimal solution + P
Polyhedron
Polytope
Optimal vertex + P
Basic Feasible Solution
Equivalence of verticies and BFS + P
Reduced Cost Vector
Optimality test for Simplex method + P
Bland’s rule + P
Farkas Lemma + P
Dual of dual + P
Strong duality
Weak duality + P
Optimality conditions in duality
Convex Hull
Unimodular
TUM
Sufficients conditions TUM + P
Cutting Plane
Chvatal’s inequalities
Chvatal’s Closure
Gomory cuts
B&B
B&C
Incumbent
Fathoming criteria (Pruning)
When an edge belongs to MST + P
Prim-Dijkstra algorithm
Kruskal’s algorithm
Dijkstra’s algorithm + P
Floyd-Warshall’s algorithm correctness + P
Feasible flow
Network Cut
Cut capacity
Flow through Cut
Flow through every cut constant + P
Flow and Capacity + P
Max-Flow/Min-cut optimal
Saturated arc
Residual Network
Optimal flow for MAX-FLOW problem + P