In a transshipment problem, shipments

a$.$ cannot occur between two origin nodes.

b$.$ cannot occur between an origin node and a destination node.

c$.$ cannot occur between a transshipment node and a destination node.

d$.$ can occur between any two nodes.

The assignment problem is a special case of the

a$.$ transportation problem.

b$.$ transshipment problem.

c$.$ maximal flow problem.

d$.$ shortest$-$route problem.

Which of the following is not true regarding an LP model of the typical assignment problem?

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

b$.$ All constraints are of the $$ form.

c$.$ All constraint left$-$hand side coefficient values are $1.$

d$.$ All decision variable values are either $0$ or $1.$

If a basic transportation problem has four origins and five destinations, the LP formulation of the problem will have

regular constraints.

a$.5$

b$.9$

c$.18$

d$.20$

The assignment problem constraint $x_{31}+x_{32}+x_{33}+x_{34}3$ means

a$.$ agent $3$ can be assigned to $3$ tasks.

b$.$ agent $4$ can be assigned to $3$ tasks.

c$.$ a mixture of agents $1,2,3,$ and $4$ will be assigned to tasks.

d$.$ there is no feasible solution.

When the number of agents exceeds the number of tasks in an assignment problem, one or mure lumny tasks must be

introduced in the LP formulation or else the LP will not have a feasible solution.

a$.$ True

b$.$ False

In the basic general linear programming model of the assignment problem,

a$.$ one agent can do parts of several tasks.

b$.$ one task can be done by several agents.

c$.$ each agent is assigned to its own best task.

d$.$ one agent can be assigned to one task.

The difference between the transportation and assignment problems is that

a$.$ total supply must equal total demand in the transportation problem.

b$.$ the number of origins must equal the number of destinations in the transportation problem.

c$.$ each supply and demand value is $1$ in the assignment problem.

d$.$ there are many differences between the transportation and assignment problems.

$21W\frac{W}{?}$ rite the LP formulation for this transportation problem. $(5$ pts$)$