1.) The maximum amount of flow that can enter 7.

) An origin added to a transportation problem to

and exit a network system during a given period of make the total supply equal to the total demand.
time. The supply assigned to the dummy origin is the
difference between the total demand and the total
A. Maximal Flow supply.
B. Maximin Strategy A. Dummy Origin
C. Mixed Strategy B. Network
D. Expected Value C. Saddle point
D. Expected Value
2.) The intersection or junction points of a network.
8.) A network flow problem that often involves
A. Sunk Cost minimizing the cost of shipping goods from a
B. Relevant Cost set of origins to a set of destinations.
C. Nodes
D. Game Theory A. Transportation problem
B. Reduced Cost
3.) The change in the value of the objective C. Flow capacity
function per unit increase in the right-hand side of D. Assignment Problem
a constraint.
9.) When one of the available strategies is optimal
A. Game Theory and the player always selects this strategy
B. Dual Value regardless of the strategy selected by the other
C. Transshipment problem player.
D. Expected Value
A. Maximin Strategy
4.) The study of how changes in the coefficients of B. Mixed Strategy
a linear programming problem affect the C. Pure Strategy
optimal solution. D. Shortest Route

A. Reduced Cost 10.) The set of all interconnected resources

B. Pure Strategy involved in producing and distributing a product.
C. Sensitivity Analysis
D. Sunk Cost A. Supply Chain
B. Efficiency Index
5.) A strategy where the player seeking to C. Network
maximize the value of the game selects the D. Shortest Route
strategy that minimizes the maximum payoff
obtainable by the other player. 11.) A game with two players in which the gain to
one player is equal to the loss to the other player.
A. Game Theory
B. Efficiency Index A. Range of feasibility
C. Mixed Strategy B. Two-person, zero-sum game
D. Minimax Strategy C. Game Theory
D. Range of Optimality
6.) The line connecting the node in a network.
12.) Shortest path between two nodes in a
A. Reduced Cost network.
B. Efficiency Index
C. Pure Strategy A. Range of feasibility
D. Arcs B. Range of Optimality
C. Game Theory
D. Shortest Route
13.) A decision-making situation in which two or
more decision makers compete by each selecting
one of several strategies. The combination of the
competing strategies provides the value of the
game to the players.

A. Two-person, zero-sum game

B. Game Theory
C. Transshipment problem
D. Shortest Route

14.) The range of values over which the dual value

is applicable.

A. Range of Optimality
B. Range of feasibility
C. Two-person, zero-sum game
D. Shortest Route

15.) The range of values over which and objective

function coefficient may vary without causing
any change in the values of the decision variables
in the optimal solution.

A. Efficiency Index
B. Network
C. Range of Optimality
D. Range of feasibility