The transportation problem is said to be unbalanced if _______.

(a)

Total supply ≠ Total demand

(b)

Total supply = Total demand

(c)

m = n

(d)

m+n–1

In a non – degenerate solution number of allocations is _______.

(a)

Equal to m+n–1

(b)

Equal to m+n+1

(c)

Not equal to m+n–1

(d)

Not equal to m+n+1

The Penalty in VAM represents difference between the first ________.

(a)

Two largest costs

(b)

Largest and Smallest costs

(c)

Smallest two costs

(d)

None of these

Number of basic allocation in any row or column in an assignment problem can be _______.

(a)

Exactly one

(b)

at least one

(c)

at most one

(d)

none of these

North-West Corner refers to ________.

(a)

top left corner

(b)

top right corner

(c)

bottom right corner

(d)

bottom left corner

Solution for transportation problem using ________method is nearer to an optimal solution.

(a)

NWCM

(b)

LCM

(c)

VAM

(d)

Row Minima

If number of sources is not equal to number of destinations, the assignment problem is called______.

(a)

balanced

(b)

unsymmetric

(c)

symmetric

(d)

unbalanced

The purpose of a dummy row or column in an assignment problem is to _______.

(a)

prevent a solution from becoming degenerate

(b)

balance between total activities and total resources

(c)

provide a means of representing a dummy problem

(d)

none of the above

In an assignment problem involving four workers and three jobs, total number of assignments possible are _______.

(a)

4

(b)

3

(c)

7

(d)

12

A type of decision –making environment is _______.

(a)

certainty

(b)

uncertainty

(c)

risk

(d)

all of the above

What is transportation problem?

What is feasible solution and non degenerate solution in transportation problem?

What do you mean by balanced transportation problem?

Determine an initial basic feasible solution of the following transportation problem by north west corner method

Determine basic feasible solution to the following transportation problem using North west Corner rule.

What is the Assignment problem?

What is the difference between Assignment Problem and Transportation Problem?

Find the optimal solution for the assignment problem with the following cost matrix.

Following pay-off matrix, which is the optimal decision under each of the following rule
(i) maxmin
(ii) minimax

Act	States of nature
	S1	S2	S3	S4
A1	14	9	10	5
A2	11	10	8	7
A3	9	10	10	11
A4	8	10	11	13

Determine an initial basic feasible solution to the following transportation problem using North West corner rule.

Here O_i and D_j represent i^th origin and j^th destination.

Determine how much quantity should be stepped from factory to various destinations for the following transportation problem using the least cost method

Cost are expressed in terms of rupees per unit shipped.

Consider the following pay-off (profit) matrix Action States

Action	States
	(s1)	(s2)	(s3)	(s4)
A1	5	10	18	25
A2	8	7	8	23
A3	21	18	12	21
A4	30	22	19	15

Determine best action using maximin principle.

Consider the following pay-off matrix

Alternative	Pay – offs (Conditional events)
	A1	A2	A3	A4
E1	7	12	20	27
E2	10	9	10	25
E3	23	20	14	23
E4	32	24	21	17

Using minmax principle, determine the best alternative.

Consider the problem of assigning five jobs to five persons. The assignment costs are given as follows. Determine the optimum assignment schedule.

Solve the following assignment problem.