D2 Definitions to learn

Transportation
Unbalanced - supply is not equal to demand
Degenerate occupied cells is not equal to number of rows + number of columns - 1

Travelling Salesman
Walk finite sequence of edges such that the end vertex of one edge is the start vertex of the next.
Tour Walk which visits every vertex, returning to the starting vertex.
Classical problem Visit each vertex ONLY once before returning to the starting vertex.
Practical problem Visit each point AT LEAST once before returning to the starting vertex.

Linear Programming
Slack variables spare capacity in a constraint

Game Theory
Zero sum gain the sum of the total gain for both players is zero.
Saddle point In a game which has a stable solution the saddle point is the location of where row maximin =
column minimax
Domination if every value of a row (or column) is a better option than the corresponding row (or column) then the
better option dominates. The dominated row (or column can be deleted from the game).

Flows
Capacitated directed networks each arc has a weight which represents the capacity of that arc in a given
direction.
Feasibility condition the flow along an arc must not exceed the capacity of the arc.
Conservation condition the total flow into a vertex = total flow out of a vertex.
Cut a set of arcs whose removal splits the network into two parts one containing the source, the other the sink.
Minimum cut A cut consisting of saturated arcs into the cut and empty arcs out of the cut.

Dynamic Programming
Bellmans principle of optimality any part of an optimal path is itself optimal.
Minimax Longest stage is as short as possible
(Over a 4 year period a company wishes to minimise their greatest costs in a year).
Maximin Shortest stage is as long as possible
(Over a 4 year period a company wishes to maximise their smallest profit in a year).
YOU MAY BE ASKED FOR ANY OF THE D1 DEFINITIONS, THE MATCHING ONES WOULD BE INCREDIBLY
UNLIKELY BUT TREE ETC COULD BE ASKED