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.

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