Definitions Flashcards

1
Q

What is meant by an unbalanced transportation problem?

A

Means that the supply is not equal to the demand.

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

What is meant by a degenerate solution to a transportation problem?

A

Means that the number of occupied cells is not equal to the number of rows + number of columns -1.

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

What is a walk?

A

A finite sequence of edges such that the end vertex of one edge is the start vertex of the next.

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

What is a tour?

A

A walk which visits every vertex, returning to the starting vertex.

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

Describe the classical travelling salesman problem.

A

This is where you visit each vertex only once before returning to the starting vertex.

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

Describe the practical travelling salesman problem.

A

This is where you visit each point at least once before returning to the starting vertex.

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

What is a slack variable?

A

A slack variable represents the spare capacity in a constraint.

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

What is meant by a zero sum game?

A

The sum of the total gain for both players is 0.

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

What is meant by the saddle point in a game?

A

In a game which has a stable solution, the saddle point is the location of where the row maximin = the column minimax.

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

Describe what is meant by domination in a zero sum game?

A

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.

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

What is meant by a capacitated, directed network?

A

A network in which each arc has a weight which represents the capacity of that arc in a given direction.

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

What is the feasibility condition in a flow network?

A

The condition is that the flow along an arc must not exceed the capacity of the arc.

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

What is the conservation condition in a flow network?

A

The condition is that the total flow into a vertex = total flow out of a vertex.

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

What is meant by a cut?

A

This is a set of arcs whose removal splits the network into two parts one containing the source, the other the sink.

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

Describe what is meant by a minimum cut?

A

A cut consisting of saturated arcs into the cut and empty arcs out of the cut.

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

State Bellman’s principle of optimality.

A

Any part of an optimal path is itself optimal.

17
Q

What is meant by a minimax route?

A

A route in which the longest stage is as short as possible (i.e. minimising a company’s greatest costs).

18
Q

What is meant by a maximin route?

A

A route in which the shortest stage is as long as possible (i.e. maximising a company’s smallest profit).