Def and Proofs Flashcards

1
Q

Convex Combination

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Convex Set

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Convex Function

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Check Convexity + P

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Local optimal solution is also global optimal solution + P

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Polyhedron

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Polytope

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Optimal vertex + P

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Basic Feasible Solution

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Equivalence of verticies and BFS + P

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Reduced Cost Vector

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Optimality test for Simplex method + P

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Bland’s rule + P

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Farkas Lemma + P

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Dual of dual + P

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Strong duality

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Weak duality + P

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Optimality conditions in duality

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

Convex Hull

A
18
Q

Unimodular

A
19
Q

TUM

A
20
Q

Sufficients conditions TUM + P

A
21
Q

Cutting Plane

A
22
Q

Chvatal’s inequalities

A
23
Q

Chvatal’s Closure

A
24
Q

Gomory cuts

A
25
Q

B&B

A
26
Q

B&C

A
27
Q

Incumbent

A
28
Q

Fathoming criteria (Pruning)

A
29
Q

When an edge belongs to MST + P

A
30
Q

Prim-Dijkstra algorithm

A
30
Q

Kruskal’s algorithm

A
31
Q

Dijkstra’s algorithm + P

A
32
Q

Floyd-Warshall’s algorithm correctness + P

A
33
Q

Feasible flow

A
34
Q

Network Cut

A
35
Q

Cut capacity

A
36
Q

Flow through Cut

A
37
Q

Flow through every cut constant + P

A
38
Q

Flow and Capacity + P

A
39
Q

Max-Flow/Min-cut optimal

A
40
Q

Saturated arc

A
41
Q

Residual Network

A
42
Q

Optimal flow for MAX-FLOW problem + P

A