In the LCM, what is done if the minimum cost is not unique?

• A) Increase the cost arbitrarily
• B) Choose the next least cost
• C) Break the tie arbitrarily
• D) Repeat the process with a new table

A balanced transportation model with ‘5’number of sources and ‘7’ destinations has -------- number of constraint equations.

• A) 12
• B) 10
• C) 2
• D) 35

If a variable in the Primal is unrestricted in sign, then the corresponding constraint in the dual will be of -------- type and vice versa.

• A) =
• B) <=
• C) >=
• D) none of these

Due to which of the following reason, Simplex method is not preferred to solve a Transportation problem?

• A) Since Transportation problem does not contain positive slacks
• B) Since it contains large number of decision variables ‘xij’s’ so that it becomes complicated
• C) Since Transportation problem contains constraints of ‘=’ type
• D) Since Transportation problem does not contain negative slacks

In North West Corner method, the first step after choosing the appropriate cell in 1st row, we allocate -------------so that the capacity of first row or first column is exhausted.

• A) any arbitrary quantity
• B) as much as possible
• C) non- negative quantity
• D) as least as possible

The number of variables in the Primal will be the number of -------- in Dual and vice versa.

• A) constraints
• B) slacks
• C) variables also
• D) artificial variables

The Transportation and Transshipment Models are types of ---------------- models.

• A) Variation
• B) Allocation
• C) Inventory
• D) Network

What is Vogel's Approximation Method (VAM) based on?

• A) Greedy strategy
• B) Calculating penalties for wrong allocations
• C) Considering only the maximum feasible amount
• D) Random allocation of resources

The objective of a transportation problem is to develop an ----------- transportation schedule that meets all demand from given stock at a ------- total shipping cost.

• A) (integral, minimum)
• B) (fractional, maximum)
• C) (fractional, minimum)
• D) (integral, maximum)

In the Vogel’s approximation Method for solving a Transportation problem, Penalty measure for any row or column, is given by which of the following?

• A) Difference between the smallest unit cost to the next smallest cost in the same row(column)
• B) Difference between the largest unit cost to the next largest cost in the same row(column)
• C) Difference between the Largest unit cost to the smallest unit cost in the came row(column)
• D) Difference between any two arbitrary costs in the came row(column)

In North West Corner method, in the first row and first column, available resource and sink contain ‘5’ and ‘7’ units respectively; then which of the following amount ‘x11’ will be allocated in the cell (1,1)?

• A) Average(5,7) = 6
• B) Min(5,7-5) = 2
• C) Min(5,7) = 5
• D) Max(5,7) = 7

If an LP problem contains large number of constraints and a smaller number of variables then which of the following will reduce the computational burden in finding its solution?

• A) Duality principle
• B) Two phase method
• C) Graphical method
• D) M-method

Under which of the following condition in the North West Corner Method, after first allocation in cell (1,1), next allocation along the diagonal in cell (2,2) can be made?

• A) If in the first row and first column, each resource and sink contain equal units
• B) Total Supply = Total Demand
• C) No such condition exist
• D) If Total Supply is not equal to Total Demand

The amounts shipped from a dummy source represent shortages at the receiving destinations

• A) False
• B) True
• C)
• D)

Primal of a dual is-----.

• A) Primal
• B) Prime primal
• C) Dual
• D) Prime dual

Primal of a Primal is-------.

• A) Prima primal
• B) dual primal
• C) Primal
• D) Dual

What is the significance of selecting the row or column with the largest penalty in VAM?

• A) It prioritizes the allocation to minimize penalties
• B) It denotes the final allocation step
• C) It represents the maximum supply or demand
• D) It indicates the highest transportation cost

The Transportation Problem is one of the sub-class of -------------.

• A) Network Flow Problem
• B) Linear Programming Problem
• C) Stochastic Problem
• D) Inventory Control Problem

In a Transportation problem, which of the following are taken as the coefficients of unknown “$x_{ij}$'s” ?

• A) Ones
• B) Any arbitrary non-negative integer
• C) Zeros
• D) Zeros or ones

Dual of a Dual of Dual is------.

• A) Primal
• B) Single dual
• C) Dual
• D) Double dual