Supply Chain Ch. 5 H.W. and Quiz Questions

In a typical path problem, the supply node flow constraint RHS is equal to:

-1

The net supply for each node in the network is indicated by:

A negative number next to each node.

A transshipment node can have:

Either a net supply or demand, but not both

The objective in most network flow problems is too:

Minimize the total cost, distance , or penalty that must be incurred to solve the problem.

The equipment replacement problem is a type of problem that can be modeled as a(n):

Shortest Path Problem

If you use the simplex method to solve any minimum cost network flow model having integer constraint RHS values, then:

The optimal solution automatically assumes integer values.

The problem, in which we need to determine the shortest (or least costly) route or path through a network from a starting node to an ending node is called:

The path problem.

The arcs in a network indicate:

The valid paths, routes, or connections between the nodes in a network flow problem

In a transshipment problem formulation, the decision variables are if the form:

Xij, which is the number of items shipped (or flowing) from node i to node j

Any shortest path problem can be modeled as a transshipment problem by:

assigning a supply of 1 to the starting node, a demand of 1 to the ending node, and a demand of 0 to all other nodes in the network.

The balance of flow constraints:

define a relationship between inflow and outflow for each node in a network

The objective function in a minimal spanning tree problem is to:

determine the set of arcs that connect all the nodes in a network

The transshipment problem:

is the most general type of network flow problems