Transportation & Assignment Problems Quiz

The transportation problem deals with:

• Assignment of tasks to workers

• Allocating resources in a network

• Distributing goods from multiple sources to multiple destinations at minimal cost

• Sequencing of jobs

The transportation problem is a special case of:

• Linear Programming Problem (LPP)

• Non-linear Programming Problem

• Quadratic Programming

• Integer Programming

Which method is used to find an initial feasible solution in a transportation problem?

• Simplex Method

• Vogel's Approximation Method (VAM)

• Stepping Stone Method

• Hungarian Method

The total supply in a balanced transportation problem is:

• Less than demand

• More than demand

• Equal to demand

• Always infinite

If supply and demand are not equal in a transportation problem, it is called:

• Balanced transportation problem

• Unbalanced transportation problem

• Degenerate transportation problem

• Redundant transportation problem

Which method is commonly used to check the optimality of a transportation solution?

• North-West Corner Method

• Stepping Stone Method

• Vogel's Approximation Method

• Hungarian Method

Which method gives the lowest cost initial feasible solution in most cases?

• North-West Corner Rule

• Least Cost Method

• Vogel's Approximation Method

• Stepping Stone Method

A degenerate transportation problem occurs when:

• All constraints are satisfied

• The number of occupied cells is less than (m + n - 1)

• Supply is greater than demand

• Demand is greater than supply

In transportation problems, dummy sources or destinations are added to:

• Avoid degeneracy

• Balance the problem

• Increase total cost

• Optimize supply only

Which of the following methods does NOT provide an optimal solution to a transportation problem?

• Stepping Stone Method

• Modified Distribution Method (MODI)

• North-West Corner Rule

• Vogel's Approximation Method