Index Index
algorithm, Dijkstra’s shortest path, Definition
algorithm, Ford-Fulkerson, Definition
algorithm, Hungarian, Definition
algorithm, min cut, Definition
algorithm, minimum cost flow, Definition
algorithm, shortest path, Definition
algorithm, simplex: maximum, Definition
algorithm, simplex: maximum basic feasible, Definition
algorithm, simplex: minimum, Definition
algorithm, transportation, Definition
algorithm, VAM, Definition
anticycling, Theorem
assignment problem, Definition
balanced transportation problem, Definition
ball, Definition
basic solution, Definition
basic variable, Definition
Bland’s anticycling rules, Theorem
bounded, Definition
canonical, Note
capacitated network, Definition
complementary slackness, Definition
complementary slackness theorem, Exercise
cone, Definition
conservation of flow, Theorem
convex, Definition
convex, polyhedral, Definition
corner point, Definition
cover, covering, Activity
cut, Definition
cycle, Definition
cycle, negative, Definition
cycling, Definition
decision variable, Activity Definition
degenerate, Definition
Dijkstra’s shortest path algorithm, Definition
directed graph, Definition
distance, Definition
domination, Definition
dual problem, Definition
dual variable, Definition
duality, Chapter
feasible solution, Definition
flow, Definition
flow, net input, Definition
Ford-Fulkerson algorithm, Definition
Hungarian algorithm, Definition
hyperplane seperation theorem, Theorem
independent variable, Definition
intermediary vertex, Definition
König’s theorem, Theorem
length, Definition
line segment, Definition
linear optimization problem, canonical maximization, Definition
linear optimization problem, canonical minimization, Definition
linear optimization problem, dual minimization, Definition
linear optimization problem, noncanonical, Chapter
matching, Exploration
max flow-min cut theorem, Theorem
maximum flow problem, Subsection
min cut algorithm, Definition
minimum cost flow algorithm, Definition
negative cycle, Definition
negative transpose, Definition
net input flow, Definition
network, Definition
network, capacitated, Definition
network, weighted, Definition
noncanonical, Chapter
norm, Definition
objective function, Definition
optimal solution, Definition
saddle point, Definition
scheduling, Section
shortest path algorithm, Definition
simplex algorithm: maximum, Definition
Simplex Algorithm: maximum basic feasible, Definition
Simplex Algorithm: minimum, Definition
sink, Definition
slack variable, Activity Definition
solution, basic, Definition
solution, feasible, Definition
solution, optimal, Definition
source, Definition
strong duality theorem, Theorem
sudoku, Section
tableau, transportation, Activity
tableau, Tucker, Definition
theorem, Bland’s anticycling, Theorem
theorem, complementary slackness, Exercise
theorem, conservation of flow, Theorem
theorem, hyperplane seperation, Theorem
theorem, König’s, Theorem
theorem, max flow-min cut, Theorem
theorem, strong duality, Theorem
theorem, VonNeumann minimax, Section
theorem, weak duality, Proposition
transportation algorithm, Definition
transportation problem, Section
transportation problem, balanced, Definition
transportation problem, unbalanced, Activity
transportation tableau, Activity
Tucker tableau, Definition
VAM, Definition
variable, basic, Definition
variable, decision, Activity Definition
variable, dual, Definition
variable, independent, Definition
variable, slack, Activity Definition
variable, unconstrained, Section
vertex cover, vertex covering, Activity
Vogel advanced-start method, Definition
VonNeumann minimax theorem, Section
weak duality theorem, Proposition
weighted network, Definition
zero-sum games, Chapter
