Multiple choices $(2$ pts each$)$:

The problem which deals with the distribution of goods from several sources to several destinations is the

a$.$ maximal flow problem

b$.$ transportation problem

c$.$ assignment problem

d$.$ shortest$-$route problem

The objective of the transportation problem is to

a$.$ identify one origin that can satisfy total demand at the destinations and at the same time minimize total

shipping cost.

b$.$ minimize the number of origins used to satisfy total demand at the destinations.

c$.$ minimize the number of shipments necessary to satisfy total demand at the destinations.

d$.$ minimize the cost of shipping products from several origins to several destinations.

Converting a transportation problem LP from cost minimization to profit maximization requires only changing the objective

function; the conversion does not affect the constraints.

a$.$ True

b$.$ False

The number of units shipped from origin i to destination $j$ is represented by

a$.x_{ij}.$

b$.x_{ji}.$

c$.c_{ij}.$

d$.c_{ji}.$

Which of the following is not true regarding the linear programming formulation of a transportation problem?

a$.$ Costs appear only in the objective function.

b$.$ The number of variables is $($number of origins$)($number of destinations$).$

c$.$ The number of constraints is $($number of origins$)($number of destinations$).$

d$.$ The constraints' iftt$-$hand side coefficients are either $0$ or $1.$

In LP transportation models, decision variables represent shipping cost.

a$.$ True

b$.$ False

In a typical LP transportation model, the objective function value represents total shipping cost.

a$.$ True

b$.$ False

When a route in a transportation problem is unacceptable, the corresponding variable can be removed from the LP

formulation.

a$.$ True

b$.$ False

In LP transportation problems, number of origins and number of destinations are not always equal..

a$.$ True

b$.$ False

In LP transportation models, some decision variables can be negative.

a$.$ True

b$.$ False

A basic transportation problem with three sources and four destinations will have

decision variables.

a$.3$

b$.4$

c$.7$

d$.12$

A transshipment problem is a generalization of the transportation problem in which certain nodes are neither supply node

nor destination nodes..

a$.$ True

b$.$ False

Page $1$ of $3$