Agec 3413 Exam 3 Study Guide 100% Pass

AGEC 3413 EXAM 3 STUDY GUIDE 100% PASS


In a transportation problem, items are allocated from sources to destinations at a
minimum cost. - ANSWER TRUE

In a transportation problem, items are allocated from sources to destinations at a
maximum value. - ANSWER FALSE

The linear programming model for a transportation problem has constraints for supply
at each source and demand at each destination. - ANSWER TRUE

In a balanced transportation model where supply equals demand, all constraints are
equalities. - ANSWER TRUE

In an unbalanced transportation model, all constraints are equalities. - ANSWER FALSE

For most real-world applications, an unbalanced transportation model is a more likely
occurrence than a balanced transportation model. - ANSWER TRUE

In order to model a "prohibited route" in a transportation or transshipment problem, the
route should be omitted from the linear program. - ANSWER FALSE

A prohibited route in a transportation model should be assigned a value of zero. -
ANSWER FALSE

A prohibited route in a transportation model should be assigned an arbitrarily high-cost
coefficient. - ANSWER TRUE

In an unbalanced transportation problem, if demand exceeds supply, the optimal
solution will be infeasible. - ANSWER FALSE

The transshipment model includes intermediate points between the sources and
destinations. - ANSWER TRUE

In a transshipment problem, items may be transported from sources through
transshipment points on to destinations. - ANSWER TRUE

In a transshipment problem, items may be transported from one source to another. -
ANSWER TRUE

In a transshipment problem, items may be transported from one transshipment point to
another. - ANSWER TRUE

In a transshipment problem, items may be transported from one destination to another. -
ANSWER TRUE

In a transshipment problem, items may be transported directly from sources to
destinations. - ANSWER TRUE

,In a transshipment problem, items may be transported from destination to destination
and from source to source. - ANSWER TRUE

An assignment problem is a special form of transportation problem where all supply and
demand values equal 1. - ANSWER TRUE

Assignment linear programs always result in integer solutions. - ANSWER TRUE

Networks may be used to represent assignment problems. - ANSWER TRUE

In a transshipment model, the supply at each source and demand at each destination is
limited to one unit. - ANSWER FALSE

In a(n) ________ problem, items are allocated from sources to destinations at a minimum
cost. - ANSWER transportation

In a(n) ________ transportation model where supply equals demand, all constraints are
equalities. - ANSWER balanced

In an unbalanced transportation problem, if supply exceeds demand, the shadow price
for at least one of the supply constraints will be equal to ________. - ANSWER zero

In order to model a "prohibited route" in a transportation or transshipment problem, the
cost assigned to the route should be________. - ANSWER high

The ________ model is an extension of the transportation model in which intermediate
points are added between the sources and destinations. - ANSWER transshipment

An example of a(n) ________ point is a distribution center or warehouse located between
plants and stores. - ANSWER transshipment

An appropriate choice of a model for analyzing the best shipping routes for a supply
chain consisting of a manufacturer, warehouse, and retailer would be the ________
model. - ANSWER transshipment

A form of the transportation problem in which all supply and demand values equal 1 is
the ________ problem. - ANSWER assignment

A plant has four jobs to be assigned to four machines, and each machine has different
manufacturing times for each product. The production manager wants to determine the
optimal assignments of four jobs to four machines to minimize total manufacturing time.
This problem can be most efficiently solved using the ________ model. - ANSWER
assignment

In a linear programming formulation of a transportation model, each of the possible
combinations of supply and demand locations is a(n) ________. - ANSWER decision
variable

, The cost to send a unit of product from supply source A to demand location B would be
represented in the ________ of the linear programming statements. - ANSWER objective
function



In most real-world cases, the supply capacity and demanded amounts result in a(n)
________ transportation model. - ANSWER unbalanced



In order to prevent the accumulation of inventory at transshipment points, they should
be modeled as being ________ nodes. - ANSWER balanced



If the number of sources is greater than the number of destinations, then we have a(n)
________ assignment problem. - ANSWER unbalanced



In an assignment problem, all demand and supply values are equal to ________. -
ANSWER one



In a balanced transportation model where supply equals demand:



A) all constraints are equalities.

B) none of the constraints are equalities.

C) all constraints are inequalities.

D) none of the constraints are inequalities. - ANSWER A



In a transportation problem, items are allocated from sources to destinations:



A) at a maximum cost.

B) at a minimum cost.

C) at a minimum profit.

D) at a minimum revenue. - ANSWER B