EMT 14 BL 2 PDF

¤fl¬fl¬ 10
¬¤fl¬fl¬ ❑ Δı˛ ø ‡fl¬ Œ√ õ ∂±·Ë ± ˜øıøÒ ¸˜¸…±˚˛ ΔZÓ¬Ó¬± (Duality

in L.P.P)
·Í¬Ú
√ 10.1 õ∂ô¶∏ ± ıÚ±
√ 10.2 ΔZÓ¬ ¸˜¸…±ı˛ ·±øÌøÓ¬fl¬ ı˛ + ¬ Û
√ 10.3 Î¬◊  ±˝ı˛ Ì
√ 10.4 ΔZÓ¬Ó¬± ¸—[±ôL√ Î¬◊ ¬ Û±… ¸˜” ˝
√ 10.5 ΔZÓ¬Ó¬± ¤ı— Simplex ÛX¬øÓ¬
√ 10.6 Î¬◊  ±˝ı˛ Ì
√ 10.7 ¸±ı˛ ± —˙
√ 10.8 ’Ú≈ ˙ œ˘Úœ
√ 10.9 Î¬◊ M ı˛ ˜ ±˘±
10.1 õ∂ô¶∏ ± ıÚ±
Œ˚ Œfl¬±Ú ¤fl¬øÈ¬ √õ∂M Δı˛ø‡fl¬ Œ√õ∂±·Ë±˜øıøÒ ¸˜¸…±ı˛ ¸À/ øıÀ˙¯∏ˆ¬±Àı ¸•Ûøfl«¬Ó¬ ’¬Ûı˛ ¤fl¬øÈ¬
Δı˛ø‡fl Œ√õ∂±·Ë±˜øıøÒ ¸˜¸…± ¬Û±›˚˛± ˚±˚˛º ¤Àé¬ÀS øZÓ¬œ˚˛ ¸˜¸…±øÈ¬Àfl¬ ΔZÓ¬ (Dual) ¸˜¸…±
¤ı— √õ∂Ô˜øÈ¬Àfl¬ ˜≈‡… (Primal) ¸˜¸…± ı˘± ˝Àıº øı¯∏˚˛øÈ¬ ¶Û©Ü fl¬ı˛±ı˛ ÊÀÚ… øÚÀ•ßı˛ ¸˜¸…±øÈ¬ Òı˛±
˚±fl¬º
˜ÀÚ fl¬èÚ Œfl¬±Ú ¬Ûq¬Û±˘Ú Œfl¬Àf √õ∂øÓ¬øÈ¬ ¬Ûqı˛ ‡±À… A, B, C ¤˝◊ øÓ¬Ú √õ∂fl¬±ı˛ ¬Û≈ø©Üfl¬ı˛ ¬Û±ÀÔ«ı˛
√õ∂À˚˛±ÊÚº Œ±fl¬±Ú ˜±ø˘Àfl¬ı˛± Œfl¬±Ú ¬Û≈ø©Üfl¬ı˛ ¬Û±Ô« øı[˚˛fl¬±ı˛œ ı…ı¸±˚˛œı˛ fl¬±Â ŒÔÀfl¬ Î¬◊ª øÓ¬Ú
√õ∂fl¬±ı˛ ¬Û≈ø©Üfl¬ı˛ ¬Û±Ô« [˚˛ ≈˝◊ √õ∂fl¬±ı˛ ¬Ûq‡±… X › Y √õ∂dÓ¬ fl¬Àı˛º ¬Û≈ø©Üfl¬ı˛ ¬Û±Ô« øı[˚˛fl¬±ı˛œ ı…ı¸±˚˛œ
≈˝◊ √õ∂fl¬±ı˛ ‡±… X › Y ¤ı˛ ı±Ê±ı˛ ı˛ Ê±ÀÚ± øÚÀÊı˛ ¸±ı˛ÌœÀÓ¬ ¤fl¬fl¬ ¬Ûøı˛˜±Ì X › Y ‡±À… ¬Û≈ø©Üfl¬ı˛
7
NSOU
¬Û±Ô« A, B, C ¤ı˛ ¬Ûøı˛˜±Ì, √õ∂øÓ¬øÈ¬ ¬Ûqı˛ ˝◊˝±Àı˛ Ú”…ÚÓ¬˜ √õ∂À˚˛±ÊÀÚ ¤ı— ¤fl¬fl¬ ¬Ûøı˛˜±Ì X › Y
‡±À…ı˛ ı±Ê±ı˛ı˛ Œ›˚˛± ˝˘ †
‡±… ¬Û≈ ø ©Ü fl ¬ı˛ ¬Û±Ô« õ∂øÓ¬ ¤fl¬Àfl¬ı˛
A B C ı±Ê±ı˛ ı˛
x 1 2 2 2
y 3 4 1 3
Ú”…ÚÓ¬˜ √õ∂À˚˛±ÊÚ 10 9 3
¤‡Ú ı…ıı¸±˚˛œı˛ Î¬◊ÀV˙… ˝Àı A, B, C ¬Û±Ô«&ø˘ı˛ øı[˚˛˜”˘… ¤˜Úˆ¬±Àı øÍ¬fl¬ fl¬ı˛± ˚±ÀÓ¬ X
› Y ‡±Àı˛ ˜”˘… Œ˚Ú ı±Ê±ı˛Àı˛ı˛ Œı˙œ Ú± ˝˚˛ ¤ı— ¤fl¬˝◊ ¸À/ Œ˚Ú Ó¬±ı˛ Œ˜±È¬ øı[˚˛˜”˘ z
¸ıÀ‰¬À˚˛ Œı˙œ ˝˚˛º ˚ø ¤fl¬fl¬ ¬Ûøı˛˜±Ì A, B, C ¤ı˛ øı[˚˛˜”˘… ˚Ô±[À˜ x1, x2, x3 øîı˛ fl¬ı˛± ˝˚˛
Ó¬Àı ı…ı¸±˚˛œı˛ Î¬◊ÀV˙… ŒÔÀfl¬ ’±˜ı˛± øÚÀ‰¬ı˛ Δı˛ø‡fl¬ Œ√õ∂±·Ë±˜øıøÒ ¸˜¸…±øÈ¬ ¬Û±˝◊ †
z = 10x1 + 9x2 + 3x3 ¤ı˛ ‰¬ı˛˜ (maximum) ˜±Ú øÚÌ«˚˛ fl¬ı˛ÀÓ¬ ˝Àı,
Œ˚‡±ÀÚ, x1 + 2x2 + 2x3 4
3x1 + 4x2 + x3 3
x1 + x2 + x3 9
¤‡Ú Î¬◊¬ÛÀı˛±ª ¸˜¸…±øÈ¬Àfl¬ ’Ú…ˆ¬±Àı Œ‡± ˚±fl¬º
Œfl¬±Ú Œ±fl¬±Ú ˜±ø˘Àfl¬ı˛ Î¬◊ÀV˙… ˝Àı X › Y ≈˝◊ √õ∂fl¬±ı˛ ‡±… øfl¬ ¬Ûøı˛˜±Ì √õ∂dÓ¬ fl¬ı˛Àı Ó¬± øÍ¬fl¬
fl¬ı˛± ˚±ÀÓ¬ √õ∂øÓ¬øÈ ¬Ûqı˛ A, B, C øÓ¬Ú √õ∂fl¬±ı˛ ¬Û≈ø©Üfl¬ı˛ ¬Û±ÀÔ«ı˛ Ú”Ú…Ó¬˜ √õ∂À˚˛±ÊÚ Œ˜È¬±ÀÚ± ˚±˚˛ ¤ı—
¤fl¬˝◊ ¸À/ X › Y ‡±À…ı˛ Œ˜±È¬ [˚˛˜”˘… ï∑ó ¸ıÀ‰¬À˚˛ fl¬˜ ˝˚˛º ˚ø √õ∂øÓ¬ ¬Ûqı˛ ÊÚ… ˚Ô±[À˜
v1, v2 ¤fl¬fl¬ X › Y ‡±… √õ∂dÓ¬ fl¬ı˛± ˝˚˛ Ó¬Àı Œ±fl¬±Ú ˜±ø˘Àfl¬ı˛ Î¬◊ÀV˙… ŒÔÀfl¬ ’±˜ı˛± øÚÀ‰¬ı˛
Δı˛ø‡fl¬ Œ√õ∂±·Ë±˜øıøÒ ¬Û±˝◊ †
w = 4v1 + 3v2 ¤ı˛ ‰¬ı˛˜ (minimum) ˜±Ú øÚÌ«˚˛ fl¬ı˛ÀÓ¬ ˝Àı,
Œ˚‡±ÀÚ, v1 + 3v2 10
2v1 + 4v2 + x3 9
2v1 + v2 + x3 3,
v1 0, v2 0
Î¬◊¬ÛÀı˛ı˛ ≈øÈ¬ ¸˜¸…±ı˛ Œ˚ Œfl¬±Ú ¤fl¬øÈ¬Àfl¬ ˜≈‡… ¸˜¸…± ı˘À˘ ’Ú…øÈ¬Àfl¬ ΔZÓ¬ ¸˜¸…± ı˘± ˝Àıº
¤‡±ÀÚ ˜ÀÚ ı˛±‡ÀÓ¬ ˝Àı Œ˚ ≈øÈ¬ ¸˜¸…±ı˛ ˜ÀÒ… Œfl¬±ÚƒøÈ¬Àfl¬ ˜≈‡… ¸˜¸…± ı˘± ˝˘ Ó¬±ı˛ ›¬Ûı˛ ΔZÓ¬
¸˜¸…± ¸—[±ôL√ Î¬◊¬Û¬Û±…&ø˘ øÚˆ«¬ı˛ fl¬Àı˛ Ú±º [ fl¬±ı˛Ì 10·5 ’Ú≈ÀBÂÀ √õ∂Ô˜ Î¬◊¬Û¬Û±À… √õ∂˜±Ì fl¬ı˛±
˝À˚˛ÀÂ Œ˚ ΔZÓ¬ ¸˜¸…±øÈ¬Àfl¬ ¤fl¬øÈ¬ ˜≈‡… ¸˜¸…±ı˛+À¬Û Œ‡À˘, ΔZÓ¬ ¸˜¸…±øÈ¬ı˛ ΔZÓ¬ ¸˜¸…± √õ∂Ô˜ ˜≈‡…
¸˜¸…± ˝Àıº ]
Î¬◊¬ÛÀı˛ı˛ Î¬◊±˝ı˛ÀÌ ¬Û≈ø©Üfl¬ı˛ ¬Û±Ô« øı[˚˛fl¬±ı˛œ ı…ı¸±˚˛œı˛ ¸˜¸…±øÈ¬Àfl¬ ï˚± ¤fl¬øÈ¬ ‰¬ı˛˜ ˜±Ú øÚÌ«˚˛
8
NSOU
¸—[±ôL ¸˜¸…±ó ˜≈‡… ¸˜¸…± ı˘± ˝À˚˛ÀÂ ¤ı— Œ±fl¬±Ú ˜±ø˘Àfl¬ı˛ ¸˜¸…±øÈ¬Àfl¬ ï˚± ¤fl¬øÈ¬ ’ı˜ ˜±Ú
øÚÌ«˚˛ ¸—[±ôL√ ¸˜¸…±ó ΔZÓ¬ ¸˜¸…± ı˘± ˝À˚˛ÀÂº ’±˜ı˛± ¤˝◊ ı˛œøÓ¬ ’Ú≈˚±˚˛œ, ¬Ûı˛ıÓ«¬œ ’Ú≈ÀBÂÀ Œ˚
Œfl¬±Ú √õ∂M Δı˛ø‡fl¬ Œ√õ∂±·Ë±˜øıøÒ ¸˜¸…±ı˛ ΔZÓ¬ ¸˜¸…±ı˛ ·±øÌøÓ¬fl¬ ı˛+À¬Ûı˛ ¸—:± Œıº
10.2 Œfl¬±Ú √ õ ∂M Δı˛ ø ‡fl¬ Œ√ õ ∂±·Ë ± ˜øıøÒ ¸˜¸…±ı˛ ΔZÓ¬ ¸˜¸…±ı˛
·±øÌøÓ¬fl¬ ı˛ + ¬ Û
¤‡±ÀÚ ’±˜ı˛± ˜≈‡… Δı˛ø‡fl¬ Œ√õ∂±·Ë±˜øıøÒ ¸˜¸…±øÈ¬Àfl¬ øÚ•ßø˘ø‡Ó¬ √õ∂fl¬±ı˛ fl¬ı˛ı †
z = c1 x1 + c2 x2 + ............ + cn xn ¤ı˛ ‰¬ı˛˜ ˜±Ú øÚÌ«˚˛ fl¬ı˛ÀÓ¬ ˝Àı, Œ˚‡±ÀÚ
a11 x1 + a12 x2 + ............ + a1n xn b1
a21 x1 + a22 x2 + ............ + a2n xn b2
...........................................................................................................
am1 x1 + am2 x2 + ............ + amn xn bm’

x1, x2, ............ xn 0
øÚÀ‰¬ı˛ øıÀ˙¯∏ Δı˛ ø ‡fl¬ Œ√ õ ∂±·Ë ± ˜øıøÒ ¸˜¸…±øÈ¬Àfl¬ Î¬◊¬ÛÀı˛ı˛ ¸˜¸…±øÈ¬ı˛ ΔZÓ¬ ¸˜¸…± ı˘± ˝Àıº
w =b1 v1 + b2 v2 + ............ + bm vm ¤ı˛ ’ı˜ ˜±Ú øÚÌ«˚˛ fl¬ı˛ÀÓ¬ ˝Àı, Œ˚‡±ÀÚ
a11 v1 + a12 v2 + ............ + am1 vm c1
a12 v2 + a22 v2 + ............ + am2 vm c2
...........................................................................................................
a1n v1 + a2n v2 + ............ + amn vm cn

v1, v2, ............ vm 0
¸˜¸…± ≈øÈ¬Àfl¬ ˜…±øÈ¬™' ’±fl¬±Àı˛ √õ∂fl¬±˙ fl¬ı˛À˘ ’±˜ı˛± ¬Û±˝◊ †
˜≈ ‡ … ¸˜¸…±
‰¬ı˛˜ z = c x , x ³ 0
Œ˚‡±ÀÚ A x £ b ...........................(1)
ΔZÓ¬ ¸˜¸…±
’ı˜ w = b , v , v ³ 0
Œ˚‡±ÀÚ A ' v ³ c'
¤‡±ÀÚ x = [x1, x2, ................ x2]
c = [c1, c2, ................ x2]
˚Ô±[À˜ n×1 [À˜ı˛ ô¶∏y¬ ˜…±øÈ¬™' (Column matrix) › 1×n [À˜ı˛ ¸±øı˛ ˜…±øÈ¬™' (row
metrix, A ¤fl¬øÈ¬ m×n [À˜ı˛ ˜…±øÈ¬™' ¤ı— v = [v1, v2 ........ vm] ˝˘ m×1 [À˜ı˛ ô¶∏y¬ ˜…±øÈ¬™'º
[Œfl¬±Ú ˜…±øÈ¬™' ¤ı˛ ¬Ûøı˛ıÓ«¬ ˜…±øÈ¬™'Àfl¬ Z±ı˛± øÚÀ«˙ fl¬ı˛± ˝À˚˛ÀÂº]
9
NSOU
¤‡±ÀÚ Œfl¬±Ú ˜≈‡… ¸˜¸…±Àfl¬ (1) Ú— ’±fl¬±Àı˛ √õ∂fl¬±˙ fl¬ı˛À˘, ¤˝◊ ı˛+¬ÛÀfl¬ ¸˜¸…±øÈ¬ı˛ √ õ ∂˜±Ì
’±fl¬±ı˛ (standard form) ı˘± ˝Àıº
˜ôL√ ı … † ΔZÓ¬ ¸˜¸…±ı˛ ¸—:± ŒÔÀfl¬ ’±˜ı˛± ˘é¬… fl¬ı˛øÂ Œ˚,
(i) ˜≈‡… ¸˜¸…±ı˛ ˙ÀÓ¬«ı˛ ¸—‡…± ï x ³ 0 Â±h¬±ó = ΔZÓ¬ ¸˜¸…±ı˛ ‰¬À˘ı˛ ¸—‡…± (number of
variables) ¤ı— øı¬Ûı˛œÓ¬[À˜ ΔZÓ¬¸˜¸…±ı˛ ˙ÀÓ«¬ı˛ ¸—‡…± ï v ³ 0 Â±h¬±ó v = ˜≈‡… ¸˜¸…±ı˛
‰¬À˘ı˛ ¸—‡…±º
(ii) ¤‡±ÀÚ ˜≈‡… ¸˜¸…±øÈ¬ ‰¬ı˛˜ ˜±Ú øÚÌ«˚˛ ¸—[±ôL√ › √õ∂Ô±Ú ˙Ó«¬&ø˘ ëëíí ’±fl¬±Àı˛ı˛ ¤ı— ΔZÓ¬
¸˜¸…±øÈ¬ ’ı˜ ˜±Ú øÚÌ«˚˛ ¸—[±ôL√ › √õ∂Ò±Ú ˙Ó«¬&ø˘ ëëíí ’±fl¬±Àı˛ı˛º
(iii) ¤‡±ÀÚ b1, b2,...........bm ¤ı˛ ˜±Ú ÒÚ±Rfl¬ Ú±› ˝ÀÓ¬ ¬Û±Àı˛º
(iv) ˜≈‡… ¸˜¸…±øÈ¬ı˛ ˙Ó«¬&ø˘ı˛ ¸˝· ˜…±øÈ¬™'øÈ¬ı˛ ¬Ûøı˛ıÓ«¬Ú ˜…±øÈ¬™'øÈ¬ (Transpose matrix) ˝Àı
ΔZÓ¬ ¸˜¸…±ı˛ ˙Ó«¬&ø˘ı˛ ¸˝· ˜…±øÈ¬™'º
(v) x ³ o ı± [ x1 , x2 ................ xn ] ³ éo ù
êo ú
ê· ú
ê· ú
ê· ú
ê ú
ëo û
¤ı˛ ’Ô« x1 ³ 0, x2 ³ 0,............. xn ³ 0

¤ı— v ³ 0 ¤ı˛ ’Ô« v1 ³ 0, v2 ³ 0,............. vm ³ 0
Œfl¬±Ú ˜≈‡… ¸˜¸…± ïı± Ó¬±ı˛ ΔZÓ¬ ¸¸˜…±ó Œfl¬ symmetric ı˘± ˝Àı ˚ø ¸˜¸…±øÈ¬ı˛ √õ∂ÀÓ¬…fl¬øÈ¬
˙Ó«¬fl¬ ’¸fl¬˜œfl¬ı˛Ì (inequations) ’±fl¬±Àı˛ Ô±Àfl¬ ¤ı— ¸˜¸…±øÈ¬Àfl¬ unsymmetric ı˘± ˝Àı
˚ø √õ∂ÀÓ¬…fl¬øÈ¬ ˙Ó«¬ ¸˜œfl¬ı˛Ì (equations) ’±fl¬±Àı˛ Ô±Àfl¬º ˚ø ˜≈‡… ¸˜¸…± ïı± Ó¬±ı˛ ΔZÓ¬ ¸˜¸…±ó
øÈ¬ı˛ ˙Ó«¬&ø˘ ¸˜œfl¬ı˛Ì › ’¸˜œfl¬ı˛Ì Î¬◊ˆ¬˚˛ ’±fl¬±Àı˛˝◊ Ô±Àfl¬ Ó¬Àı ¸˜¸…±øÈ¬Àfl¬ mixed type ¸˜¸…±
ı˘± ˝Àı ¤ı— ¤˝◊ ’±fl¬±Àı˛ı˛ ¸˜¸…±ı˛ Œé¬ÀS ¤fl¬ ı± ¤fl¬±øÒfl¬ ‰¬À˘ı˛ ˜±Ú ÒÚ±Rfl¬, ŸÌ±Rfl¬ Î¬◊ˆ¬˚˛˝◊
˝ÀÓ¬ ¬Û±Àı˛ ’Ô«±» ¤˝◊ ‰¬˘&ø˘ 0 ˙Ó«¬øÈ¬ ˜±ÀÚ Ú±ñ¤˝◊ ‰¬˘&ø˘Àfl¬ ø‰¬˝ê ¸±À¬Ûé¬ ’ı±Ò (unre-
stricted in sign) ıÀ˘ Î¬◊À{°‡ fl¬ı˛± ˚±˚˛º
(10·3) ’Ú≈ÀBÂÀ fl¬À˚˛fl¬øÈ¬ Î¬◊±˝ı˛ÀÌı˛ ¸±˝±À˚… ’±˜ı˛± Œ‡ı øfl¬ˆ¬±Àı ¤fl¬øÈ¬ √õ∂M Δı˛ø‡fl¬
Œ√õ∂±·Ë±˜øıøÒ ¸˜¸…±ı˛ (symmetric, unsymmetric, mixed type) ΔZÓ¬ ¸˜¸…± ·Í¬Ú fl¬ı˛± ˚±˚˛
¤ı— øÚÀ‰¬ øıı‘Ó¬ Î¬◊¬Û¬Û±…&ø˘ı˛ ¸Ó¬…Ó¬± ˚±‰¬±˝◊ fl¬ı˛ıº
Î¬◊ ¬ Û¬Û±… 1 ˚ø ˜≈‡… ¸˜¸…±øÈ¬ı˛ Œfl¬±Ú ˙Ó«¬ (constraint) ¸˜œfl¬ı˛Ì ’±fl¬±Àı˛ Ô±Àfl¬ Ó¬±˝À˘
ΔZÓ¬ ¸˜¸…±ı˛ ’Ú≈ı˛+¬Û ‰¬˘øÈ¬ ‘‘unrestricted in sign’’ ˝Àıº
Î¬◊ ¬ Û¬Û±… 2 ˚ø ˜≈‡… ¸˜¸… ¸˜¸…±øÈ¬ı˛ Œfl¬±Ú ‰¬˘ ‘‘unrestricted in sing’’ ˝˚˛ Ó¬Àı ΔZÓ¬
¸˜¸…±ı˛ ’Ú≈ı˛+¬Û ˙Ó«¬øÈ¬ ¤fl¬øÈ¬ ¸˜œfl¬ı˛Ì ˝Àıº
10
NSOU
10.3 Î¬◊  ±˝ı˛ Ì
1. øÚÀ‰¬ı˛ Δı˛ø‡fl¬ Œ√õ∂±√·Ë±˜øıøÒ (L.P.P.) ΔZÓ¬ ¸˜¸…±øÈ¬ øÚÌ«˚˛ fl¬èÚº
z = 3x1 - 2 x2 ¤ı˛ ‰¬ı˛˜ ˜±Ú øÚÌ«˚˛ fl¬ı˛ÀÓ¬ ˝Àı Œ˚‡±ÀÚ, x1 £ 4, x2 £ 6, x1 + x2 £ 5,
- x2 £ -1, x1 , x2 ³ 0 º
¸±˜Ò±Ú † ¤‡±ÀÚ √õ∂M √õ∂˜±Ì ’±fl¬±Àı˛ı˛ (standard form) ¸˜¸…±øÈ¬ ˜±øÈ¬™' ’±fl¬±Àı˛ ø˘‡À˘
’±˜ı˛± ¬Û±˝◊ ‰¬ı˛˜ z = (3, - 2) [ x1 , x2 ]
¬Œ˚‡±ÀÚ LM1 0 OP LM x OP L 4 O
MM01 11 PP Nx Q MM 65 PP
1
2
N0 -1Q MN-1PQ
¤ı— LM x OP LM0OP
Nx Q N0Q
1
2
Î¬◊¬ÛÀı˛ı˛ ¸˜¸…±øÈ¬ı˛ ΔZÓ¬ ¸˜¸…±øÈ¬ ˝Àı ’ı˜ w = (4, 6, 5, –1) [v1, v2, v3, v4]
Œ˚‡±ÀÚ, LM1 0 1 0 OP LM v OP LM-32OP
N0 1 1 -1Q Mvv P N Q
1
2
MNv PQ
3
4
¤ı— LMv OP LM00OP

1
MMvv PP MM0PP
2
Nv Q N0Q
3
4
’Ô«±» ’ı˜ w = 4v1 + 6v2 + 5v3 – v4,

Œ˚‡±ÀÚ v1 + v2 3
v2 + v 3 – v 4 – 2
¤ı— v1, v2, v3,v4 0º
2. ’ı˜ z = x1 + 2x2 – v4
Œ˚‡±ÀÚ 2x1 + 3x2 + 4x3 5
2x1 + x2 + 4x3 – 5
11
NSOU
– 3x1 + 2x3 0,
x1, x2, x3 0
Δı˛ø‡fl¬ Œ√õ∂±·Ë±˜øıøÒ ¸˜¸…±øÈ¬ı˛ ΔZÓ¬ ¸˜¸…±øÈ¬ øÚÌ«˚˛ fl¬èÚº
¸˜±Ò±Ú † √õ∂M ˜≈‡… ¸˜¸…±øÈ¬ √õ∂˜±Ì ’±fl¬±Àı˛ (standard form) ø˘‡À˘ ’±˜ı˛± ¬Û±˝◊,
‰¬ı˛˜ z1 = - x1 - 2 x2 + x3 ,
Œ˚‡±ÀÚ -2 x1 + 3x2 - 4 x3 £ -5
-2 x1 - x2 £2 UV
-2 x1 - x2 £0 W
............(1)
x1 , x2 , x3 ³ 0
¤ı— Œ˚‡±ÀÚ (z) ’ı˜ = – (z) ‰¬ı˛˜º
¤‡Ú √õ∂˜±Ì
¤‡Ú √õ∂˜±Ì ’±fl¬±Àı˛ı˛ ¤˝◊ ˜≈‡ ¸˜¸…±øÈ¬ı˛ ΔZÓ¬ ¸˜¸…±øÈ¬ ˝Àı,
’ı˜ w1 = -5v1 + 2v2 + 0v3
Œ˚‡±ÀÚ -2v1 - 2v1 + 3v3 ³ -1 U|

V|
3v1 - v2 + 0v3 ³ -2 .............(2)
-4v1 + 0v2 - 2v3 ³ 1 W
¤ı— v1 ³ 0, v2 ³ 0, v3 ³ 0 º
[ ¤‡±ÀÚ ˘é¬Ìœ˚˛ Œ˚ (1) Ú— ˜≈‡ ¸˜¸…±øÈ¬ı˛ ˙Ó«¬&ø˘ı˛ ¸±øı˛ ¸˝·&ø˘ ˝˘ (2) Ú— ΔZÓ¬
¸˜¸…±øÈ¬ı˛ ˙Ó«¬&ø˘ı˛ ô¶∏y¬ ¸˝· ]
¤‡Ú (2) Ú— ¸˜¸…±øÈ¬ı˛ ¸˜Ó≈¬˘… ’±fl¬±ı˛ ˝˘
‰¬ı˛˜ w = 5v1 - 2v2 ,
Œ˚‡±ÀÚ 2v1 + 2v2 - 3v2 , £ 1 U|

-3v1 _ v2 V|
£ 2 ...............( 3)
4v1 + 2v3 £ -1 W
¤ı— v1 ³ 0, v2 ³ 0, v3 ³ 0 º
(3) Ú— Δı˛ø‡fl¬ Œ√õ∂±·Ë±˜øıøÒ ¸˜¸…±øÈ¬ øÚÀÌ«˚˛ ΔZÓ¬ ¸˜¸…±º
3. øÚÀ‰¬ı˛ ˜≈‡ ¸˜¸…±øÈ¬ı˛ ΔZÓ¬ ¸˜¸…±øÈ¬ ø˘‡≈Ú †
‰¬ı˛˜ z = x1 - 3x2 ,
˙Ó¬«¸±À¬ÛÀé¬ 3x1 + 2 x2 £ 6
3x1 + x2 = 4;
x1 , x2 ³ 0
¸˜±Ò±Ú † ¤‡±ÀÚ √õ∂M ˜≈‡… ¸˜¸…±øÈ¬ ø˜| ’±fl¬±Àı˛ (mixed type) ’±ÀÂº
12
NSOU
√õ∂ÔÀ˜ ˜≈‡… ¸˜¸…±øÈ¬Àfl¬ √õ∂˜±Ì ’±fl¬±Àı˛ √õ∂fl¬±˙ fl¬ı˛± ˚±fl¬º
¤‡±ÀÚ 3x1 - x2 = 4 ¬ ˙Ó«¬øÈ 3x1 - x2 £ 4, -3x1 - x2 £ - 4 ¤˝◊ ˙Ó«¬ ≈øÈ¬ı˛ ¸˜Ó≈¬˘…º
¸≈Ó¬ı˛±— ˜≈‡… ¸˜¸…±øÈ¬ ˝˘
‰¬ı˛˜ z = x1 - 3x2
˙Ó«¬¸±À¬ÛÀé¬ 3x1 + 2 x2 £ 6 U|
3x1 - x2 £ 4 V|
.............(1)
-3x1 + x2 £ -4 W
¤ı— v1 ³ 0, v2 ' ³ 0, v2 '' ³ 0
(1) Ú— ¸˜¸…±øÈ¬ı˛ ΔZÓ¬ ¸˜¸…±øÈ¬ ˝Àı
’ı˜ w = 6v1 + 4v2 '-4v2 '',
˙Ó«¬¸±À¬ÛÀé 3v1 + 3v2 '-3v2 '' ³ 1
2v1 + v2 '-v2 '' ³ 3
¤ı— v1 ³ 0, v2 ' ³ 0, v2 '' ³ 0
¤‡Ú v2 ' - v2 '' = v2 ø˘‡À˘, v2 ¤fl¬øÈ¬ ø‰¬˝ê ¸±À¬ÛÀé¬ ’ı±Ò ‰¬˘ ˝˚˛ ï’Ô«±» v2 ‘‘unrestrieted)
in singn’’ ˝Àıóº
Ó¬±˝À˘ Î¬◊¬ÛÀı˛ı˛ ΔZÓ¬ ¸˜¸…±øÈ¬Àfl¬ Œ˘‡± ˚±˚˛,
’ı˜ w = 6v1 + 4v2 ,
˙Ó«¬¸±À¬ÛÀé¬ 3v1 + 3v2 £ 1, UV

2v1 - v2 £ -3; W
.............(2)
v1 £ 0, v2 ø‰¬˝ê ¸±À¬ÛÀé¬ ’ı±Ò ‰¬˘º

(2) Ú— ¸˜¸…±øÈ¬ ˝˘ øÚÀÌ«˚˛ ΔZÓ¬ ¸˜¸…±º
˜ôL√ ı … † ¤‡±ÀÚ ’±˜ı˛± ˘é¬… fl¬ı˛øÂ Œ˚ ˜≈‡… ¸˜¸…±øÈ¬ı˛ (in the given from) ‰¬À˘ı˛ ¸—‡…± 2
˚± (2) Ú— ΔZÓ¬ ¸˜¸…±ı˛ ˙ÀÓ«¬ı˛ ¸—‡…±ı˛ ¸˜±Úº ¬Û≈Úı˛±˚˛ ˜≈‡… ¸˜¸…±øÈ¬ı˛ øZÓ¬œ˚˛ ˙Ó«¬øÈ¬ ¤fl¬øÈ¬
¸˜œfl¬ı˛Ì ˝›˚˛±˚˛, ¸˜¸…±øÈ¬ı˛ v2 ‰¬˘øÈ¬ ø‰¬À˝ê ’ı±Ò (unrestricted in sign)º
4. øÚÀ‰¬ı˛ Δı˛ø‡fl¬ Œ√õ∂±·Ë±˜øıøÒ ¸˜¸…±øÈ¬ı˛ ΔZÓ¬ ¸˜¸…±øÈ¬ øÚÌ«˚˛ fl¬èÚ †
‰¬ı˛˜ z = 7 x1 + 5x2 - 2 x3 ,
˙Ó«¬¸±À¬ÛÀé¬ x1 + x2 + x3 = 10
2 x1 - x2 + 3x3 £ 16
x1 ³ 0, x2 ³ 0, x3 ø‰¬˝ê ¸±À¬ÛÀé¬ ’ı±Ò ‰¬˘º
¸˜±Ò±Ú † ¤‡±ÀÚ ˜≈‡… ¸˜¸…±øÈ¬Àfl¬ Œ˘‡± ˚±˚˛,
‰¬ı˛˜ z = 7 x1 + 5x2 - 2( x3 '- x3 ''),
13
NSOU
˙Ó«¬¸±À¬ÛÀé¬ x1 + x2 + x3 '- x3 '' £ 10 U|
- ( x1 + x2 - x3 '- x3 '') £ -10
2 x1 - x2 + 3 ( x3 '- x3 '') £ 16
|V..............(1)
-3x1 - x2 + 2 ( x3 '- x3 '') £ 5, ||
x1 ³ 0, x2 ³ 0, x3 ' ³ 0, x3 '' ³ 0 W
ïŒ˚‡±ÀÚ, x3 = x3 '- x3 '' ó
(1) Ú— ¸˜¸…±øÈ¬ı˛ ΔZÓ¬ ¸˜¸…±øÈ¬ ˝Àı,
’ı˜ w = 10v1 ' - 10v1 '' + 16v2 + 5v3 '
˙Ó«¬¸±À¬ÛÀé¬ v1 ' - v1 '' + 2v2 - 3v3 ³ 7, U|

v1 ' - v1 '' - v2 - v2 ³ 5,
v1 ' - v1 '' + 3v2 + 2v3 ³ -2, V|.............(2)
- v1 ' + v1 '' - 3v2 - 2v3 ³ 2, W
v1 ' ³ 0, v1 '' ³ 0, v2 ³ 0, v3 ³ 0
¤‡Ú v1 ' - v1 '' = v1 ø˘‡À˘ (2) Ú— ¸˜¸…±øÈ¬Àfl¬ Œ˘‡± ˚±˚˛,

’ı˜ w = 10v1 + 16v2 + 5v3 ,
˙Ó«¬¸±À¬Ûé¬ v1 + 2v2 - 3v3 ³ 7 U|

v1 - v2 - v3 ³ 5
v1 + 3v3 ³ - 2 V|.............(3)
- v1 - 3v2 - 2v3 ³ 2, W
v2 ³ 0, v3 ³ 0, v1 ø‰¬˝ê ¸±À¬ÛÀé¬ ’ı±Ò ‰¬˘º
’±˜ı˛± ˘é¬… fl¬Àı˛øÂ Œ˚ (3) Ú— ¸˜¸…±øÈ¬ı˛ Ó‘¬Ó¬œ˚˛ › ‰¬Ó≈¬Ô« ˙Ó«¬ ≈øÈ¬ ˙ÀÓ«¬ı˛ ¸˜Ó≈¬˘…º
¸≈Ó¬ı˛±— øÚÀÌ«˚˛ ΔZÓ¬ ¸˜¸…±øÈ¬ ˝˘,
’ı˜ w = 10v1 + 16v2 + 5v3 ,
v1 + 2v2 - 3v3 ³ 7 U|
V|..............(4)
˙Ó«¬¸±À¬ÛÀé¬
v1 - v2 - v3 ³ 5
v1 + 3v2 + 2v3 = - 2, W
˜ôL√ ı … † ¤‡±ÀÚ ’±˜ı˛± ˘é¬… fl¬ı˛øÂ Œ˚ ˜≈‡… ¸˜¸…±øÈ¬ı˛ √ õ ∂Ô˜ ˙Ó« ¬ øÈ¬ ¸˜œfl¬ı˛Ì ˝›˚˛±˚˛ ΔZÓ¬
¸˜¸…±øÈ¬ı˛ v1 ‰¬˘øÈ¬ ø‰¬˝ê ¸±À¬ÛÀé¬ ’ı±Ò (unrestricted in sign) ¤ı— ˜≈‡… ¸˜¸…±øÈ¬ı˛ x3 ø‰¬˝ê
¸±À¬ÛÀé¬ ’ı±Ò ‰¬˘ ˝›˚˛±˚˛, ΔZÓ¬ ¸˜¸…±øÈ¬ı˛ Ó‘¬Ó¬œ˚˛ ˙Ó«¬øÈ¬ ¤fl¬øÈ¬ ¸˜œfl¬ı˛Ìº
14
NSOU
10.4 ΔZÓ¬Ó¬± ¸—[±ôL√ Î¬◊ ¬ Û¬Û±…¸˜” ˝
øÚÀ‰¬ı˛ Î¬◊¬Û¬Û±…&ø˘ÀÓ¬ ˜≈‡… ¸˜¸…±øÈ¬ √õ∂˜±Ì ’±fl¬±Àı˛ (standared form) Òı˛± ˝À˚˛ÀÂ ’Ô«±»
˜≈‡… ¸˜¸…±øÈ¬ ˝˘
‰¬ı˛˜ z = c x, ........................ (1)
˙Ó«¬¸±À¬ÛÀé¬ A x £ b , x ³ 0,
Œ˚‡±ÀÚ x = [ x1 , x2 ,........ xn ], c = (c1 , c2 , ......... cn ), b = [b1 , b2 , .........bm ] ¤ı— A ¤fl¬øÈ¬
m×n [À˜ı˛ ˜…±øÈ¬™'º
¤‡±ÀÚ (1) ¤ı˛ ΔZÓ¬ ¸˜¸…±øÈ¬ ˝Àı
’ı˜ w = b ' v ...........................(2)
˙Ó«¬¸±À¬ÛÀé¬ A' v ³ c ', v ³ 0
Œ˚‡±ÀÚ v = [v1 , v2 .......... vm ]
Î¬◊ ¬ Û¬Û±… 1 † Œfl¬±Ú ˜≈‡… Δı˛ø‡fl¬ Œ√õ∂±·Ë±˜øıøÒ ¸˜¸…±ı˛ ΔZÓ¬ ¸˜¸…±ı˛ ΔZÓ¬ ¸˜¸…± ˝Àı ˜≈‡… ¸˜¸…±º
õ ∂˜±Ì † ¤‡±ÀÚ (1) Ú— ¸˜¸…±øÈ¬ ¤ı— (2) Ú— ¸˜¸…±øÈ¬ (1) ¤ı˛ ΔZÓ¬ ¸˜¸…±º
√õ∂˜±Ì
¤‡Ú (2) Ú— ¸˜¸…±øÈ¬Àfl¬ øÚ•ßø˘ø‡Óˆ¬±Àı ¤fl¬øÈ¬ ‰¬ı˛˜ ¸˜¸…± ı˛+À¬Û √õ∂fl¬±˙ fl¬ı˛± ˚±˚˛ †
‰¬ı˛˜ w1 = -b ' v , .....................(3)
Œ˚‡±ÀÚ - A' v £ - c , v ³ 0
¤ı— – (w1) ‰¬ı˛˜ = (w) ’ı˜º
ΔZÓ¬ ¸˜¸…±ı˛ ¸—:± ’Ú≈˚±˚˛œ (3) ¤ı˛ ΔZÓ¬ ¸˜¸…±øÈ¬ ˝Àı,
’ı˜ z1 = ( -c ')' x ,
Œ˚‡±ÀÚ ( - A)' x ³ ( -b ')', x ³ 0
’Ô«±» ’ı˜ z1 = c x ,
Œ˚‡±ÀÚ - A x ³ - b , ................... (4)
¬Û≈Úı˛±˚˛ (4) Ú— ¸˜¸…±øÈ¬Àfl¬ øÚ•ßø˘ø‡Ó¬ˆ¬±Àı √õ∂fl¬±˙ ˚±˚˛ †
‰¬ı˛˜ z = - (- c x ),
Œ˚‡±ÀÚ - ( - A x ) £ - ( -b ), x ³ 0
’Ô«±» ‰¬ı˛˜ z = c x , ....................(5)
Œ˚‡±ÀÚ A x £ b , x ³ 0
¤‡Ú (5) Ú— ¸˜¸…±øÈ¬ ˝˘ √õ∂Ô˜ ˜≈‡… ¸˜¸…±º ¸≈Ó¬ı˛±— Î¬◊¬Û¬Û±…øÈ¬ √õ∂˜±øÌÓ¬ ˝˘º
Î¬◊ ¬ Û¬Û±… 2 † ˚ø x ¤ı— v ˚Ô±[À˜ ï1ó Ú— ˜≈‡…¸˜¸…±ı˛ ¤ı— ï2ó Ú— ’Ú≈¯∏/œ ΔZÓ¬
¸˜¸…±ı˛ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú ˝˚˛, Ó¬±˝À˘, c x £ b ' v º
15
NSOU
õ ∂˜±Ì † (1) Ú— ˜≈‡… ¸˜¸…±ı˛ ¤fl¬øÈ¬ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú
√õ∂˜±Ì x ˝À˘ ’±˜ı˛± ¬Û±˝◊
A x £ b , x ³ 0 .............( 6)
’Ú≈ı˛+¬Ûˆ¬±Àı ï2ó Ú— ΔZÓ¬ ¸˜¸…±ı˛ v ¤fl¬øÈ¬ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú ˝À˘ ’±˜ı˛± ¬Û±˝◊
A ' v ³ c , v ³ 0 .............( 7)
¤‡Ú ï6ó ŒÔÀfl¬ ’±˜ı˛± ¬Û±˝◊,
ı±, v ' A x £ v ' b , (3 v ' ³ 0)
¬Û≈Úı˛±˚˛ ï7ó ŒÔÀfl¬ ’±˜ı˛± ¬Û±˝◊,
( A' v )' ³ c
’Ó¬¤ı ( A' v )' x ³ c x , (3 x ³ 0)
’Ô«±» c x £ ( A' v )' x .......................(9)
¤‡Ú ï8ó › ï9ó ŒÔÀfl¬ ’±˜¬Û± ¬Û±˝◊ c x £ v ' b
ı±, c x £ (b ' v )'
¤‡±ÀÚ b ' v ¤fl¬øÈ¬ 1×1 [À˜ı˛ ˜…±øÈ¬™' ˝›˚˛±˚˛, (b ' v )' = b ' v
¸≈Ó¬ı˛±— √õ∂˜±øÌÓ¬ ˝˘ Œ˚, c x £ b ' v
Î¬◊ ¬ Û¬Û±… 3 : ˚ø x * ¤ı— v * ˚Ô±[À˜ (1) Ú— ˜≈‡… ¸˜¸…±ı˛ ¤ı ï2ó Ú— ΔZÓ¬ ¸˜¸…±ı˛
fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú ˝˚˛ Œ˚‡±ÀÚ c x * = b' v * , Ó¬±˝À˘ x * , v * , ˚Ô±[À˜ ¸˜¸…±≈øÈ¬ı˛ ‰¬ı˛˜ (optimal)
¸˜±Ò±Ú ˝Àıº
√ õ ∂˜±Ì † ¤‡±ÀÚ Œ›˚˛± ’±ÀÂ c x = b ' v * ....................(10)
¤‡Ú Òı˛± ˚±fl¬ x ï1ó Ú— ¸˜¸…±ı˛ Œ˚ Œfl¬±Ú fl¬±˚«fl¬ı˛ ¸˜±Ò±Úº
’±ı±ı˛ v * ï2ó Ú— ¤ı˛ ¤fl¬øÈ¬ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú ˝›˚˛±ı˛ ÊÚ…, Î¬◊¬Û¬Û±… 2 ’Ú≈˚±˚˛œ ’±˜ı˛± ¬Û±˝◊,
c x £ b ' v * ....................(11)
¤‡Ú ï10ó › ï11ó ŒÔÀfl¬ ’±˜ı˛± ¬Û±˝◊ c x £ c x * , ˚± ŒÔÀfl¬ ’±˜ı˛± ı˘ÀÓ¬ ¬Û±øı˛ Œ˚ ˝˘ x * ˜≈‡…
¸˜¸…±øÈ¬ı˛ ¤fl¬øÈ¬ ‰¬ı˛˜ ¸˜±Ò±Ú [¤‡±ÀÚ c x * ˝˘ øı¯∏˚˛±Rfl¬ ’À¬Ûé¬Àfl¬ı˛ (objective function)
‰¬ı˛˜ ˜±Ú (maximum value)]º
’Ú≈ı˛+¬Ûˆ¬±Àı x * ˜≈‡… ¸˜¸…±øÈ¬ı˛ ¤fl¬øÈ¬ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú ˝›˚˛±˚˛ ΔZÓ¬ ¸˜¸…±ı˛ Œ˚ Œfl¬±Ú
¸˜±Ò±Ú v ˝À˘ ’±˜ı˛± ¬Û±˝◊ c x * £ b ' v ...................(12)
¤‡Ú ï10ó › ï12ó ŒÔÀfl¬ ’±˜ı˛± ¬Û±˝◊ b ' v ³ c x * = b ' v * º
¸≈Ó¬ı˛±— b ' v ³ b ' v * , ˚± ŒÔÀfl¬ ı˘± ˚±˚˛ Œ˚ v * ˝˘ ΔZÓ¬ ¸˜¸…±ı˛ ¤fl¬øÈ¬ ‰¬ı˛˜ ¸˜±Ò±Úº
[¤‡±ÀÚ b ' v ˝˘ øı¯∏˚˛±Rfl¬ ’À¬Ûé¬Àfl¬ı˛ (objective function) ’ı˜ ˜±Ú (minimum value)]º
¸≈Ó¬ı˛±— Î¬◊¬Û¬Û±…øÈ¬ √õ∂˜±øÌÓ¬ ˝˘º
16
NSOU
Î¬◊ ¬ Û¬Û±… 4 : ˚ø ˜≈‡… ¸˜¸…± ¤ı— ΔZÓ¬ ¸˜¸…±ı˛ Œ˚ Œfl¬±ÚøÈ¬ı˛ ¤fl¬øÈ¬ ¸¸œ˜ ‰¬ı˛˜ ¸˜±Ò±Ú
(finite optimal solution) Ô±Àfl¬ Ó¬Àı ’¬Ûı˛øÈ¬ı˛› ¤fl¬øÈ¬ ¸¸œ˜ ‰¬ı˛˜ ¸˜±Ò±Ú Ô±fl¬Àıº
[¤˝◊ Î¬◊¬Û¬Û±…øÈ¬Àfl¬ ΔZÓ¬Ó¬±ı˛ Œ˜Ã˘ Î¬◊ ¬ Û¬Û±… ı˘± ˝˚˛ (Fundamental Duality Theoren)]
¤˝◊ Î¬◊¬Û¬Û±…øÈ¬ øÚ•ßø˘ø‡Ó¬ˆ¬±Àı› øıı‘Ó¬ fl¬ı˛± ˚±˚˛†
ï1ó Ú— ˜≈‡… ¸˜¸…±ı˛ Œfl¬±Ú fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú ‰¬ı˛˜ ¸˜±Ò±Ú x * ¸˜¸…±øÈ¬ı˛ ‰¬ı˛˜ ¸˜±Ò±Ú ˝Àı ˚ø ¤ı—
Œfl¬ı˘˜±S ˚ø ï2ó Ú— ΔZÓ¬ ¸˜¸…±øÈ¬ı˛ ¤fl¬øÈ¬ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú v * ¬Û±›˚˛± ˚±˚˛ Œ˚‡±ÀÚ c x * = b ' v * º
√ õ ∂˜±Ì † ¤‡±ÀÚ ï1ó Ú— ¸˜¸…±øÈ¬ ˜≈‡… ¸˜¸…± ¤˝◊ ¸˜¸…±øÈ¬Àfl¬ Simplex ¬ÛX¬øÓ¬ÀÓ¬ ¸˜±Ò±Ú
fl¬ı˛±ı˛ ÊÚ… m ¸—‡…fl¬ Stack variable Œ˚±· fl¬ı˛ÀÓ¬ ˝Àıº
¤‡±ÀÚ ˘é¬Úœ˚˛ b = [b1 , b2 , .......... bm ] Œˆ¬flƒ¬È¬ı˛øÈ¬ı˛ Œé¬ÀS b1 , b2 , .......... bm ¸—‡…±&ø˘ı˛
√õ∂ÀÓ¬…Àfl¬ 0 Ú±› ˝ÀÓ¬ ¬Û±Àı˛º
m ¸—‡…fl¬ slack variable Œfl¬ x = [ xs , xs , ............. xs ] ô¶∏y¬ (column) Œˆ¬flƒ¬È¬ı˛ Z±ı˛±
1 2 m
√õ∂fl¬±˙ fl¬ı˛À˘, ï1ó Ú— ¸˜¸…±øÈ¬Àfl¬ ¤‡Ú Œ˘‡± ˚±˚˛º

‰¬ı˛˜ z = c x ,
˙Ó«¬¸±À¬ÛÀé¬ A x + I m x , = b ...................(13)
x ³ 0, xs ³ 0
Œ˚‡±ÀÚ Im ˝˘ m × m [À˜ı˛ ¤fl¬¸˜ ˜…±øÈ¬™' (unit matrix)º
¤‡Ú ˜ÀÚ fl¬ı˛± ˚±fl¬ Œ˚ ï1ó Ú— ˜≈‡… ¸˜¸…±øÈ¬ı˛ ¤fl¬øÈ¬ ¸¸œ˜ ‰¬ı˛˜ ¸˜±Ò±Ú ’±ÀÂº Ó¬±˝À˘ ï13ó
Ú— ¸˜¸…±øÈ¬ı˛ ¤fl¬øÈ¬ ‰¬ı˛˜ Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú (basic feasible solution) ¬Û±›˚˛± ˚±Àıº
Òı˛± ˚±fl¬ ï13ó Ú— ¸˜¸…±øÈ¬ı˛ ‰¬ı˛˜ Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±ÀÚı˛ Œ˜Ã˘ ‰¬˘&ø˘ı˛ (basic bariables)
Œˆ¬flƒ¬È¬ı˛øÈ¬ x B* = [ x B , x B ........ xb ] ¤ı— B › CB = (cB , cB ,........... cB ) ˝˘ ˚Ô±[À˜ ’Ú≈ı˛+¬Û
1 2 m 1 2 m
øˆ¬øM ˜…±øÈ¬™' (basis matrix) › øı¯∏˚˛±Rfl¬ ’À¬Ûé¬Àfl¬ ’Ú≈ı˛+¬Û Œ˜Ã˘ ‰¬˘·≈ø˘ı˛ ¸˝·Àı˛ ¸±øı˛
Œˆ¬flƒ¬È¬ı˛ (row vector)º
’±˜ı˛± Ê±øÚ x B* = CB B -1
¤‡Ú x B* ŒÔÀfl¬ ï13ó Ú— ¸˜¸…±ı˛ ¤fl¬øÈ¬ ‰¬ı˛˜ Œ˜Ã˘ ¸˜±Ò±Ú ¬Û±›˚˛± ˚±˚˛ ıÀ˘, ’±˜ı˛± ¬Û±˝◊
z j - c j ³ 0 j -¤ı˛ Œ˚ Œfl¬±Ú ·Ë˝ÌÀ˚±·… ˜±ÀÚı˛ ÊÚ…, Œ˚‡±ÀÚ
m
zj = åC
i =1
Bi yij
¤ı— [ y1 j , y2 j , ................. ymj ]
= B -1 ( A, I m )
Ó¬±˝À˘ ’±˜ı˛± ø˘‡ÀÓ¬ ¬Û±øı˛ CB B -1 ( A, I m ) ³ (c , 0) ..................(14)
¤‡Ú CB B -1 ¤˝◊ row ˜…±øÈ¬™'Àfl¬ v* Z±ı˛± øÚÀ«˙ fl¬ı˛± ˚±fl¬º
17
NSOU
Ó¬±˝À˘ ï14ó ŒÔÀfl¬ ’±˜ı˛± ¬Û±˝◊
v * A ³ c , v * ³ 0 ..................(15)
ı±, A' v * ³ c , v * ³ 0 ....................(16)
[¤‡±ÀÚ ï15ó ŒÓ 0 ¤fl¬øÈ¬ row ˜…±øÈ¬™' ¤ı— ï16ó ŒÓ¬ 0 ¤fl¬øÈ¬ column ˜…±øÈ¬™'º]
¤‡Ú ï16ó ŒÔÀfl¬ ı˘± ˚±˚˛ Œ˚ v * ï2ó Ú— ΔZÓ¬ ¸˜¸…±øÈ¬ı˛ ˙Ó«¬&ø˘ Œ˜ÀÚ ‰¬À˘ ¤ı— Ó¬±˝À˘
v * ˝˘ ï1ó Ú— ˜≈‡… ¸˜¸…±øÈ¬ı˛ ΔZÓ¬ ¸˜¸…±ı˛ ¤fl¬øÈ¬ fl¬±˚«fl¬ı˛ ¸˜±Ò±Úº
’±˜ı˛± √õ∂˜±Ì fl¬ı˛ı Œ˚ v * = (CB B -1 )', ï2ó Ú— ΔZÓ¬ ¸˜¸…±øÈ¬ı˛ ¤fl¬øÈ¬ ‰¬ı˛˜ ¸˜±Ò±Ú (optimal
solution)º
¤‡±ÀÚ ˜≈‡… ¸˜¸…±øÈ¬ı˛ øı¯∏˚˛±Rfl¬ ’À¬Ûé¬Àfl¬ı˛ (objective function) ‰¬ı˛˜ ˜±Ú (maximum
value) ˝Àı (z) ‰¬ı˛˜ = cB x *B
= CB B -1 b , [3 x * B = CB , B -1 ]
= (v * )' b
= ( v * b )' = b , v *
[ v * b ¤fl¬øÈ¬ 1×1 [À˜ı˛ ˜…±øÈ¬™' ˝›˚˛±ı˛ ÊÚ… v * b = (v * ' b )' ]
¤‡Ú Î¬◊¬ÛÀı˛ı˛ ¸˜±Ò±Ú ≈øÈ¬ı˛ ï¤fl¬øÈ¬ ˜≈‡… ¸˜¸…±ı˛ › ’¬Ûı˛øÈ¬ ΔZÓ¬ ¸˜¸…±ı˛ó Œé¬ÀS ˜≈‡… ¸˜¸…±
› ΔZÓ¬ ¸˜¸…±ı˛ øı¯∏˚˛±Rfl¬ ’À¬Ûé¬fl¬Àı˛ ˜±Ú ¸˜±Ú ˝›˚˛±ı˛ ÊÚ…, Î¬◊ ¬ Û¬Û±… 3 ŒÔÀfl¬ ’±˜ı˛± ı˘ÀÓ¬
¬Û±øı˛ Œ˚, v * = (CB B -1 )' ΔZÓ¬ ¸˜¸…±øÈ¬ı˛ ¤fl¬øÈ¬ ‰¬ı˛˜ ¸˜±Ò±Ú ˝Àıº
¤‡Ú ’Ú≈ı˛+¬Ûˆ¬±Àı ï2ó Ú— ΔZÓ¬ ¸˜¸…±øÈ¬ı˛ ¤fl¬øÈ¬ ‰¬ı˛˜ ¸˜±Ò±Ú v * ’±ÀÂ ÒÀı˛ øÚÀ˘ ’±˜ı˛±
√õ∂˜±Ì fl¬ı˛ÀÓ¬ ¬Û±øı˛ Œ˚ ï1ó Ú— ˜≈‡… ¸˜¸…±øÈ¬ı˛ ¤fl¬øÈ¬ ‰¬ı˛˜ ¸˜±Ò±Ú ¬Û±›˚˛± ˚±Àı ¤ı— (z) ‰¬ı˛˜ = (w)’ı˜º
’Ú≈ø¸g¬±ôL√ † Œfl¬±Ú Δı˛ø‡fl¬ Œ√õ∂±·Ë±˜øıøÒ ¸˜¸…±ı˛ ¸¸œ˜ ‰¬ı˛˜ ¸˜±Ò±Ú ¬Û±›˚˛± ˚±Àı ¤ı— Œfl¬ı˘˜±S
˚ø ˜≈‡… ¸˜¸…± › ΔZÓ¬ ¸˜¸…±ı˛ Î¬◊ˆ¬À˚˛ı˛˝◊ ’ôL√Ó¬ ¤fl¬øÈ¬ fl¬Àı˛ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú ¬Û±›˚˛± ˚±˚˛º
√ õ ∂˜±Ì † øÚÀÊ fl¬èÚº
˜ôL√ ı … † Simplex ¬ÛX¬øÓ¬ÀÓ¬ ˜≈‡… Δı˛ø‡fl¬ Œ√õ∂±·Ë±øıøÒ ¸˜¸…±ı˛ ‰¬ı˛˜ ¸˜±Ò±Ú øÚÌ«˚˛ fl¬ı˛À˘, Î¬◊¬Û¬Û±…
ï4ó ŒÔÀfl¬ ’±˜ı± ΔZÓ¬ ¸˜¸…±øÈ¬ı˛ ‰¬ı˛˜ ¸˜±Ò±Ú øÚÌ«˚˛ fl¬ı˛±ı˛ øÚÀ‰¬ı˛ ¬ÛX¬øÓ¬øÈ¬ ¬Û±˝◊ †
˚ø ˜≈‡ ¸˜¸…±øÈ¬Àfl¬ ‰¬ı˛˜ ¸˜¸…± (maximization problem) ı˛+À¬Û ¤ı— ëëíí ’±fl¬±Àı˛ı˛ ˙Ó«
z j - c j ¤ı˛ ˜±Ú&ø˘ ŒÔÀfl¬ ΔZÓ¬ ¸˜¸…±ı˛ ‰¬ı˛˜ ¸˜±Ò±Ú ¬Û±›˚˛± ˚±Àıº
’Ú≈ı˛+¬Ûˆ¬±Àı ı˘± ˚±˚˛ Œ˚ ˜≈‡… ¸˜¸…±øÈ¬ ’ı˜ ˜±Ú øÚÌ«˚˛ ¸—[±ôL√ (minimization problem)
¸˜¸…±ı˛+À¬Û ¤ı— ëëíí ’±fl¬±Àı˛ı˛ ˙Ó«¬¸±À¬ÛÀé¬ ¸˜±Ò±Ú fl¬ı˛± ˝˚˛, Ó¬±˝À˘ ‰¬ı˛˜ ¸˜±Ò±Ú øÚÌ«À˚˛ı˛ simplex
table ŒÔÀfl¬ surplus ‰¬˘Àı˛ øÚÀ‰¬ ¤ı˛ ˜±Ú&ø˘ı˛ ø‰¬˝ê ¬Ûøı˛ıÓ«¬Ú fl¬Àı˛ ΔZÓ¬ ¸˜¸…±ı˛ ‰¬ı˛˜ ¸˜±Ò±Ú
¬Û±›˚˛± ˚±Àıº
18
NSOU
Î¬◊ ¬ Û¬Û±… 5 † ˚ø ˜≈‡… ¸˜¸…±øÈ¬ı˛ øı¯∏˚˛±Rfl¬ ’À¬Ûé¬Àfl¬ı˛ (objective function) ˜±Ú ’ı±Ò
(unbounded) ˝˚˛ Ó¬Àı ΔZÓ¬ ¸˜¸…±ı˛ Œfl¬±Ú fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú Ô±fl¬Àı Ú±º
√õ∂˜±Ì † ˜ÀÚ fl¬ı˛± ˚±fl¬ ï1ó Ú— ˜≈‡… ¸˜¸…±øÈ¬ı˛ øı¯∏˚˛±Rfl¬ ’À¬Ûé¬fl¬ ’ı±Ò (unbounded)º ˚ø ¸y¬ı
˝˚˛, Òı˛± ˚±fl¬ ï2ó Ú— ΔZÓ¬ ¸˜¸…±ı˛ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú (feasible soulution) ’±ÀÂº ¤˜Ú ˜≈‡… ¸˜¸…± ›
ΔZÓ¬ ¸˜¸…± Î¬◊ˆ¬À˚˛ı˛˝◊ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú Ô±fl¬±˚˛, Î¬◊¬Û¬Û±… 4 ¤ı˛ ’Ú≈ø¸X«¬±ôL√ ŒÔÀfl¬ ı˘± ˚±˚˛ Œ˚ ˜≈‡… ¸˜¸…±
¤ı— ΔZÓ¬ ¸˜¸…± Î¬◊ˆ¬À˚˛ı˛˝◊ ‰¬ı˛˜ ¸˜±Ò±Ú (optimal solution) Ô±fl¬Àıñ˚± ¤‡±ÀÚ ’¸y¬ı fl¬±ı˛Ì ˜≈‡…
¸˜¸…±øÈ¬ı˛ øı¯∏˚˛±Rfl¬ ’À¬Ûé¬fl¬ ’ı±Ò ’Ô«±» ˝◊˝±ı˛ ¸¸œ˜ ‰¬ı˛˜ ¸˜±Ò±Ú ŒÚ˝◊º ¸≈Ó¬ı˛±— √õ∂˜±øÌÓ¬ ˝˘ Œ˚
ΔZÓ¬ ¸˜¸…±ı˛ Œfl¬±Ú fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú Ô±fl¬Àı Ú± ˚ø ˜≈‡… ¸˜¸…±øÈ¬ı˛ øı¯∏˚˛±Rfl¬ ’À¬Ûé¬fl¬ ’ı±Ò ˝˚˛º
Î¬◊¬Û¬Û±… 6 † ˚ø ΔZÓ¬ ¸˜¸…±ı˛ Œfl¬±Ú fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú Ú± Ô±Àfl¬ ¤ı— ˜≈‡… ¸˜¸…±ı˛ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú
Ô±Àfl¬, Ó¬Àı ˜≈‡… ¸˜¸…±ı˛ øı¯∏˚˛±Rfl¬ ’À¬Ûé¬fl¬ (objective function) ’ı±Ò (un bounded) ˝Àıº
√ õ ∂˜±Ì † øÚÀÊ fl¬èÚº
10.5 ΔZÓ¬Ó¬±¬ Simplex ¤ı— ¬ÛX¬øÓ

’±˜ı˛± ˘é¬… fl¬Àı˛øÂ Œ˚ ΔZÓ¬Ó¬±ı˛ Œ˜Ã˘ Î¬◊¬Û¬Û±À…ı˛ ¸±˝±À˚… ˜≈‡… ¸˜¸…±ı˛ ïı± ΔZÓ¬ ¸˜¸…±ı˛ó
‰¬ı˛˜ ¸˜±Ò±Ú ï˚ø ¬Û±›˚˛± ˚±˚˛ó simplex ¬ÛX¬øÓ¬ÀÓ¬ øÚÌ«˚˛ fl¬ı˛À˘ ¤fl¬˝◊ ¸À/ ΔZÓ¬ ¸˜¸…±ı˛ ïı±
˜≈‡ ¸˜¸…±ı˛ó ‰¬ı˛˜ ¸˜±Ò±Ú øÚÌ«˚˛ fl¬ı˛± ˚±˚˛º √¤˝◊ √õ∂¸À/ ’±˜ı˛± øÚÀ‰¬ øÓ¬ÚøÈ¬ Î¬◊¬ÛÀ˚±·œ øÚ˚˛˜
Î¬◊À{°‡ fl¬ı˛ıñ
√ õ ∂Ô˜ øÚ˚˛ ˜ † Î¬◊¬Û¬Û±… ï4ó ¤ı˛ ’Ú≈ø¸X¬±ÀôL√ı˛ øÚÀ‰¬ ˜ôL√Àı…ı˛ ˜ÀÒ… ¤˝◊ øÚ˚˛˜øÈ¬ ¬Û”Àı«˝◊
ı˘± ˝À˚˛ÀÂº
øZÓ¬œ˚˛ øÚ˚˛ ˜ † ˚ø ˜≈‡… ¸˜¸…±ı˛ ïı± ΔZÓ¬ ¸˜¸…±ı˛ó Œfl¬±Ú ‰¬˘ ΔZÓ¬ ¸˜¸…±ı˛ ïı± ˜≈‡…
¸˜¸…±ı˛ó Œfl¬±Ú artificial ‰¬À˘ı˛ ¸À/ ¸•Ûøfl«¬Ó¬ (related) ˝˚˛ Ó¬±˝À˘ ΔZÓ¬ ¸˜¸…±ı˛ ï˜≈‡…
¸˜¸…±ı˛ó ‰¬ı˛˜ ¸˜±Ò±Ú øÚÌ«À˚˛ı˛ Simplex Table ¤ı˛ ‘‘net evaluation’’ ¸±øı˛ı˛ ’Ú≈ı˛+¬Û arti-
ficial ‰¬˘ ¤ı˛ øÚÀ‰¬ı˛ ¸—‡…±øÈ¬ÀÓ¬ penalty cost M ¤ı˛ ˜±Ú ˙”Ú… ÒÀı˛ ‰¬ı˛˜ ¸˜±Ò±ÀÚ ’Ú≈ı˛+¬Û ˜≈‡…
‰¬À˘ı˛ ïΔZÓ¬ ‰¬À˘ı˛ó ˜±Ú ¬Û±›˚˛± ˚±Àıñ¤˝◊ øÚ˚˛˜øÈ¬ı˛ √õ∂˜±Ì ¤‡±ÀÚ Œ›˚˛± ˝Àı Ú±º
ï 10.6ó ’Ú≈ À BÂÀı˛ Î¬◊  ±˝ı˛ Ì ŒÔÀfl¬ øÚ˚˛ ˜ øÈ¬ ¶Û©Ü ˝Àıº
Ó‘ ¬ Ó¬œ˚˛ øÚ˚˛ ˜ † ˚ø ˜≈‡… ¸˜¸…±ı˛ ı± ΔZÓ¬ ¸˜¸…±ı˛ Œfl¬±Ú ¤fl¬øÈ¬ı˛ øı¯∏˚˛±Rfl¬ ’À¬Ûé¬Àfl¬ı˛ ˜±Ú
’ı±Ò (unbounded) ˝˚˛ Ó¬Àı ’Ú…øÈ¬ı˛ Œfl¬±Ú fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú Ô±fl¬Àı Ú±º Î¬◊¬Û¬Û±… ï5ó ¤ı—
Î¬◊¬Û¬Û±… ï6ó ŒÔÀfl¬ ¤˝◊ øÚ˚˛˜øÈ¬ı˛ ’±˜ı˛± √õ∂˜±Ì ¬Û±˝◊º
˜ôL√ ı … † ΔZÓ¬Ó¬±ı˛ ¸±˝±˚… øÚÀ˘ ’ÀÚfl¬ Δı˛ø‡fl¬ Œ√õ∂±·Ë±˜øıøÒ ¸˜¸…±ı˛ (L.P.P.) ¸˜±Ò±Ú fl¬ı˛± ¸˝
˝˚˛º Œ˚˜Ú Œfl¬±Ú L.P.P.-ŒÓ¬, ˚ø ˙ÀÓ«¬ı˛ ¸—‡…± ‰¬À˘ı˛ ¸—‡…± ’À¬Ûé¬± Œıø˙ ˝˚˛ Ó¬±˝À˘ Œ¸Àé¬ÀS
ΔZÓ¬ ¸˜¸…±øÈ¬ ï˚±ı˛ ˙ÀÓ«¬ı˛ ¸—‡…± ˜≈‡… ¸˜¸…±ı˛ ‰¬À˘ı˛ ¸—‡…± ¸˜±Úó ¸˜±Ò±Ú fl¬Àı˛ ˜≈‡… ¸˜¸…±øÈ¬ı˛
¸˜±Ò±Ú øÚÌ«˚˛ ’ÀÚfl¬ ¸˝Ê ˝Àıº
19
NSOU
10.6 Î¬◊  ±˝ı˛ Ì
1. ΔZÓ¬Ó¬±ı˛ ¸±˝±À˚… øÚÀ‰¬ı˛ Δı˛ø‡fl¬ Œ√õ∂±·Ë±˜øıøÒ (L.P.P.) ¸˜¸…±øÈ¬ı˛ ‰¬ı˛˜ ¸˜±Ò±Ú ï˚ø ¬Û±›˚˛±
˚±˚˛ó øÚÌ«˚˛ fl¬èÚ †
‰¬ı˛˜ z = 3x1 + 2 x2 ,
˙Ó«¬¸±À¬ÛÀé¬ x1 + x2 £ 1,
x1 + x2 £ 7,
x1 + 2 x2 £ 10,
x2 £ 3
x1 , x2 ³ 0 º
¸˜±Ò±Ú † ¤‡±ÀÚ ˜”˘… ¸˜¸…±ı˛ ˙ÀÓ«¬ı˛ ¸—‡…± 4 ¤ı— ‰¬À˘ı˛ ¸—‡…± 2º
√õ∂M ˜≈‡… ¸˜¸…±øÈ¬Àfl¬ Œ˘‡± ˚±˚˛,
‰¬ı˛˜ z = 3x1 + 2 x2 ,
˙Ó«¬¸±À¬ÛÀé¬ x1 - x2 £ -1
x1 - x2 £ 7,
x1 - 2 x2 £ 10,
x2 £ 3
x1 , x2 ³ 0 º
Ó¬±˝À˘ √õ∂M ˜≈‡… ¸˜¸…±ı˛ ΔZÓ¬ ¸˜¸…± ˝Àı,
’ı˜ w = -v1 + 7v2 + 10v3 + 3v4
˙Ó«¬¸±À¬ÛÀé¬ v1 + v2 + v3 + 0v4 £ 3
-v1 + v2 + 2v3 + 0v4 £ 3
v1 , v2 , v3 , v4 £ 0
¤‡Ú Î¬◊¬ÛÀı˛ı˛ ΔZÓ¬ ¸˜¸…±øÈ¬ øÚÀ‰¬ı˛ ’±fl¬±Àı˛ (standard form) √õ∂fl¬±˙ fl¬ı˛± ˚±˚˛,
‰¬ı˛˜ w1 = v1 - 7v2 - 10v3 - 3v4 + 0v5 + 0v6 ,
Œ˚‡±ÀÚ -v1 + v2 + v3 + v4 - v5 = 3, ................(1)
-v1 + v2 + 2v3 + v4 - v6 = 2,
¤ı— Œ˚‡±ÀÚ v6 › v6 ˝˘ ‰¬˘º
¤‡Ú (1) Ú— ¸˜¸…±ı˛ ¸˝· ˜…±øÈ¬™'øÈ¬ ˝˘
LM-1 1 1 0 - 1 0OP
N-1 1 2 1 0 - 1Q
F 0I º
Œ˚‡±ÀÚ ¤fl¬øÈ¬ ô¶∏y¬ Œˆ¬flƒ¬È¬ı˛ H 1K
20
NSOU
F 1I
¸≈Ó¬ı˛±— √õ∂±Ôø˜fl¬ øˆ¬øM (basis) ˜…±øÈ¬™À' øZÓ¬œ˚˛ øˆ¬øM Œˆ¬flƒ¬È¬ı˛ H 0K ¬Û±›˚˛±ı˛ ÊÚ… ‰¬˘
¬Û±›˚˛±ı˛ ÊÚ… v7 ¤ı˛ ¸±˝±À˚…, ï1ó Ú— ΔZÓ¬ ¸˜¸…±øÈ¬ øÚÀ‰¬ı˛ modified ’±fl¬±Àı˛ Œ˘‡± ˚±˚˛º
‰¬ı˛˜ w2 = v1 – 7v2 – 10v3 – 3v4 + 0v5 + 0v6 – Mv7,
˙Ó«¬¸±À¬ÛÀé¬ – v1 + v2 + 0v4 – v5 + v7 = 3
v1 + v2 + 2v3 + v4 + 0v5 – v6 + 0v7 = 2
v1, v2, v3, v5, v6, v7 = 0
¤ı— M (>0) ¤fl¬øÈ¬ ¸—‡…± ˚± Œ˚ Œfl¬±Ú √õ∂±l ¸—‡…±ı˛ Œ‰¬À˚˛ ıh¬ Òı˛± ˝Àıº
¤‡Ú Simplex ¬ÛX¬øÓ¬ÀÓ¬ ¸˜±Ò±Ú fl¬ı˛ÀÓ¬ ø·À˚˛ øÚÀ‰¬ı˛ ¸±ı˛Ìœ&ø˘ ¬Û±›˚˛± ˚±˚˛ ï√õ∂Ó¬œfl¬&ø˘ √õ∂‰¬ø˘Ó¬
’ÀÔ« ı…ı˝±ı˛ fl¬ı˛± ˝À˚˛ÀÂóº
Œ˙¯∏ ¸±ı˛ÌœÀÓ¬ Œ˜Ã˘ ‰¬˘Àı˛ ˜ÀÒ… artificial ‰¬˘ Ú±˝◊ ¤ı— j-¤ı˛ ¸fl¬˘ ˜±ÀÚı˛ ÊÚ… zj – cj 0º
¸≈Ó¬ı˛±— Œ˙¯∏ ¸±ı˛Ìœ ŒÔÀfl¬ ΔZÓ¬ ¸˜¸…±ı˛ ‰¬ı˛˜ ¸˜±Ò±Ú (optimal solution) ¬Û±›˚˛± ˚±Àıº Œ‡± ˚±ÀBÂ
ΔZÓ¬ ¸˜¸…±ı˛ ‰¬ı˛˜ ¸˜±Ò±Ú ˝˘ v1 = 0, v2 = 3, v3 = 0, v4 = 0 Œ˚‡±ÀÚ (w) ’ı˜ = 21º ’±ı±ı˛ Œ˙¯∏
¸±ı˛Ìœı˛ zj – cj ¤ı˛ ¸±øı˛ÀÓ¬ surplus ‰¬˘ v5 › v6¤ı˛ ô¶∏Ày¬ı˛ øÚÀ‰¬ı˛ ¸—‡…±&ø˘ ˚Ô±[À˜ 7, 0º
¸≈Ó¬ı˛±— ˜≈‡… ¸˜¸…±ı˛ ‰¬ı˛˜ ¸˜±Ò±Ú x1 =7, x2 = 0 Œ˚‡±ÀÚ (z) ‰¬ı˛˜ = 21 º
2. øÚÀ‰¬ı˛ ˜≈‡… ¸˜¸…±øÈ¬ ¸˜±Ò±ÀÚı˛ Simplex ¸±ı˛Ìœ ŒÔÀfl¬ ˝◊˝±ı˛ ΔZÓ¬ ¸˜¸…±øÈ¬ı˛ ‰¬ı˛˜ ¸˜±Ò±Ú
ï˚ø ¬Û±›˚˛± ˚±˚˛ó øÚÌ«˚˛ fl¬èÚ †
‰¬ı˛˜¬ z = 5x1 + 12x2 + 4x3,
˙Ó«¬¸±À¬ÛÀé x1 + 2x2 + x3 5,
2x1 – x2 + 3x3 = 2,
x1, x2, x3, 0º
21
NSOU
¸˜±Ò±Ú † ¤‡±ÀÚ ΔZÓ¬ ¸˜¸…±˚˛ ≈øÈ¬ ‰¬˘ v1, v2 Ô±fl¬Àı Œ˚‡±ÀÚ v2 ‰¬˘øÈ¬ ˝Àı ø‰¬˝ê ¸±À¬ÛÀé¬
’ı±Ò (unrestricted in sign), fl¬±ı˛Ì ˜≈‡… ¸˜¸…±˚˛ ≈øÈ¬ ˙Ó«¬ ’±ÀÂ ¤ı— Œ˚‡±ÀÚ øZÓ¬œ˚˛ ˙Ó«¬øÈ¬
¸˜œfl¬ı˛Ì ’±fl¬±Àı˛ ’±ÀÂº
¤‡Ú slack ‰¬˘ x4 ¤ı— artificial ‰¬˘ x5 ı…ı˝±ı˛ fl¬Àı˛ ˜≈‡… ¸˜¸…±øÈ¬ı˛ øÚÀ‰¬ı˛ modified
’±fl¬±ı˛øÈ¬ ¬Û±›˚˛± ˚±˚˛º
‰¬ı˛˜ z1 = 5x1 + 12x2 + 4x3 + 0x4 – Mx5,
˙Ó«¬¸±À¬ÛÀé x1 + 2x2 + x3 + x4 – 5
2x1 + x2 + 3x3 + 0x4 – x5 = 2,
x1, x2, x3, x4, x5 0
¤ı— M (>0) ¤fl¬øÈ¬ ¸—‡…± ˚± Œ˚ Œfl¬±Ú √õ∂±l ¸—‡…±ı˛ ŒÔÀfl¬ ıh¬ Òı˛± ˝Àıº
¤‡Ú Simplex ¬ÛX¬øÓ¬ÀÓ¬ ¸˜±Ò±Ú fl¬ı˛ÀÓ¬ ø·À˚˛ øÚÀ‰¬ı˛ ¸±ı˛Ìœ&ø˘ ¬Û±›˚˛± ˚±˚˛ ï√õ∂Ó¬œfl¬&ø˘ √õ∂‰¬ø˘Ó¬
’ÀÔ« ı…ı˝±ı˛ fl¬ı˛± ˝À˚˛ÀÂóº
Œ˙¯∏ ¸±ı˛ÌœÀÓ¬ Œ˜Ã˘ ‰¬˘Àı˛ ˜ÀÒ… artificial ‰¬˘ Ú±˝◊ ¤ı— j ¤ı˛ ¸fl¬˘˜±ÀÚı˛ ÊÚ… zj – cj 0º
¸≈Ó¬ı˛±— Œ˙¯∏ ¸±ı˛Ìœ ŒÔÀfl¬ ˜≈‡… ¸˜¸…±ı˛ ‰¬ı˛˜ ¸˜±Ò±Ú (optimal solution) ¬Û±›˚˛± ˚±Àıº
22
NSOU
9 8
Œ‡± ˚±ÀBÂ ˜≈‡… ¸˜¸…±ı˛ ‰¬ı˛˜ ¸˜±Ò±Ú ˝˘ x1 = , x2 = , x3 = 0
5 5
Œ˚‡±ÀÚ (z) ’ı˜ = 28 81

’±ı±ı˛ Œ˙¯∏ ¸±ı˛Ìœı˛ zj – cj ¤ı˛ ¸±øı˛ÀÓ¬ slack ‰¬˘ x4 ¤ı— artificial ‰¬˘ ¤ı˛ ô¶∏Ày¬ı˛ øÚÀ‰¬ı˛
29 2
¸—‡…±&ø˘ ˚Ô±[À˜ ,M- º
5 5
29 2
¤‡Ú M = 0 ÒÀı˛, ΔZÓ¬ ¸˜¸…±ı˛ ‰¬ı˛˜ ¸˜±Ò±Ú ˝Àı v1 = ,v = -
5 2 5
¤ı— (w) ’ı˜ (z) ‰¬ı˛˜ = 28 81
2
¤‡±ÀÚ ˘é¬Ìœ˚˛ Œ˚ v1 ø‰¬˝ê ¸±À¬ÛÀé¬ ’ı±Ò (unrestricted in sign) ¤ı— v1 -
5
<0º
29 2
¸≈Ó¬ı˛±— ΔZÓ¬ ¸˜¸…±ı˛ ‰¬ı˛˜ ¸˜±Ò±Ú ˝˘ v1 = , v1 = -
5 5
Œ˚‡±ÀÚ (w) ’ı˜ = (5v1 + 2v2)’ı˜
141 1
= = 28 º
5 5
3. ΔZÓ¬Ó¬±ı˛ ¸±˝±À˚… Œ‡±Ú Œ˚ øÚÀ‰¬ı˛ Δı˛ø‡fl¬ Œ√õ∂±·Ë±˜øıøÒ ¸˜¸…±ı˛ Œfl¬±Ú fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú ŒÚ˝◊º
’ı˜ z = x 1 – x 2,
˙Ó«¬¸±À¬ÛÀé¬ 2x1 + x2 2,
x1 + x2 1,
x1 , x 2 0
¸˜±Ò±Ú † √õ∂M ¸˜¸…±øÈ¬Àfl¬ Œ˘‡± ˚±˚˛
’ı˜ z = x 1 – x 2,
˙Ó«¬¸±À¬ÛÀé¬ 2x1 + 2x2 2
– x1 – x2 1,
x1 , x 2 0
¤˝◊ ˜≈‡… ¸˜¸…±ı˛ ΔZÓ¬ ¸˜¸…±øÈ¬ ˝Àı
‰¬ı˛˜ w = 2v1 – v2,
˙Ó«¬¸±À¬ÛÀé¬ 2v1 – v2 1,
v1 – v2 – 1,
v1 0, v2 0
¤‡Ú ΔZÓ¬ ¸˜¸…±øÈ¬Àfl¬ øÚÀ‰¬ı˛ Δı˛ø‡fl¬ Œ√õ∂±·Ë±˜øıøÒ ¸˜¸…±ı˛+À¬Û √õ∂fl¬±˙ fl¬ı˛± ˚±˚˛ †
‰¬ı˛˜ w = 2v1 – v2
˙Ó«¬¸±À¬ÛÀé 2v1 – v2 1
– v1 – v2 – 1,
v1, v2 0
23
NSOU
¤˝◊ ¸˜¸…±øÈ¬ı˛ ¸˜Ó≈¬˘… (equivalent) ’±fl¬±ı˛ ˝˘
‰¬ı˛˜ w = 2v1 + v2 + 0v3 + 0v4
˙Ó«¬¸±À¬ÛÀé¬ 2v1 – v2 + v3 = 1
– v1 + v2 – v4 = 1
v1, v2, v3 , v4 0, Œ˚‡±ÀÚ v3 slack ‰¬˘ ¤ı— v4 surplus ‰¬˘º
¤‡Ú artifical ‰¬˘ v5 ı…ı˝±ı˛ fl¬Àı˛ ’±˜ı˛± ΔZÓ¬ ¸˜¸…±øÈ¬ı˛ øÚÀ‰¬ı˛ modified ’±fl¬±ı˛øÈ¬ ¬Û±˝◊º
‰¬ı˛˜ w = 2v1 + v2 + 0v3 + 0v4 – Mv5,
˙Ó«¬¸±À¬ÛÀé¬ 2v1 – v2 + v3 = 1
– v1 + v2 – v4 + v5 = 1,
– v1, v2, v4, v5 0, Œ˚‡±ÀÚ M(>0) ¤fl¬øÈ¬ ˚± Œ˚ Œfl¬±Ú √õ∂±l ¸—‡…±ı˛ ŒÔÀfl¬ ıh¬
Òı˛± ˝Àıº
¤‡Ú Simplex ¬ÛX¬øÓ¬ÀÓ¬ ¸˜±Ò±Ú fl¬ı˛ÀÓ¬ ø·À˚˛ øÚÀ‰¬ı˛ ¸±ı˛Ìœ&ø˘ ¬Û±›˚˛± ˚±˚˛ ï√õ∂Ó¬œfl¬&ø˘
√õ∂‰¬ø˘Ó¬ ’ÀÔ« ı…ı˝±ı˛ fl¬ı˛± ˝À˚˛ÀÂóº
¤‡±ÀÚ Œ‡± ˚±ÀBÂ Œ˚ Œ˙¯∏ ¸±ı˛ÌœÀÓ¬ zj – cj ¤ı˛ Ÿ¬Ì±Rfl¬ ˜±Ú ï˚±ı˛ ¬Ûı˛˜ ˜±Ú ¸ıÀ‰¬À˚˛
Œı˙œó ˝˘ – 4 ¤ı— ¤˝◊ ˜±ÚøÈ¬ a4 ¤ı˛ øÚÀ‰¬º øfl¬c√ y14 = – 1 < 0, y24 = – 2 < 0 ’Ô«±» ¤˝◊
ô¶∏Ày¬ı˛ Œfl¬±Ú ¬Û ÒÚ±Rfl¬ Ú˚˛º
¸≈Ó¬ı˛±— ΔZÓ¬ ¸˜¸…±øÈ¬ı˛ øı¯∏˚˛±Rfl¬ ’À¬Ûé¬fl¬ ’ı±Ò (un bounded) ˝Àıº Ó¬±˝À˘ √õ∂M ˜≈‡…
¸˜¸…±øÈ¬ı˛ Œfl¬±Ú fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú Ú±˝◊º
24
NSOU
10.7 ¸±ı˛ ± —˙
√õ∂ÔÀ˜, ‰¬ı˛˜ z = c x , ˙Ó«¬¸±À¬ÛÀé A x £ b , x ³ 0 ’±fl¬±Àı˛ı˛ Δı˛ø‡fl¬ Œ√õ∂±·Ë±˜øıøÒ ¸˜¸…±ı˛
ï˜≈‡… ¸˜¸…±ó ΔZÓ¬ ¸˜¸…±ı˛ ¸—:± Œ›˚˛± ˝À˚˛ÀÂº ¤ı˛ ¬Ûı˛ Œ˚ Œfl¬±Ú ’±fl¬±Àı˛ı˛ ˜≈‡… ¸˜¸…±ı˛ ï‰¬ı˛˜
˜±Ú ı± ’ı˜ ˜±Ú øÚÌ«˚˛ ¸—[±ôL√ ˙Ó«¬&ø˘ ‘‘’’ ‘‘’’ ‘‘=’’Œ˚ Œfl¬±Ú ’±fl¬±Àı˛ı˛ Ô±fl¬ ¤ı— ¤fl¬ ı±
¤fl¬±øÒfl¬ ‰¬˘ ’ı±Ò Ô±fl¬À˘›ó ΔZÓ¬ ¸˜¸…± øÚÌ«˚˛ fl¬ı˛±ı˛ ¬ÛX¬øÓ¬ ı˘± ˝À˚˛ÀÂº ¤‡±ÀÚ ˘é¬… fl¬ı˛± Œ·ÀÂ
(i) ˜≈ ‡ … ¸˜¸…±ı˛ ˙ÀÓ« ¬ ı˛ ¸—‡…± = ΔZÓ¬ ¸˜¸…±ı˛ ‰¬À˘ı˛ ¸—‡…± ¤ı— ˜≈ ‡ … ¸˜¸…±ı˛ ‰¬À˘ı˛ ¸—‡…±
= ΔZ ¸˜¸…±ı˛ ˙ÀÓ¬« ı ˛ ¸—‡…± ¸—‡…±º (ii) ˜≈‡… ¸˜¸…±ı˛ Œfl¬±Ú ‰¬˘ ø‰¬˝ê ¸±À¬ÛÀé¬ ’ı±Ò ˝À˘, ΔZÓ¬
¸˜¸…±ı˛ ’Ú≈ı˛+¬Û ˙Ó«¬øÈ¬ ‘‘=’’ ’±fl¬±Àı˛ ˝Àı ¤ı— ˜≈‡… ¸˜¸…±ı˛ Œfl¬±Ú ˙Ó«¬ ‘‘=’’ ’±fl¬±Àı˛ı˛ ˝À˘, ΔZÓ¬
¸˜¸…±ı˛ ’Ú≈ı˛+¬Û ‰¬˘øÈ¬ ø‰¬˝ê ¸±À¬ÛÀé¬ ˝Àıº
¸ı«À˙À¯∏ ΔZÓ¬Ó¬± (Duality) ¸—[±ôL√ &èQ¬Û”Ì« Î¬◊¬Û¬Û±…&ø˘ ŒÔÀfl¬ øÚÀ‰¬ı˛ øı¯∏˚˛&ø˘ Ê±Ú± Œ·ÀÂ †
ïfl¬ó Simplex ¬ÛX¬øÓ¬ÀÓ¬ ˜≈‡… ¸˜¸…± ¤ı— ΔZÓ¬ ¸˜¸…± Î¬◊ ˆ ¬À˚˛ ı ˛ ˝ ◊ ¤fl¬˝◊ ¸±ı˛ Ì œ ŒÔÀfl¬ ‰¬ı˛ ˜
¸˜±Ò±Ú ï˚ø ¤ı˛ ’øô¶∏Q Ô±Àfl¬ó øÚÌ« ˚ ˛ fl¬ı˛ ± ˚±˚˛ º
ï‡ó ˜≈‡… ¸˜ › ΔZÓ¬ ¸˜¸…± Î¬◊ˆ¬À˚˛ı˛ øı¯∏˚˛±R ’À¬Ûé¬Àfl¬ı˛ ‰¬ı˛˜ ˜±Ú (optimal value) ¤fl¬˝◊
˝Àı [˚‡Ú ‰¬ı˛˜ ¸˜±Ò±Ú ¬Û±›˚˛± ˚±˚˛]º
ï·ó ˚ø ˜≈‡… ¸˜¸…±ı˛ øı¯∏˚˛±Rfl¬ ’À¬Ûé¬Àfl¬ı˛ ˜±Ú ’ı±Ò (un bounded) ˝˚˛ Ó¬Àı ΔZÓ¬
¸˜¸…±ı˛ Œfl¬±Ú fl¬±˚« fl ¬ı˛ ¸˜±Ò±Ú (feasible solution) Ô±fl¬Àı Ú± ¤ı— ΔZÓ¬ ¸˜¸…±ı˛ øı¯∏ ˚ ˛ ± Rfl¬
’À¬Ûé¬Àfl¬ı˛ ˜±Ú ’ı±Ò ˝À˘, ˜≈ ‡ … ¸˜¸…±ı˛ Œfl¬±Ú fl¬±˚« fl ¬ı˛ ¸˜±Ò±Ú Ô±fl¬Àı Ú±º
10.8 ’Ú≈ ˙ œ˘Úœ

øÚÀ‰¬ı˛ √õ∂ÀÓ¬…fl¬øÈ¬ (1–5) Δı˛ø‡fl¬ Œ√õ∂±·Ë±˜øıøÒ ¸˜¸…±ı˛ ΔZÓ¬ ¸˜¸…±øÈ¬ øÚÌ«˚˛ fl¬èÚ †
1. ‰¬ı˛˜¬ z = 3x1 + 4x2,
˙Ó«¬¸±À¬ÛÀé x1 + x2 12,
2x1 + 3x2 21
x1 8
x2 6,
x1 , x 2 0 º
2. ’ı˜¬ z = 3x1 + x2,
˙Ó«¬¸±À¬ÛÀé 2x1 + 3x2 2,
x1 + x2 1,
x1 , x2 0 º
25
NSOU
3. ‰¬ı˛˜¬ z = 2x1 + 3x2 + 4x3,
˙Ó«¬¸±À¬ÛÀé x1 + 5x2 + 3x3 = 7,
2x1 – 5x2 3,
3x1 – x3 5,
x1 , x2 0
¤ı— x3 ’ı±Ò (unrestricted in sign)º
4. ‰¬ı˛˜¬ z = 2x1 – 6x2,
˙Ó«¬¸±À¬ÛÀé x1 – 3x2 6,
2x1 – 4x2 8,
x1 – 3x3 – 6,
x1 , x2 0
5. ‰¬ı˛˜¬ z = 2x1 + 3x2 + x3,
˙Ó«¬¸±À¬ÛÀé 4x1 + 3x2 + x3 = 6,
x1 + 2x2 + 5x3 = 4,
x1 , x 2 x 3 0 º
6. ΔZÓ¬ ¸˜¸…±øÈ¬ ¸˜±Ò±Ú fl¬Àı˛, øÚÀ‰¬ı˛ Δı˛ø‡fl¬ Œ√õ∂±·Ë±˜øıøÒ ¸˜¸…±ı˛ ‰¬ı˛˜ ¸˜±Ò±Ú ï˚ø
Ô±Àfl¬ øÚÌ«˚˛ fl¬èÚ †
‰¬ı˛˜¬ z = 3x1 + 2x2,
˙Ó«¬¸±À¬ÛÀé x1 + x2 5,
x1 4
x2 6
– x2 –1
¤ı— x1, x2 0
7. Simplex ¬ÛX¬øÓ¬ÀÓ¬ øÚÀ‰¬ı˛ Δı˛ø‡fl¬ Œ√õ∂±·Ë±˜øıøÒ ¸˜¸…±øÈ¬ ¸˜±Ò±Ú fl¬èÚ ¤ı— Œ˙¯∏ ¸±ı˛Ìœ
ŒÔÀfl¬ ΔZÓ¬ ¸˜¸…±øÈ¬ı˛ ‰¬ı˛˜ ¸˜±Ò±Ú øÚÌ«˚˛ fl¬èÚ †
‰¬ı˛˜¬ z = 30x1 + 23x2 + 29x3,
˙Ó«¬¸±À¬ÛÀé 6x1 + 5x2 + 3x3 26,
4x1 + 2x2 + 5x3 = 7,
x1 , x 2 , x 3 0
8. ΔZÓ¬Ó¬±ı˛ ¸±˝±À˚… Œ‡±Ú Œ˚ øÚÀ‰¬ı˛ Δı˛ø‡fl¬ Œ√õ∂±·Ë±˜øıøÒ ¸˜¸…±ı˛ øı¯∏˚˛±Rfl¬ ’À¬Ûé¬Àfl¬ı˛ ˜±Ú
’ı±Ò (unbounded) ˝Àıº
‰¬ı˛˜ z = 3x1 + 4x2,
26
NSOU
˙Ó«¬¸±À¬ÛÀé x1 – x2 1,
x1 + x2 4,
x1 – 3x2 3,
x1 , x2 0
9. Simplex ¬ÛX¬øÓ¬ ı…ı˝±ı˛ fl¬Àı˛ Œ‡±Ú Œ˚ øÚÀ‰¬ı˛ L.P.P.-øÈ¬ı˛ ΔZÓ¬ ¸˜¸…±ı˛ Œfl¬±Ú fl¬±˚«fl¬ı˛
¸˜±Ò±Ú Ú±˝◊º
‰¬ı˛˜ x1 + 2x2,
˙Ó«¬¸±À¬ÛÀé x1 + 2x2 1,
– x1 + x2 1,
x1 – 0, x2 0
10. Artifical ‰¬˘ ı…ı˝±ı˛ Ú± fl¬Àı˛ Simplex ¬ÛX¬øÓ¬ÀÓ¬ øÚÀ‰¬ı˛ L.P.P.-øÈ¬ ¸˜±Ò±Ú fl¬èÚ †
’ı˜ z = x1 + x2,
˙Ó«¬¸±À¬ÛÀé x1 + 2x2 12,
5x1 + 6x2 48,
x1 0, x2 0
[ ¸—Àfl¬Ó¬ † ΔZÓ¬ ¸˜¸…±øÈ¬ ¸˜±Ò±Ú fl¬èÚ ]
10.8 Î¬◊ M ı˛ ˜ ±˘±

1. ’ı˜¬ w = 21v1 + 21v2 + 8v3 + 6v4,
˙Ó«¬¸±À¬ÛÀé v1 + 2v2 + v3 3,
v1 + 3v2 + v4 4,
v1, v2, v3, v4 0º
2. ‰¬ı˛˜¬ w = 21v1 + v2,
˙Ó«¬¸±À¬ÛÀé 2v1 + v2, 3,
3v1 + v2 1,
v1 , v 2 0 º
3. ’ı˜¬ w = 7v1 + 3v2 – 5v3,
˙Ó«¬¸±À¬ÛÀé v1 + 2v2 2,
–5v1 – 5v2 – 3v3 3,
3v1 + v3 = 4,
v2, v3 0 ¤ı— v1 ø‰¬˝ê ¸±À¬ÛÀé¬ ’ı±Òº
27
NSOU
4. ’ı˜¬w = 6v1 – 8v2 + 6v3,
˙Ó«¬¸±À¬ÛÀé v1 – 2v2 –v3 2,
–3v1 – 4v2 + 3v3 – 6,
v1 , v 3 0 º
3. ’ı˜¬w = 6v1 + 4v2,
˙Ó«¬¸±À¬ÛÀé 4v1 + v2 2,
v1 – 5v2 3, ¤ı— v1, v2 ø‰¬˝ê ¸±À¬ÛÀé¬ ’ı±Ò (unrestricted in sign)º
6. x1 = 4, x1 = 1 ¤ı— (z)‰¬ı˛˜ = 10
7. x1 = 4, x2 = 7 , x3 = 0 ¤ı— (z)‰¬ı˛˜ = 161 ,

2 2
23
v1 = 0, v2 = 2 ¤ı— (z)’ı˜ = 161
2
8. x1 = 0, x2 = 8; ¤ı— (z)’ı˜ = 8º
28
NSOU
¤fl¬fl¬ 11
¬¤fl¬fl¬ ❑ ¬Ûøı˛ ı ˝Ì ˜ÀÎ¬˘ › L.P.P ø˝¸±Àı Œ˘‡Ú (Trans-
portation Model as L.P.P)
·Í¬Ú
√ 11.1 õ∂ô¶∏ ± ıÚ±
√ 11.2 ¬Ûøı˛ ı ˝Ú ¸˜¸…±ı˛ (Transportation problem) ·±øÌøÓ¬fl¬ ı˛ + ¬ Û
√ 11.3 ¬Ûøı˛ ı ˝Ì ¸˜¸…±ı˛ øıÀ˙¯∏ fl¬À˚˛ fl ¬øÈ¬ Δıø˙©Ü …
√ 11.4 Loop ¤ı˛ Ò±ı˛ Ì ± ¤ı— ¬Ûøı˛ ı ˝Ì ¸˜¸…±ı˛ ¸˜±Ò±ÀÚ ¤ı˛ √ õ ∂À˚˛ ± ·
√ 11.5 Î¬◊  ±˝ı˛ Ì
√ 11.6 ¸±ı˛ ± —˙
√ 11.7 ’Ú≈ ˙ œ˘Úœ
√ 11.8 Î¬◊ M ı˛ ˜ ±˘±
11.1 õ∂ô¶∏ ± ıÚ±
¸±Ò±ı˛Ì Δı˛ø‡fl¬ Œ√õ∂±·Ë±øıøÒ ¸˜¸…±ı˛ (general linear programming problem) ¤fl¬øÈ¬ øıÀ˙¯∏
ı˛+¬Û ˝˘ ¬Ûøı˛ı˝Ì ¸˜¸…± (transportation problem)º ¤˝◊ ¸˜¸…±˚˛ Œfl¬±Ú øıÀ˙¯∏ ^ı…Àfl¬ (commod-
ity) fl¬À˚˛fl¬øÈ¬ øıÀ˙¯∏ Ê±˚˛·± ïÎ¬◊»¸ó ŒÔÀfl¬ ’Ú… fl¬À˚˛fl¬øÈ¬ ·ôL√Àı… Œ¬Û“ÃÀÂ øÀÓ¬ Œ˜±È¬ ¬Ûøı˛ı˝Ì ‡ı˛‰¬
(transportation cost) ˚± ˝˚˛ Ó¬±Àfl¬ ¸ıÀ‰¬À˚˛ fl¬ı˛ÀÓ¬ ˝Àıº ^ı…øÈ¬ı˛ Î¬◊»À¸ı˛ (origins) Œfl¬f&ø˘ÀÓ¬
Î¬◊»¬Û±Ú ¸—‡…± (availability), ·ôL√ı… î˘&ø˘ı˛ (destinations) ‰¬±ø˝± (requirements) ›
^ı…øÈ¬ı˛ √õ∂øÓ¬ ¤fl¬Àfl¬ı˛ ¬Ûøı˛ı˝Ì ‡ı˛‰¬ transportation cost) Œ›˚˛± Ô±fl¬Àıº ı±ô¶∏ı Œé¬ÀS ¬Ûøı˛ı˝Ì
¸˜¸…±ı˛ ¤fl¬øÈ¬ Î¬◊±˝ı˛Ì Œ›˚˛± ˚±fl¬ †
˜ÀÚ fl¬èÚÄ ¤fl¬øÈ¬ Í¬±G¬± ¬Û±Úœ˚˛ √õ∂dÓ¬fl¬±ı˛fl¬ ¸—î±ı˛ ˆ¬±ı˛ÀÓ¬ı˛ øıøˆ¬iß √õ∂±ÀôL√ 8øÈ¬ Î¬◊»¬Û±Ú fl¬±ı˛‡±Ú±
’±ÀÂº Î¬◊»¬Û±øÓ¬ ¬Û±Úœ˚˛ ˆ¬±ı˛ÀÓ¬ı˛ 50øÈ √õ∂Ò±Ú ˙˝Àı˛ ¬Û±Í¬±ÀÚ± ˝ÀBÂº øıøˆ¬iß fl¬±ı˛‡±Ú±˚˛ Í¬±G¬± ¬Û±ÚœÀ˚˛ı˛
Î¬◊»¬Û±ÀÚı˛ ¬Ûøı˛˜±Ì ïŒfl¬±Ú øÚø«©Ü ¸˜À˚˛, øıøˆ¬iß ˙˝Àı˛ı˛ Í¬±G¬± ¬Û±ÚœÀ˚˛ı˛ ‰¬±ø˝± ¤ı— √õ∂ÀÓ¬…fl¬ fl¬±ı˛‡±Ú±
ŒÔÀfl¬ ’Ú… Œ˚ Œfl¬±Ú ˙˝Àı˛ ¤˝◊ ^Àı…ı˛ √õ∂øÓ¬ ¤fl¬Àfl¬ı˛ ¬Ûøı˛ı˝Ì ‡ı˛‰¬ Œ›˚˛± ’±ÀÂº ¤‡Ú √õ∂ÀÓ¬…fl¬
fl¬±ı˛‡±Ú± ŒÔÀfl¬ √õ∂ÀÓ¬…fl¬ ˙˝Àı˛ ¬Û±Í¬±ÀÚ± ^Àı…ı˛ ¬Ûøı˛˜±Ì ï√õ∂ÀÓ¬…fl¬ Î¬◊»À¸ı˛ Œ˜±È¬ Î¬◊»¬Û±Ú ı…ı˝±ı˛ fl¬Àı˛
¤ı— √õ∂ÀÓ¬…fl¬ ·ôL√Àı…ı˛ ‰¬±ø˝± ø˜øÈ¬À˚˛ó øÚÌ«˚˛ fl¬ı˛ÀÓ¬ ˝Àı ˚±ÀÓ¬ Œ˜±È¬ ¬Ûøı˛ı˝Ì ‡ı˛‰¬ ¸ıÀ‰¬À˚˛ fl¬˜ ˝˚˛º
29
NSOU
11.2 Ûøı˛ ı ˝Ì ¸˜¸…±ı˛ ·±øÌøÓ¬fl¬ ı˛ + ¬ Û (Mathematical for-
mulation of transportation problem)
Òı˛± ˚±fl¬ Œfl¬±Ú ^Àı…ı˛ m øÈ¬ Î¬◊»¸î˘ (origins) O1, O2,..............Om ¤ı— n øÈ¬ ·ôL√ı…î˘
D1, D2 ..............Dn.
˜ÀÚ fl¬èÚ Oi Î¬◊»¸îÀ˘ Î¬◊»¬Û±Ú ¸—‡…± ai (>0) (i = 1, 2, ............m) ¤ı— Dj ·ôL√ı…îÀ˘
‰¬±ø˝± bj (>0) (j = 1, 2, ...................n).
ÒèÚ Oi Î¬◊»¸î˘ ŒÔÀfl¬ Dj ·ôL√ı…îÀ˘ ¬Û±Í¬±ÀÚ± ^Àı…ı˛ ¬Ûøı˛˜±Ì xij ¤fl¬fl¬ (i = 1, 2, .....m;
j=1, 2, ....... n).
Ó¬±˝À˘, xij 0.
¤‡Ú mn ¸—‡…fl¬ ‰¬˘ xij (i=1, 2, ......... m; j=1, 2, ......... n) ¤ı˛ ˜±Ú øÚÌ«˚˛ fl¬ı˛ÀÓ¬ ˚±ÀÓ¬
n
åx
j =1
ij = ai , (i = 1, 2, .......... m)
¤ı— åx
i =1
ij = b j , ( j = 1, 2, .......... n)
¸˜œfl¬ı˛Ì&ø˘ ø¸X¬ (satisfied) ˝˚˛º

’±ı±ı˛ ˜ÀÚ fl¬èÚ Î¬◊»¬Û±øÓ¬ ^Àı…ı˛ ¤fl¬ ¤fl¬fl¬ Oi Î¬◊»¸ ŒÔÀfl¬ Dj ·ôL√ı…îÀ˘ ¬Û±Í¬±ÀÓ¬ ¬Ûøı˛ı˝Ì
‡ı˛‰¬ ˝˚˛ cij (i = 1, 2, ......... m; j = 1, 2, .......... n).
Ó¬±˝À˘ ¬Ûøı˛ı˝ÀÌı˛ Œ˜±È¬ ‡ı˛‰¬ Òı˛À˘ ’±˜ı˛± ¬Û±˝◊
z = (c11 x11 + c12 x12 + ...................... + c1n x1n)
+ (c21 x21 + c22 x22 + ...................... + c2n x2n)
+ .................... + (cm1 xm1 + cm2 xm2 + ...................... + cmn xmn)
m n
= ååc
i =1 j =1
ij xij .
Ó¬±˝À˘ Œ‡± ˚±ÀBÂ Œ˚ ¬Ûøı˛ı˝Ì ¸˜¸…±Àfl¬ øÚÀ‰¬ı˛ L.P.P. ø˝¸±Àı Œ˘‡± ˚±˚˛ †
m n
’ı˜ z= ååc
i =1 j =1
ij xij ,
˙Ó«¬¸±À¬ÛÀé åx
j =1
ij = ai , i = 1, 2, ................ m;
30
NSOU
m
åx
i =1
ij = bj , j = 1, 2, ................ n;
xij 0, (i = 1, 2, ............. m; j = 1, 2, ............. n)
m n
˚ø å
i =1
ai = åb
j =1
j ˝˚˛ Ó¬Àı ¬Ûøı˛ı˝Ì ¸˜¸…±øÈ¬Àfl¬ ¸˜Ó¬±¬Û” Ì « (balanced) ı˘± ˝˚˛ ¤ı—
m n
å a ¹ åb
i =1
i
j =1
j ˝À˘ ¸˜¸…±øÈ¬Àfl¬ ’¸˜Ó¬±¬Û” Ì « (unbalanced) ı˘± ˝Àıº
Ó¬±˝À˘ ¸˜Ó¬±¬Û”Ì« ¬Ûøı˛ı˝Ì ¸˜¸…±ı˛ Œé¬ÀS Œ˜±È¬ Î¬◊»¬Û±øÓ¬ ^Àı…ı˛ ¬Ûøı˛˜±Ì ¤ı— Œ˜±È¬ ‰¬±ø˝±
¸˜±Ú ˝Àıº
’±˜ı˛± ˘é¬… fl¬ı˛øÂ Œfl¬±Ú ¬Ûøı˛ı˝Ì ¸˜¸…±Àfl¬ øÚÀ‰¬ı˛ ÂÀfl¬ı˛ ¸±˝±À˚… øıı‘Ó¬ fl¬ı˛± ˚±˚˛º ¬¤˝◊ Âflƒ¬Àfl
¬Ûøı˛ı˝Ì Âfl¬ (transportation table) ıÀ˘º
·ôL√ı… î˘
D1 D2 Dn
O1 c11 c12 c1n a1
O2 c21 c22 c2n a2
......................................................................
Î¬◊»¸ î˘ ......................................................................
Om cm1 cm2 cmn aü
b1 b2 bn
¬Ûøı˛ ı ˝Ì ¸˜¸…±ı˛ (L.P.P. ø˝¸±Àıó ˜…±øÈ¬™ ' ı˛ + ¬ Û †
m-øÈ¬ Î¬◊¸î˘ ¤ı— n-øÈ¬ ·ôL√ı…î˘ øıø˙©Ü ¬Ûøı˛ı˝Ì ¸˜¸…±Àfl¬ ï1ó Ú— Âflƒ¬ Z±ı˛± øıı‘Ó¬ fl¬ı˛À˘
¸˜¸…±øÈ¬Àfl¬ (L.P.P. ø˝¸±Àıó ˜…±øÈ¬™' ¤ı˛ ¸±˝±À˚… øÚÀ‰¬ı˛ ’±fl¬±Àı˛ √õ∂fl¬±˙ fl¬ı˛ÀÓ¬ ¬Û±øı˛ †
’ı˜ z = c x ,
˙Ó«¬¸±À¬ÛÀé A x = b , x ³ 0
Œ˚‡±ÀÚ x = [x11, x12.........xij,..........xmn] ˝˘ mn Î¬◊¬Û±—˙ (component) øıø˙©Ü ¤fl¬øÈ¬ ô¶∏y¬
Œˆ¬"ı˛ (column-vector), c = (c11, c12,.........cij,..........cmn) ˝˘ mn Î¬◊¬Û±—˙ øıø˙©Ü ¤fl¬øÈ¬
¸±øı˛ Œˆ¬"ı˛ (row-vector), b = [a1, a2,.........am, b1, b2,.........bn] ¤fl¬øÈ¬ (m + n) Î¬◊¬Û±—˙øıø˙©Ü
ô¶∏y¬ Œˆ¬"ı˛ ¤ı— A = [a11 , a12 ,.......... aij ,......... amn ] ˝˘ (m + n) × mn [À˜ı˛ ¸˝· ˜…±øÈ¬™'
(coefficient matrix) Œ˚‡±ÀÚ aij ˝˘ xij ‰¬À˘ı˛ ô¶∏y¬ Œˆ¬"ı˛º
31
NSOU
¤‡Ú A x =b ˙Ó«¬&ø˘Àfl¬ øı˙ƒˆ¬±Àı (in details) ø˘‡À˘ ’±˜ı˛± ¬Û±˝◊
x11 + x12 + ............. + x1n = a1
x21 + x22 + ............. + x2n = a2
...............................................................................................
...............................................................................................
xm1 + xm2 + ............. + xmn = am
x11 + x21 + ............. + xm1 = b1
x21 + x21 + x22 + ............. + xm2 = b2
...............................................................................................
...............................................................................................
x1n + x2n + ............. + xmn = bn
¤fl¬øÈ¬ Î¬◊  ±˝ı˛ Ì Œ›˚˛ ± ˚±fl¬
Œfl¬±Ú ¬Ûøı˛ı˝Ì ¸˜¸…±ı˛ ¬Ûøı˛ı˝Ì Âflƒ¬øÈ¬ øÚÀ‰¬ Œ›˚˛± ˝˘º
D1 D2 D3 ai
O1 2 1 3 10
O2 2 4 1 15
O3 1 1 5 5
O4 6 2 4 20
bj 30 10 10
¤‡±ÀÚ 4øÈ¬ Î¬◊»¸î˘ ¤ı— 3øÈ¬ ·ôL√ı…î˘ ’±ÀÂ ¤ı— ¸˜¸…±øÈ¬ ¸˜Ó¬±¬Û”Ì« fl¬±ı˛Ì
4 3
å åb
i =1
ai
j =1
j = 50
¸˜¸…±øÈ¬Àfl¬ L.P.P ø˝¸±Àı ø˘‡À˘ ’±˜ı˛± ¬Û±˝◊,

’ı˜ z = 2x11 + x12 + 3x13 + 2x21 + 4x22 + x23 + x31 + x32 + 52x33 + 6x41+ 2x42 + 4x43,
x11 + x12 + x13 =10
x12 + x22 + x23 =15
x31 + x32 + x33 =5
x41 + x42 + x43 =20
x11 + x21 + x31 + x41 =30
x12 + x22 + x32 + x42 =10
x13 + x23 + x33 + x43 =10
¤‡±ÀÚ √õ∂Ò±Ú ˙ÀÓ«¬ı˛ (constraints) ¸—‡…± 4 + 3 = 7 ¤ı— ‰¬À˘ı˛ ¸—‡…± 12º
xij 0 (i = 1, 2, 3, 4; j = 1, 2, 3)
¤‡±ÀÚ √õ∂Ò±Ú ˙ÀÓ«¬ı˛ (constrains) ¸—‡…± 4 + 3 = 7 ¤ı— ‰¬À˘ı˛ ¸—‡…± 12º
¤‡±ÀÚ, b = [10, 15, 5, 20, 30, 10, 10]
c = (2, 1, 3, 2, 4, 1, 1, 1, 5, 6, 2, 4)
32
NSOU
¤‡±ÀÚ ¸˝· ˜…±øÈ¬™' A ˝˘
LM1 1 1 0 0 0 0 0 0 0 0OP
MM00 00 00 10 10 10 10 10 10 00 00PP
MM10 00 00 10 00 00 10 00 00 11 10PP
MM0 1 0 0 1 0 0 1 0 0 0PP
N0 0 1 0 0 1 0 0 1 0 1 Q
˚± ¤fl¬øÈ¬ 7 × 12 [À˜ı˛ ˜…±øÈ¬™'º
’±˜ı˛± ˘é¬… fl¬ı˛øÂ x12 ‰¬À˘ı˛ ô¶∏y¬ Œˆ¬"ı˛
LM OP LM OP
a12 = 1 = 1 + 0 = e1 + e6 LM OP
0
0 MM PP
0
0
0
0 MM PP MM PP
0 MM PP
0 0 MM PP MM PP
MM PP MM PP MM PP
0 0 0
1 0 1
0 0NQ 0 NQ NQ
Œ˚‡±ÀÚ ei ˝˘ (4+3) × (4+3) ’Ô«±» 7×7 [À˜ı˛ ¤fl¬¸˜ ˜…±øÈ¬™À'ı˛ (unit matrix) i Ó¬˜
ô¶∏y¬ Œˆ¬"ı˛º ¸±Ò±ı˛Ì ˆ¬±Àı ’±˜ı˛± ¬Û±˝◊
aij = ei + em+ j [¤‡ÀÚ m = 4, n = 3 ]
= e + e4 + 2
11.2 ¬Ûøı˛ı˝Ì ¸˜¸…±ı˛ øıÀ˙¯∏ fl¬À˚˛fl¬øÈ¬ Δıø˙©Ü…
øÚÀ‰¬ı˛ Î¬◊¬Û¬Û±…&ø˘ ŒÔÀfl¬ ¬Ûøı˛ı˝Ì ¸˜¸…±ı˛ øıÀ˙¯∏ fl¬À˚˛fl¬øÈ¬ Δıø˙©Ü… Ê±Ú± ˚±Àı Œ˚&ø˘
¬Ûøı˛ı˝Ì ¸˜¸…±ı˛ ¸˜±Ò±ÀÚ ¸±˝±˚… fl¬ı˛Àıº
Î¬◊ ¬ Û¬Û±… 1 m ¸—‡…fl¬ Î¬◊»¸ ¤ı— n ¸—‡…fl¬ ·ôL√ı…î˘ øıø˙©Ü ¸˜Ó¬±¬Û”Ì« (balanced) ¬Ûøı˛ı˝Ì
¸˜¸…±ı˛ Œé¬ÀS Œ˜Ã˘ ‰¬À˘ı˛ (basic variables) ¸—‡…± ¸ı«±øÒfl¬ m + n – 1 ˝Àıº
√ õ ∂˜±Ì † √õ∂Ó¬œfl¬&ø˘ı˛ √õ∂‰¬ø˘Ó¬ ’ÀÔ«, ¬Ûøı˛ı˝Ì ¸˜¸…±øÈ¬Àfl¬ øÚÀ‰¬ı˛ ’±fl¬±Àı˛ √õ∂fl¬±˙ fl¬ı˛± ˚±˚˛ †
m n
’ı˜ z= ååC
i -1 j =1
ij xij ,
33
NSOU
n
˙Ó«¬¸±À¬ÛÀé¬ åx
j =1
ij = ai , (i = 1, 2, .......... m) .......... (1)
åx
i =1
ij = bi , ( j = 1, 2, .......... n); .......... (2)
xij ³ 0 (i = 1, 2 .......... m; j = 1, 2, .......... n)

m n
¤‡±ÀÚ å xij ai = å b j
i =1 j =1
L O
å MMå x PP = å a = å b
m n m n
N Q ij i ij ................. (3)
i =1 j =1 i =1 j =1
¤‡Ú ï1ó Ú— ˙Ó«¬&ø˘ (constraints) ŒÔÀfl¬ ’±˜ı˛± ¬Û±˝◊

L O
n -1
å MNå x PQ = å b ................. (4)

m n
ij j
j =1 i =1 j =1
¤‡Ú ï3ó › ï4ó ŒÔÀfl¬ ’±˜ı˛± ¬Û±˝◊

m n n -1 m n n -1
å å x - å å x = åb - åb ;
i =1 j =1
ij
j =1 i = 1
ij
j =1
j
j =1
j
L O
å MMå x - å x PP = b
m n n -1
ı±,
N
i =1 j =1Q ij
j =1
ij n
ı±, åx
i =1
in = bn , Ú— ˙Ó«¬&ø˘ı˛ n Ó¬˜ ˙Ó«¬º
Ó¬±˝À˘ Œ‡± Œ·˘ Œ˚ ï1ó › ï2ó ¤ı˛ Œ˜±È¬ (m + n) øÈ¬ ˙ÀÓ«¬ı˛ ˜ÀÒ… ¤fl¬øÈ¬ ˙Ó«¬ ı± Œ›˚˛±
Œ˚ÀÓ¬ ¬Û±Àı˛º ¸≈Ó¬ı˛±— ï1ó › ï2ó Z±ı˛± øÚÀ«ø˙Ó¬ ¸˜œfl¬ı˛Ì ˜G¬˘œı˛ Œ˚ Œfl¬±Ú Œ˜Ã˘ ¸˜±Ò±ÀÚ (basic
solution) Œ˜Ã˘ ‰¬À˘ı˛ ¸—‡…± ¸ı«±øÒfl¬ m + n – 1 ˝Àıº
Î¬◊ ¬ Û¬Û±… 2 Œ˚ Œfl¬±Ú ¸˜Ó¬±¬Û”Ì« ¬Ûøı˛ı˝Ì ¸˜¸…±ı˛ ¸ı«± fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú (feasible solution)
¬Û±›˚˛± ˚±Àıº
√ õ ∂˜±Ì † √õ∂Ó¬œfl¬&ø˘ı˛ √õ∂‰¬ø˘Ó¬ ’ÀÔ«, m ¸—‡…fl¬ Î¬◊»¸ ¤ı— n ¸—‡…fl¬ ·ôLı…î˘ øıø˙©Ü ¬Ûøı˛ı˝Ì
¸˜¸…±ı˛ (m+n) ¸—‡…fl¬ ˙Ó«¬&ø˘ Òı˛± ˚±˚˛,
n
åx
j =1
ij = ai , (i = 1, 2, .......... m) ...........(1)
34
NSOU
m
¤ı— åx
i =1
ij = b j , ( j = 1, 2, .......... n) ........... ( 2)
m n
¤‡±ÀÚ å
i =1
ai = åb
j =1
j =S ï˜ÀÚ fl¬èÚó
Œ˚À˝Ó≈¬ ai > 0, bj > 0 (i=1, 2, .......... m; j=1, 2, ............. n), S ’ı˙…˝◊ ÒÚ±Rfl¬ ˝Àıº
ai b j
¤‡Ú ’±˜ı˛± √õ∂˜±Ì fl¬ı˛ı Œ˚ xij = (i=1, 2 .......... m, j=1, 2, ............. n) ¬Ûøı˛ı˝Ì
S
¸˜¸…±øÈ¬ı˛ ¤fl¬øÈ¬ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú ˝Àıº ’±˜ı˛± ˘é¬… fl¬ı˛øÂ Œ˚ i, j ¤ı˛ ¸fl¬˘ ˜±ÀÚı˛ ÊÚ… xij > 0º
ai b j
’±ı±ı˛ xij = ÒÀı˛ ’±˜ı˛± ¬Û±˝◊
S
n n ai b j ai n
å å åb
ai
xij = = j = S = ai , (i = 1, 2, ........... n).
j =1 j =1
S S i =1
S
m m ai b j
¤ı— å
i =1
xij = å
i =1
S
bj m
=
S åai =1
i
bj
= . S = b j , ( j = 1, 2, .......... n)
S
ai b j
¸≈Ó¬ı˛±— i, j ¤ı˛ ¸fl¬˘ ˜±ÀÚı˛ ÊÚ… xij =
S
Òı˛À˘ ¬Ûøı˛ı˝Ì ¸˜¸…±ı˛ ï1ó Ú— › ï2ó Ú— ¤ı˛
¸ı&ø˘ ˙Ó«¬ ø¸X¬ ˝˚˛ ¤ı— xij > 0 (i = 1, 2, .......... m; j=1, 2, .......... n).Œ
’Ó¬¤ı ¬Ûøı˛ı˝Ì ¸˜¸…±È¬ı˛ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú ¬Û±›˚˛± Œ·˘º
Î¬◊ ¬ Û¬Û±… 3 Œ˚ Œfl¬±Ú ¬Ûøı˛ı˝Ì ¸˜¸…±ı˛ øı¯∏˚˛±Rfl¬ ’À¬Ûé¬Àfl¬ı˛ ˜±Ú fl¬‡Ú˝◊ ’ı±Ò (un bounded)
˝Àı Ú± ¤ı— Œ˚ Œfl¬±Ú fl¬±˚«fl¬ı˛ ¸˜±Ò±ÀÚ Œfl¬±Ú ‰¬À˘ı˛ ˜±Ú ˚‘BÂˆ¬±Àı ı±h¬±ÀÚ± (arbitrarily large)
˚±Àı Ú±º
√ õ ∂˜±Ì † ˜ÀÚ fl¬èÚ ¬Ûøı˛ı˝Ì ¸˜¸…±øÈ¬ ˝˘
m n
’ı˜ z= å åc
i -1 j =1
ij xij ,
j =1
ij = ai , (i = 1, 2, .......... m).
35
NSOU
m
åx
i =1
ij = bj , ( j = 1, 2, .......... n).
xij 0 (i = 1, 2, .......... m; j = 1, 2, ......... n).

¤‡±ÀÚ ’±˜ı˛± ˘é¬… fl¬ı˛øÂ Œ˚˛ Œfl¬±Ú fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú [x11, x12,.............xij ,.......... xmn] ¤ı˛
n
ÊÚ… xij £ åx
j =1
ij = ai ( 3 x 0, i, j-¤ı˛
ij
¸fl¬˘ ˜±ÀÚı˛ ÊÚ…ó
(i =1, 2, .......... m)
m
¤ı— xij £ åx
i =1
ij = bj , (j = 1, 2, .......... n).
¸≈Ó¬ı˛±— i, j ¤ı˛ ¸fl¬˘ ˜±ÀÚı˛ ÊÚ… ’±˜ı˛± ¬Û±˝◊

0 xij m a x {a1, a2, .......... am; b1, b2, .......... bn} ................. (1)
’±ı±ı˛ ¤‡±ÀÚ cij 0 (i, j ¤ı˛ ¸fl¬˘ ˜±ÀÚı˛ ÊÚ…óº
Ó¬±˝À˘, Œ˚ Œfl¬±Ú fl¬±˚«fl¬ı˛ ¸˜±Ò±ÀÚı˛ ÊÚ… z 0 ˝Àıº
¤‡Ú ¬Ûøı˛ı˝Ì ¸˜¸…±øÈ¬ ’ı˜ ˜±Ú øÚÌ«˚˛ ¸—[±ôL√ L.P.P. ˝›˚˛±˚˛ ¤ı— Œ˚ Œfl¬±Ú fl¬±˚«fl¬ı˛
¸˜±Ò±ÀÚı˛ ÊÚ… øı¯∏˚˛±Rfl¬ ’À¬Ûé¬fl¬ z ¤ı˛ ˜±Ú 0 ˝›˚˛±˚˛ z ¤ı˛ ˜±Ú fl¬‡Ú˝◊ ’ı±Ò (un
bounded) ˝Àı Ú±º
’±ı±ı˛ ï1ó ŒÔÀfl¬ ’±˜ı˛± ı˘ÀÓ¬ ¬Û±øı˛ Œ˚ Œfl¬±Ú xij ¤ı˛ ˜±Ú ˚‘BÂˆ¬±Àı ı±h¬±ÀÚ± ˚±Àı Ú±º
’Ó¬¤ı Î¬◊¬Û¬Û±…øÈ¬ √õ∂˜±øÌÓ¬ ˝˘º
˜ôL√ ı … † Œ˚À˝Ó≈¬ Œ˚ Œfl¬±Ú ¸˜Ó¬±¬Û”Ì« ¬Ûøı˛ı˝Ì ¸˜¸…±ı˛ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú Ô±Àfl¬ ¤ı— ¤ı˛+¬Û
¸˜¸…±ı˛ øı¯∏˚˛±Rfl¬ ’À¬Ûé¬Àfl¬ı˛ ˜±Ú fl¬‡Ú˝◊ ’ı±Ò ˝ÀÓ¬ ¬Û±Àı˛ Ú± ¸≈Ó¬ı˛±— Œ˚ Œfl¬±Ú ¸˜Ó¬±¬Û” Ì «
¬Ûøı˛ ı ˝Ì ¸˜¸…±ı˛ ‰¬ı˛ ˜ ¸˜±Ò±Ú (optimal solution) ¬Û±›˚˛± ˚±Àıº
¤‡Ú ¬Ûøı˛ı˝Ì ¸˜¸…±ı˛ fl¬À˚˛fl¬øÈ¬ øıÀ˙¯∏ Δıø˙©Ü… Ô±fl¬±ı˛ ÊÚ… ¬Ûı˛ıÓ«¬œ ¤fl¬Àfl¬ ’±˜ı˛± Œ‡Àı±
Œ˚ ¸±Ò±ı˛ Ì L.P.P.-ı˛ ˜Ó¬ simplex ¬ÛX¬øÓ¬ ı…ı˝±ı˛ Ú± fl¬Àı˛ ’Ú… øıÀ˙¯∏ ¬ÛX¬øÓ¬ÀÓ¬ ¬Ûøı˛ ı ˝Ì
¸˜¸…± ¸˜±Ò±Ú fl¬ı˛ ± ¸y¬ıº
11.4 Loop ¤ı˛ Ò±ı˛ Ì ± ¤ı— ¬Ûøı˛ ı ˝Ì ¸˜¸…±ı˛ ¸˜±Ò±ÀÚ ¤ı˛

√ õ ∂À˚˛ ± ·
m ¸—‡…fl¬ Î¬◊»¸î˘ ¤ı— n ¸—‡…fl¬ ·ôL√ı…í˘ øıø˙©Ü ¬Ûøı˛ı˝Ì ¸˜¸…±ı˛ Œfl¬±Ú fl¬±˚«fl¬ı˛
¸˜±Ò±Ú,
36
NSOU
[x11, x12 ........... xij, ........... xmn]Œfl¬ øÚÀ‰¬ı˛ ÂÀfl¬ı˛ ¸±˝±À˚… √õ∂fl¬±˙ fl¬ı˛± ˝˚˛º
D1 D1 ...............................Dn
O1 x11 x12 ........................ x1n
O2 x21 x22 ........................ x2n
.
. ................................................................. ................. (1)
. .................................................................
.
O m
xm1 xm2 ........................ xmn
¤‡±ÀÚ √õ∂øÓ¬øÈ¬ ‰¬˘Àfl¬ ¤fl¬øÈ¬ box ¤ı˛ ˜ÀÒ… Œ‡±ÀÚ± ˝À˚˛ÀÂº Œ˜øÈ¬ mn ¸—‡…fl¬ ‰¬˘Àfl¬ mn
¸—‡…fl¬ box ¤ı˛ ˜ÀÒ… Œ‡±ÀÚ ˝À˚˛ÀÂº xij ‰¬˘øÈ¬ i Ó¬˜ ¸±øı˛ ¤ı— j Ó¬˜ ô¶∏Ày¬ı˛ box ¤ı˛ ˜ÀÒ…
’±ÀÂ ¤ı— ¤˝◊ box øÈ¬Àfl¬ ’±˜ı˛± (i, j) cell ı˘Àı±º
’±˜ı˛± ˘é¬… fl¬ı˛øÂ Œ˚ ˚ø m = 3, n = 2 ˝˚˛ Ó¬±˝À˘ Œ˜±È¬ 6øÈ¬ ‰¬˘ ¤ı— 6øÈ¬ cell Ô±fl¬Àı
¤ı— ‰¬˘&ø˘ ˝˘ x11, x12, x21, x22, x31, x32, › ’Ú≈ı˛+¬Û cell &ø˘ ˝˘ (1, 1), (1, 2), (2 1),
(2 2), (3, 1), (3, 2) [ ˚± øÚÀ‰¬ı˛ ÂÀfl¬ Œ‡±ÀÚ± ˝À˚˛ÀÂ ]º
D1 D2
O1 x11 x12
O2 x21 x22
O3 x31 x32
’±˜ı˛± ’±À·˝◊ Î¬◊À{°‡ fl¬Àı˛øÂ Œ˚ ï1ó Ú— ÂÀfl¬ı˛ ’Ú≈ı˛+¬Û ÂÀfl¬ ¬Ûøı˛ı˝Ì ‡ı˛‰¬ c11, c12, ..........
cij, ............ cmn Œfl¬ Œ‡±ÀÚ± ˝˚˛ ¤ı— ¤ı˛+¬Û Âfl¬Àfl¬ ¬Ûøı˛ı˝Ì Âfl¬ (transportation table) ıÀ˘º
¤‡±ÀÚ (i, j) cell ¤ı˛ ˜ÀÒ… cij Œ‡±ÀÚ± ˝˚˛º
˘≈ ¬ Û (Loop) : Ûøı˛ı˝Ì ÂÀfl¬ ¸˜œ˜ ¸—‡…fl¬ cell ¤ı˛ ’Ú≈[˜Àfl¬ (sequence) ˘≈¬Û ı˘± ˝˚˛ ˚øñ
(i) Œ˚ Œfl¬±Ú ≈øÈ¬ ¸øißø˝Ó¬ (adjacent) cell ¬Ûøı˛ı˝Ì ÂÀfl¬ı˛ ô¶∏Ày¬ ı± ¤fl¬˝◊ ¸±øı˛ÀÓ¬ Ô±Àfl¬º
(ii) ’Ú≈[À˜ı˛ ¬Ûı˛¬Ûı˛ (consecutive) ≈øÈ¬ı˛ Œıø˙ cell ¤fl¬˝◊ ¸±øı˛ ı± ¤fl¬˝◊ ô¶∏Ày¬ Ô±Àfl¬ Ú±º
(iii) ’Ú≈[À˜ı˛ √õ∂Ô˜ ¤ı— Œ˙¯∏ cell ¤fl¬˝◊ ¸±øı˛ ı± ¤fl¬˝◊ ô¶∏Ày¬ Ô±Àfl¬º
(iv) ’Ú≈[À˜ ¬Ûøı˛ı˝Ì ÂÀfl¬ı˛ fl¬˜¬ÛÀé¬ ≈øÈ¬ ¸±øı˛ ı± ≈øÈ¬ ô¶∏y¬ ı…ı˝±ı˛ fl¬ı˛ÀÓ¬ ˝Àıº
øÚÀ‰¬ı˛ ¬Ûøı˛ı˝Ì ÂÀfl¬ı˛ Œé¬ÀS ø‰¬ÀSı˛ ¸±˝±À˚… fl¬À˚˛fl¬øÈ¬ ˘≈¬Û Œ‡±ÀÚ± ˝˘ †
[ ˘≈¬Û ¤ı˛ cell &ø˘ ë.í ¤ı˛ ¸±˝±À˚… Œı±Á¬±ÀÚ± ˝À˚˛ÀÂº ]
D1 D2 D3 D4 D5
O1 c11 c12 c13 c14 c15
O2 c21 c22 c23 c24 c25
O3 c31 c32 c33 c34 c35
O4 c41 c42 c43 c44 c45
37
NSOU
(a) D1 D2 D3 D4 D5
O1 .+ . . . . . . . .+
. .. .
.. . .
O2
O3 +. . . . . . . . .+
O4
¤‡±ÀÚ loop ¤ı˛ cell &ø˘ ˝˘ (1, 1), (1, 3), (3, 3), (3, 1)º
(b)
D1 D2 D3 D4 D5
O1 .+ . . . . . . . . . . .+
. .
O2 +. . . . .+. . . . . . . . . . . .+
. .
O3 . .
. .... .
O4 + +
¤‡±ÀÚ loop ¤ı˛ cell &ø˘ ˝˘ (1, 2), (1, 5), (2, 5), (2, 1), (4, 1), (4, 2)º
(c)
D1 D2 D3 D4 D5
O1 . . .
+ +.
.
O2 . +. . +
. .
O3 . +. . +
. .
.
O4 +. . . . . . . . . .. +
¤‡±ÀÚ cell &ø˘ ˝˘ (1, 1), (1, 2), (2, 2), (2, 3), (3, 3) (3, 4), (4, 4), (4, 1)º
’±˜ı˛± ˘é¬… fl¬ı˛øÍ¬ Œ˚ Œfl¬±Ú ˘≈À¬Û cell ¤ı˛ ¸—‡…± ’ı˙…˝◊ ŒÊ±h¬ ¸—‡…± (even number) ˝Àı
¤ı— fl¬˜¬ÛÀé¬ 4øÈ¬ cell Ô±fl¬Àıº
¬Ûøı˛ ı ˝Ì ¸˜¸…±˚˛ ˘≈ À ¬Ûı˛ ı…ı˝±ı˛
’±˜ı˛± ŒÀ‡øÂ Œ˚ ¬Ûøı˛ı˝Ì ¸˜¸…± øıÀ˙¯∏ ’±fl¬±Àı˛ı˛ L.P.Pº ’±˜ı˛± ’±ı˛› ŒÀ‡øÂ Œ˚ m ¸—‡…fl¬
Î¬◊»¸î˘ › n ¸—‡…fl¬ ·ôL√ı…î˘ øıø˙©Ü ¬Ûøı˛ı˝Ì ¸˜¸…±ı˛ Œé¬ÀS Œ˜±È¬ mn ¸—‡…fl¬ ‰¬À˘ı˛ ˜ÀÒ…
Œ˜Ã˘ ‰¬À˘ı˛ (basic variables) ¸—‡…± ¸ı«±øÒfl¬ m + n – 1 ˝Àıº
¤‡Ú ’±˜ı˛± A x = b Ê±øÚ Œ˚ Z±ı˛± øÚÀ«ø˙Ó¬ ¸˜œfl¬ı˛Ì˜G¬˘œı˛ Œfl¬±Ú Œ˜Ã˘ ¸˜±Ò±ÀÚı˛ (basic
solution) Œé¬ÀS, ¸˝· ˜…±øÈ¬™' A-ŒÓ¬ Œ˜Ã˘ ‰¬˘&ø˘ı˛ ô¶∏y¬ Œˆ¬"ı˛&ø˘ Δı˛ø‡fl¬ˆ¬±Àı ¶§±ÒœÚ (linearly
independent) ˝Àıº
38
NSOU
¬Ûøı˛ ı ˝Ì ¸˜¸…±ı˛ ¸˜±Ò±ÀÚı˛ Œé¬ÀS ¸˝· ˜…±øÈ¬™ À 'ı˛ √ õ ∂M fl¬À˚˛ fl ¬øÈ¬ ô¶∏ y ¬ Œˆ¬"ı˛
Δı˛ ø ‡fl¬ˆ¬±Àı ¶§ ± ÒœÚ ˝Àı øfl¬ Ú± Ó¬± ˘≈ À ¬Ûı˛ ı…ı˝±Àı˛ ı ˛ ¸˝ÀÊ ı˘± ˚±Àı ¤ı— ¤ı˛ ÊÚ… øÚÀ‰¬ı˛
Î¬◊¬Û¬Û±…øÈ¬ ï˚± √õ∂˜±Ì Â±h¬± øıı‘Ó¬ fl¬ı˛± ˝À˚˛ÀÂó √õ∂À˚˛±· fl¬ı˛ÀÓ¬ ˝Àıº
Î¬◊ ¬ Û¬Û±… † ¬Ûøı˛ı˝Ì ¸˜¸…±ı˛ ¸˝· ˜…±øÈ¬™À'ı˛ √õ∂M Œ˚ Œfl¬±Ú ¸—‡…fl¬ ô¶∏y¬ Œˆ¬"ı˛ Δı˛ø‡fl¬ˆ¬±Àı
øÚˆ«¬ı˛˙œ˘ (linearly dependent) ˝Àı ˚ø ¤ı— Œfl¬ı˘˜±S ˚ø ¬Ûøı˛ ı ˝Ì ÂÀfl¬ ¤˝◊ Œˆ¬"ı˛ & ø˘ı˛
’Ú≈ ı ˛ + ¬ Û cell &ø˘ı˛ ¸ı&ø˘ ı± fl¬À˚˛ fl ¬øÈ¬ ˘≈ ¬ Û ΔÓ¬ı˛ œ fl¬Àı˛ º
11.5 Î¬◊  ±˝ı˛ Ì
øÚÀ‰¬ı˛ ¬Ûøı˛ı˝Ì ¸˜¸…±øÈ¬ øıÀı‰¬Ú± fl¬ı˛± ˚±fl¬ †

D1 D2 D3 D4 ai
O1 2 4 6 1 40
O2 3 4 2 3 30
O3 5 2 7 1 50
bj 35 35 25 25
¤˝◊ ¸˜¸…±øÈ¬ı˛ ≈øÈ¬ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú ïÂÀfl¬ı˛ ¸±˝±À˚…ó øÚÀ‰¬ Œ›˚˛± ˝˘ †
(i) D1 D2 D3 D4 ai
+. . . . . . . ..+
O1 20 10 10 . 40
. .
+........+
O2 15 15 30
O3 15 10 25 50
bj
(ii)
D1 D2 D3 D4 ai
O1 35 5 40
O2 30 30
O3 25 25 50
bj 35 35 25 25
√õ∂ÔÀ˜ ’±˜ı˛± ıÀ˘ ı˛±ø‡ Œ˚ ÂÀfl¬ı˛ ¸±˝À˚… ¬Ûøı˛ı˝Ì ¸˜¸…±ı˛ Œfl¬±Ú ¸˜±Ò±Ú √õ∂fl¬±˙ fl¬ı˛À˘
’±˜ı˛± ÒÀı˛ ŒÚı Œ˚ Œfl¬±Ú empty cell ¤ı˛ ‰¬À˘ı˛ ˜±Ú 0 ˝Àı ¤ı— ¸˜±Ò±Ú Œ˘‡±ı˛ ¸˜˚˛ ¤˝◊
‰¬˘&ø˘ı˛ ï˚±Àı˛ ˜±Ú 0 Î¬◊À{°‡ fl¬ı˛± ˝Àı Ú±º
39
NSOU
Ó¬±˝À˘ ï1ó Ú— ÂÀfl¬ √õ∂M fl¬±˚«fl¬ı˛ ¸˜±Ò±ÚøÈ¬ ˝˘ †
x11 = 20, x12 = 10, x13 = 10, x22 = 15, x23 = 15, x31 = 15, x32 = 10, x33 = 25.
¤‡±ÀÚ m = 3, n = 4 ¸≈Ó¬ı˛±— Œ˜Ã˘ ‰¬À˘ı˛ ¸—‡…± ¸ı«±øÒfl¬ 4 + 3 – 1 = 6 ˝Àıº Ó¬±˝À˘ ¤˝◊

¸˜¸…±ı˛ Œé¬ÀS Œ˚ Œfl¬±Ú Œ˜Ã˘ ¸˜±Ò±ÀÚ ï¤‡±ÀÚ Œ˜±È¬ ‰¬À˘ı˛ ¸—‡…± 12ó fl¬˜¬ÛÀé¬ 12 – 6 ’Ô«±»
6øÈ¬ ‰¬À˘ı˛ ˜±Ú 0 ˝Àıº Î¬◊¬ÛÀı˛ı˛ fl¬±˚«fl¬ı˛ ¸˜±Ò±ÚøÈ¬ÀÓ¬ ˜±S 4øÈ¬ ‰¬À˘ı˛ ˜±Ú 0º ¸≈Ó¬ı˛±— ¤˝◊
¸˜±Ò±ÚøÈ¬ Œ˜Ã˘ ¸˜±Ò±Ú Ú˚˛º ¸≈Ó¬ı˛±— ¤‡±ÀÚ Œ˚ ‰¬˘&ø˘ı˛ ˜±Ú ÒÚ±Rfl¬ Œ¸˝◊ ‰¬˘&ø˘ı˛ ’Ú≈ı˛+¬Û
cell &ø˘ı˛ ¸ıfl¬øÈ¬ ı± fl¬À˚˛fl¬øÈ¬ øÚÀ˚˛ ˘≈¬Û fl¬ı˛± ˚±Àıº ¤‡±ÀÚ (1, 2), (1, 3), (2, 2), (2, 3) cell
&ø˘ ˘≈¬Û ΔÓ¬ı˛œ fl¬Àı˛ÀÂº
¤‡Ú (ii) Ú— ÂÀfl¬ √õ∂M ¸˜±Ò±ÚøÈ¬ ˝˘ x11= 35, x12 = 5, x22 = 30, x33 = 25, x34 = 25
Œ˚‡±ÀÚ ı±fl¬œ 7øÈ¬ ‰¬À˘ı˛ ˜±Ú 0, ¤‡±ÀÚ ’±˜ı˛± ˘é¬… fl¬ı˛øÂ Œ˚ ÒÚ±Rfl¬ ˜±Ú øıø˙©Ü ‰¬˘Àı˛ cell
&ø˘ ˝˘ (1, 1), (1, 2), (2, 2), (3, 3), (3, 4) ¤ı— cell &ø˘ı˛ ¸ı&ø˘ ı± fl¬À˚˛fl¬øÈ¬ øÚÀ˚˛ Œfl¬±Ú
˘≈¬Û fl¬ı˛± ˚±˚˛ Ú±º ’±ı˛› ˘é¬… fl¬ı˛øÂ Œ˚ ¤˝◊ cell &ø˘ı˛ ¸À/ ¤fl¬øÈ¬ ’øÓ¬øı˛ª cell, Œ˚˜Ú (1,
3) cell [¤‡±ÀÚ x13= 0] øÚÀ˚˛ Œ˚ 6øÈ¬ cell ¬Û±›˚˛± ˚±˚˛ Ó¬±Àı˛ øÚÀ˚˛› ï¸ı&ø˘ ı± fl¬À˚˛fl¬øÈ¬ó ˘≈¬Û
fl¬ı˛± ˚±˚˛ Ú±º ’±˜ı˛± ’±À·˝◊ ıÀ˘øÂ Œ˚ ¤‡±ÀÚ Œ˜Ã˘ ‰¬À˘ı˛ ¸—‡…± ¸ı«±øÒfl¬ 6 ˝Àıº Ó¬±˝À˘ (ii)
Ú— ÂÀfl¬ √õ∂M ¸˜±Ò±ÚøÈ¬ ¤fl¬øÈ¬ Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú Œ˚‡±ÀÚ Œ˜Ã˘ ‰¬À˘ı˛ ¸—‡…± 6 ¤ı— ¤fl¬øÈ¬
Œ˜Ã˘ ‰¬À˘ı˛ ˜±Ú 0º ¸≈Ó¬ı˛±— ¤˝◊ fl¬±˚«fl¬ı˛ ¸˜±Ò±ÚøÈ¬ ¤fl¬øÈ¬ degenerate Œ˜Ã˘ fl¬±˚« fl ¬ı˛ ¸˜±Ò±Ú
(basic feasible solution) ˝Àıº
Œ˚ Œfl¬±Ú Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±ÀÚı˛ Œé¬ÀS, Œ˜Ã˘ ‰¬˘Àı˛ ï˚±Àı˛ ˜±Ú > 0) cell &ø˘Àfl¬
’±˜ı˛± basic cell ı± occupied cell ı˘ı ¤ı— ’Ú… ‰¬˘Àı˛ cell &ø˘Àfl¬ unoccupied cell
ı˘ıº
11.6 ¸±ı˛ ± —˙
¤˝◊ ¤fl¬Àfl¬ √õ∂ÔÀ˜ ¬Ûøı˛ı˝Ì ¸˜¸…±Àfl¬ ’±˜ı˛± øıÀ˙¯∏ ’±fl¬±Àı˛ı˛ L.P.P. ø˝¸±Àı ıÌ«Ú± fl¬Àı˛øÂ
¤ı— Ó¬±ı˛¬Ûı˛ √õ∂˜±Ì fl¬Àı˛øÂ Œ˚ Œfl¬±Ú ¸˜Ó¬±¬Û”Ì« (balanced) ¬Ûøı˛ı˝Ì ¸˜¸…±ı˛ ‰¬ı˛˜ ¸˜±Ò±Ú
(optimal solution) ¬Û±›˚˛± ˚±Àıº
¸ıÀ˙À¯∏ ¬Ûøı˛ı˝Ì ÂÀfl¬ı˛ fl¬À˚˛fl¬øÈ¬ cell ¤ı˛ ˘≈¬Û ΔÓ¬ı˛œ fl¬ı˛ÀÓ¬ ¬Û±ı˛±ı˛ ¸À/ ¸˝· ˜…±øÈ¬™À'ı˛ ’Ú≈ı˛+¬Û
ô¶∏y¬ Œˆ¬"ı˛Àı˛ Δı˛ø‡fl¬ˆ¬±Àı øÚˆ«¬ı˛ (linearly dependent) ˝›˚˛±ı˛ ¸•§g¬øÈ¬ ’±˜ı˛± ¤fl¬øÈ¬ Î¬◊¬Û¬Û±À…ı˛
¸±˝±À˚… øıı‘Ó¬ fl¬Àı˛øÂº
40
NSOU
11.7 ’Ú≈ ˙ œ˘Úœ
1. øÚÀ‰¬ı˛ √õ∂ÀÓ¬…fl¬ ¬Ûøı˛ı˝Ì ¸˜¸…±Àfl¬ L.P.P ø˝¸±Àı ø˘‡≈Ú †

(i)
D1 D2 ai
O1 2 1 10
O2 3 4 12
bj
8 14
(ii)
D1 D2 D3 D4 ai
O1 2 1 3 2 30
O2 3 1 0 4 50
O3 5 3 2 4 20
bj 20 40 30 10
2. 1-¤ı˛ (ii) Ú— ¬Ûøı˛ı˝Ì ¸˜¸…±ı˛ Œé¬ÀS øÚÀ‰¬ı˛ ÂÀfl¬ øıı‘Ó¬ ¸˜±Ò±ÚøÈ¬ Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú
øfl¬ Ú± ¬Ûı˛œé¬± fl¬èÚº ¤˝◊ ¸˜±Ò±ÚøÈ¬ øfl¬ non-degeneratere?
D1 D2 D3 D4 ai
20 10
O1 30
30 20
O2 50
10 10
O3 20
bj 20 40 30 10
3. 1 (i) Œı˛ ¸˝· ˜…±øÈ¬™'øÈ¬ ø˘‡≈Ú ¤ı— Œ‡±Ú Œ˚ Δ˝ ˜…±øÈ¬™'øÈ¬ı˛ rank ˝Àı 2 + 2 –
1 ’Ô«±»¡ 3º
41
NSOU
11.8 Î¬◊Mı˛˜±˘±
1. (i) ’ı˜ z = 2x11 + x12 + 3x21 + 4x22,

˙Ó«¬¸±À¬ÛÀé¬, x11 + x12 = 10
x21 + x22 = 12
x11 + x21 = 8
x12 + x22 = 14
x11 0, x12 0, x21 0, x22 0
2. (ii) ’ı˜ z = 2x11 + x12 + 3x13 + 2x14
+ 3x21 + x22 + 4x24
+ 5x31 + 3x32 + 2x33 + 8x32
˙Ó«¬¸±À¬ÛÀé¬, x11 + x12 + x13 + 2x14 = 30,
x21 + x22 + x23 + x24 = 50,
x31 + x32 + x33 + x34 = 20,
x11 + x21 + x31 = 20,
x12 + x22 + x32 = 40,
x13 + x23 + x33 = 30,
x14 + x24 + x34 = 10,
xij + 0, (i = 1 , 2, 3; j = 1, 2, 3, 4)
2. Non-degenerate Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú †
LM1 1 0 0OP
MM01 00 11 10PP
N0 1 0 1Q
42
NSOU
¤fl¬fl¬ 12
¬¤fl¬fl¬ ❑ ¬Ûøı˛ ı ˝Ì ˜ÀÎ¬À˘ øıøˆ¬iß ¬ÛX¬øÓ¬ı˛ √ õ ∂À˚˛ ± ·
[Application of Different Methods in
Transportation Model]
·Í¬Ú
√ 12.1 õ∂ô¶∏ ± ıÚ±
√ 12.2 ¸˜Ó¬±¬Û” Ì « ¬Ûøı˛ ı ˝Ú ¸˜¸…±ı˛ √ õ ∂±ı˛ ø y¬fl¬ Œ˜Ã˘ fl¬±˚« fl ¬ı˛ ¸˜±Ò±Ú (Initial
basic feasible solution) øÚÌ« À ˚˛ ı ˛ fl¬À˚˛ fl ¬øÈ¬ ¬ÛX¬øÓ¬º
√ 12.3 Œfl¬±Ú Œ˜Ã˘ fl¬±˚« fl ¬ı˛ ¸˜±Ò±Ú ‰¬ı˛ ˜ ¸˜±Ò±Ú ˝Àı øfl¬Ú± Ó¬±ı˛ ¬Ûı˛ œ é¬±
(Test for optimality of a basic feasible solution)º
√ 12.4 Î¬◊  ±˝ı˛ Ì
√ 12.5 ’¸˜Ó¬±¬Û” Ì « ¬Ûøı˛ ı ˝Ú ¸˜¸…±
√ 12.6 ¸±ı˛ ± —˙
√ 12.7 ’Ú≈ ˙ œ˘Úœ
√ 12.8 Î¬◊ M ı˛ ˜ ±˘±
12.1 õ∂ô¶∏ ± ıÚ±
¤fl¬fl¬ 11-ŒÓ¬ ’±˜ı˛± ¬Ûøı˛ı˝Ú ¸˜¸…±Àfl¬ øıÀ˙¯∏ ’±fl¬±Àı˛ı˛ L.P.P. ø˝¸±Àı √õ∂fl¬±˙ fl¬Àı˛øÂ ¤ı— √õ∂˜±Ì
fl¬Àı˛øÂ Œ˚ Œfl¬±Ú ¸˜Ó¬±¬Û”Ì« ¬Ûøı˛ı˝Ú ¸˜¸…±ı˛ ‰¬ı˛˜ ¸˜±Ò±Ú (optimal solution) ¬Û±›˚˛± ˚±Àıº ¤‡Ú
L.P.P.-¤ı˛ Œ˜Ã˘ Î¬◊¬Û¬Û±… (Fundamental Theorem) ŒÔÀfl¬ ’±˜ı˛± Ê±øÚ Œ˚ Œfl¬±Ú L.P.P.-ı˛ ‰¬ı˛˜
¸˜±Ò±Ú ¬Û±›˚˛± Œ·À˘ ’ôL√Ó¬ ¤fl¬øÈ¬ ‰¬ı˛˜ ¸˜±Ò±Ú Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú ˝Àıº
Œfl¬±Ú ¬Ûøı˛ı˝Ú ¸˜¸…± ¸˜±Ò±Ú fl¬ı˛ÀÓ¬ ı˘À˘ ¸˜¸…±øÈ¬ı˛ Œ˚ Œfl¬±Ú ‰¬ı˛˜ ¸˜±Ò±Ú (optimal solution)
¤ı— Ú”…ÚÓ¬˜ ¬Ûøı˛ı˝Ú ‡ı˛À‰¬ı˛ ˜±Ú øÚÌ«˚˛ fl¬ı˛ÀÓ¬ ˝Àıº ¤ı˛ ÊÚ… ¤‡±ÀÚ ’±˜ı˛± Œ˚ Œfl¬±Ú ¤fl¬øÈ¬ ¬ÛX¬øÓ¬ÀÓ¬
ï¬Ûı˛ıÓ¬œ« ’Ú≈ÀBÂÀ √õ∂±ı˛øy¬fl¬ Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú øÚÌ«À˚˛ı˛ øıøˆ¬iß ¬ÛX¬øÓ¬ ı˘± ˝À˚˛ÀÂó ¸˜¸…±øÈ¬ı˛ ¤fl¬øÈ¬
Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú øÚÌ«˚˛ fl¬ı˛ıº ¤ı˛ ¬Ûı˛ Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±ÚøÈ¬ ‰¬ı˛˜ ¸˜±Ò±Ú ˝Àı øfl¬Ú± Ó¬± ¬Ûı˛œé¬±
fl¬Àı˛ Œ‡± ˝Àıº ˚ø √õ∂±ı˛øy¬fl¬ Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±ÚøÈ¬ ‰¬ı˛˜ ¸˜±Ò±Ú Ú± ˝˚˛ Ó¬±˝À˘ øıÀ˙¯∏ ¬ÛX¬øÓ¬ÀÓ¬
43
NSOU
ï˚± 12·4 ’Ú≈ÀBÂ ı˘± ˝À˚˛ÀÂó ¸˜¸…±øı˛ ’Ú… ¤fl¬øÈ¬ Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú øÚÌ«˚˛ fl¬ı˛± ˝Àı Œ˚‡±ÀÚ
øZÓ¬œ˚˛ Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±ÀÚı˛ ÊÚ… Œ˜±È¬ ¬Ûøı˛ı˝Ú ‡ı˛À‰¬ı˛ ˜±Ú √õ∂±ı˛øy¬fl¬ ¸˜±Ò±ÀÚı˛ ÊÚ… Œ˜±È¬ ¬Ûøı˛ı˝Ú
‡ı˛À‰¬ı˛ ˜±ÀÚı˛ Œ‰¬À˚˛ fl¬˜ ˝Àıº ¤˝◊ˆ¬±Àı ’±˜ı˛± ¤fl¬øÈ¬ Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú øÚÌ«˚˛ fl¬ı˛ÀÓ¬ ¬Û±ı˛ı Œ˚
¸˜±Ò±ÀÚı˛ ÊÚ… Œ˜±È¬ ¬Ûøı˛ı˝Ú ‡ı˛‰¬ ¸ıÀ‰¬À˚˛ fl¬˜ ˝Àıº ˚ø ¸˜¸…±øÈ¬ ¸˜Ó¬±¬Û”Ì« Ú± ˝˚˛ Ó¬±˝À˘ ¸˜¸…±øÈ¬Àfl¬
¸˜Ó¬±¬Û”Ì« ¸˜¸…±˚˛ ı˛+¬Û±ôL√ı˛ fl¬Àı˛ ¸˜±Ò±Ú fl¬ı˛± ˚±˚˛ ï’Ú≈ÀBÂ 12·6 Œ‡≈Úóº
12.2 ¸˜Ó¬±¬Û” Ì « ¬Ûøı˛ ı ˝Ú ¸˜¸…±ı˛ √ õ ∂±ı˛ ø y¬fl¬ Œ˜Ã˘ fl¬±˚« fl ¬ı˛

¸˜±Ò±Ú (Initial basic feasible solution) øÚÌ« À ˚˛ ı ˛
fl¬À˚˛ fl ¬øÈ¬ ¬ÛX¬øÓ¬
(a) North-West corner ¬ÛX¬øÓ¬ †
¤˝◊ ¬ÛX¬øÓ¬ÀÓ¬ ¬Ûøı˛ı˝Ú ÂÀfl¬ı˛ ı±˜øÀfl¬ı˛ (West-¤ı˛ó ¸ı«±À¬Ûé¬± Î¬◊¬ÛÀı˛ı˛ cell-¤ ’Ô«±» North
position-¤ı˛ cell ¤ ’Ô«±» (1, 1) Cell-¤ ‰¬±ø˝± ’Ú≈¸±Àı˛ øÊøÚ¸ √õ∂±Ú (allocate) fl¬ı˛ÀÓ¬ ˝Àıº
˚ø Î¬◊»À¸ı˛ (origin) é¬˜Ó¬± ·ôL√ı…îÀ˘ı˛ (Destination) ‰¬±ø˝±ı˛ ŒÔÀfl¬ Œıø˙ ˝˚˛, Ó¬±˝À˘ Ó¬±ı˛ øÍ¬fl¬
Î¬±Ú øÀfl¬ı˛ cell-¤ ’Ô«±» (1, 2) cell-¤ ‰¬±ø˝± › Œ˚±·±ÀÚı˛ ’Ú≈¸±Àı˛ øÊøÚ¸ √õ∂±Ú fl¬ı˛ÀÓ¬ ˝Àıº
’±ı±ı˛ ·ôL√ı…îÀ˘ı˛ ‰¬±ø˝± ˚ø Î¬◊»À¸ı˛ é¬˜Ó¬±ı˛ ŒÔÀfl¬ Œıø˙ ˝˚˛ Ó¬±˝À˘ (1, 1) cell-¤ı˛ øÍ¬fl¬ øÚÀ‰¬ı˛
cell ’Ô«±» (2, 1) cell-¤ ‰¬±ø˝± › Œ˚±·±ÀÚı˛ ’Ú≈¸±Àı˛ øÊøÚ¸ √õ∂±Ú fl¬ı˛ÀÓ¬ ˝Àıº ¤˝◊ ¬ÛX¬øÓ¬ √õ∂À˚˛±·
fl¬Àı˛ ˚‡Ú ·ôL√ı…î˘&ø˘ı˛ ‰¬±ø˝± Œ˜È¬±ÀÚ± ¸•Û”Ì« ˝˚˛, Ó¬‡Ú √õ∂±ı˛øy¬fl¬ ¸˜±Ò±ÚøÈ¬ ¬Û±›˚˛± ˚±Àıº
¤fl¬øÈ¬ Î¬◊±˝ı˛ÀÌı˛ ¸±˝±À˚… ¬ÛX¬øÓ¬øÈ¬ Œı±Á¬±ÀÚ± ˝ÀBÂ †
øÚÀ‰¬ı˛ ¬Ûøı˛ı˝Ú ¸˜¸…±øÈ¬ı˛ ¤fl¬øÈ¬ √õ∂±ı˛øy¬fl¬ fl¬±˚«…fl¬ı˛ ¸˜±Ò±Ú øÚÌ«˚˛ fl¬ı˛ÀÓ¬ ˝Àıº
D1 D2 D3 D4 ai
O1 5 3 6 4 30
O2 3 4 7 8 15
O3 9 6 5 8 15
bj 10 25 18 7
¤‡±ÀÚ, 3ai = 30 + 15 + 15 = 60
3bj = 10 + 25 + 18 = 60
\ 3ai = 3bj
\ ¬Ûøı˛ı˝Ì-¸˜¸…±øÈ¬ ¸˜Ó¬±¬Û”Ì« (balanced)º
¬Ûøı˛ı˝Ì Âfl¬øÈ¬ı˛ ı±˜øÀfl¬ı˛ ¸ıÀÔÀfl¬ Î¬◊¬ÛÀı˛ı˛ position ’Ô«±» (1, 1) cell-¤ x12 = min
(10,30)=10 ¬Ûøı˛˜±Ì øÊøÚ¯∏ √õ∂±Ú (allocate) fl¬ı˛± ˝˘º
44
NSOU
D1 ·ôL√ı…îÀ˘ı˛ ‰¬±ø˝± øÂ˘ 10øÈ¬ øÊøÚ¯∏º ¤˝◊ ¬Ûøı˛˜±Ì øÊøÚ¯∏ D1 ¤ Œ¬Û“ÃÂ±ÀÚ±ı˛ Ù¬À˘ D1 ¤ı˛ ’±ı˛
Œfl¬±Ú ‰¬±ø˝± Ô±fl¬ÀÂ Ú±º D1 Î¬◊»À¸ (orgin) ’±ı˛› 20øÈ øÊøÚ¯∏ Œ˚±·±Ú Œ›˚˛±ı˛ é¬˜Ó¬± ’±ÀÂº
’±˜ı˛± øÍ¬fl¬ Ó¬±ı˛ Î¬±ÚøÀfl¬ı˛ ¬Û±À˙ı˛ cell (1, 2) cell-¤ x12 = min (30-10-25) = min (20,
25) = 20 √õ∂±Ú fl¬ı˛ıº ¤‡Ú Œ‡± ˚±ÀBÂ O1 D D D D
1 2 3 4
Î¬◊»À¸ı˛ ’±ı˛ Œfl¬±Ú Œ˚±·±Ú Œ›˚˛±ı˛ é¬˜Ó¬± ŒÚ˝◊º 20
O 10 20
øfl¬c√ D1 ·ôL√ı…îÀ˘ı˛ ‰¬±ø˝± ¬Û≈Àı˛±¬Û≈øı˛ Œ˜ÀÈ¬øÚº 1 5 3 6 4 30
¸≈Ó¬ı˛±— (1, 2) cell-¤ı˛ øÍ¬fl¬ øÚÀ‰¬ ’Ô«±» (2, 2)
5 10 10
cell-¤ x22 = min (5, 15) = 5 √õ∂±Ú fl¬ı˛± O2
3 4 7 8 15
˝Àıº Q1 Î¬◊»À¸ı˛ ¤‡Ú› Œ›˚˛±ı˛ é¬˜Ó¬± Ô±fl¬˘
10º (2, 2) cell-¤ı˛ øÍ¬fl¬ Î¬±ÚøÀfl¬ ’Ô«±» (2, 8 7 7
O3 9 6 5 15
3) cell-¤ x23 = min (10, 18) = 10√ õ∂±Ú 8
fl¬ı˛± ˝˘º O2 Î¬◊»À¸ ’±ı˛ Œfl¬±Ú› øÊøÚ¯∏ ’ıø˙©Ü 10 15 18 7
ŒÚ˝◊º (2, 3) cell-¤ı˛ øÍ¬fl¬ øÚÀ‰¬ı˛ cell ’Ô«±» 5 8
(3, 3) cell-¤ min (8, 15) = 8 √õ∂±Ú fl¬ı˛± ˝˘ (7, 7) = 7 √õ∂±Ú fl¬ı˛± ˝˘º Œfl¬±Ú Î¬◊»À¸˝◊ ’±ı˛
Œfl¬±Ú ’ıø˙©Ü øÊøÚ¯∏ Ô±fl¬˘ Ú± ¤ı— ¸˜ô¶∏ ·ôL√ı…îÀ˘ı˛ ‰¬±ø˝± ø˜ÀÈ¬ Œ·ÀÂº ¸≈Ó¬ı˛±— ¸˜¸…±øÈ¬ı˛ ¤fl¬øÈ¬
√õ∂±ı˛øy¬fl¬ ¸˜±Ò±Ú ¬Û±›˚˛± Œ·ÀÂº
¸˜±Ò±øÚøÈ¬ ˝˘ † x11 = 10, x12 = 20, x22 = 5, x23 = 10, x33 = 8, x34 = 7
¤ı— ¤Àé¬ÀS ¬Ûøı˛ı˝Ì ‡ı˛‰¬ = 10 × 5 + 20 × 3 + 5 × 4 + 10 × 7 + 8 × 5 + 7 × 8
= 50 + 60 + 20 +70 + 40 + 56 = 256 ¤fl¬fl¬º
¸˜±Ò±ÚøÈ¬ øÚÀÈ¬ı˛ ÂÀfl¬ Œ‡±ÀÚ± ˝˘ †
D1 D2 D3 D4
10 20
O1 5 3 6 4 30
5 10
O2 7 8 15
3 4
8 7
O3 9 6 5 8 15
10 15 18 7
¸˜±Ò±øÚøÈ¬ ˝˘ † x11 = 10, x12 = 20, x22 = 5, x23 = 10, x33 = 8, x34 = 7
¤ı— ¤Àé¬ÀS ¬Ûøı˛ı˝Ì ‡ı˛‰¬ = 10 × 5 + 20 × 3 + 5 × 4 + 10 × 7 + 8 × 5 + 7 × 8
= 50 + 60 + 20 +70 + 40 + 56 = 256 ¤fl¬fl¬º
45
NSOU
¤˝◊ ¸˜±Ò±ÀÚı˛ Œ˚ Œ˚ cell-¤ øÊøÚ¯∏ √õ∂±Ú fl¬ı˛± ˝À˚˛ÀÂ Œ¸&À˘± ı± Ó¬±ı˛ Œfl¬±Ú ¸±ı-Œ¸Èƒ¬ (subset
Œfl¬±Ú ˘≈¬Û (loop) ΔÓ¬øı˛ fl¬ı˛ÀÂ Ú±º ¸≈Ó¬ı˛±— ¤˝◊ ¸˜±Ò±ÚøÈ¬ ¤fl¬øÈ¬ Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú ˝Àıº
(b) Matrix Minima Method :
¤˝◊ ¬ÛX¬øÓ¬ÀÓ¬ ¬Ûøı˛ı˝Ì ÂÀfl¬ı˛ Œ˚ cell-¤ ¬Ûøı˛ı˝Ì ‡ı˛‰¬ (cost) ¸ıÀÔÀfl¬ fl¬˜ Œ¸˝◊ cell-¤ øÊøÚ¯∏
√õ∂±Ú fl¬ı˛ÀÓ¬ ˝Àıº ˚ø ¤fl¬±øÒfl¬ cell-¤ min cost Ô±Àfl¬ Œ˚ Œfl¬±Ú cell-˝◊ ·Ë˝Ì fl¬ı˛± Œ˚ÀÓ¬ ¬Û±Àı˛º
Î¬◊±˝ı˛ÀÌı˛ ¸±˝±À˚… ¬ÛX¬øÓ¬øÈ¬ Œı±Á¬±ÀÚ± ˝˘ †
øÚÀ‰¬ı˛ ¬Ûøı˛ı˝Ì ¸˜¸…±øÈ¬ı˛ √õ∂±ı˛øy¬fl¬ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú øÚÌ«˚˛ fl¬ı˛ÀÓ¬ ˝Àıº
D1 D2 D3 D4 ai
O1 1 2 1 4 30
O2 3 3 2 1 50
O3 4 2 5 9 20
bj 20 40 30 10
¸˜±Ò±Ú † ¤‡±ÀÚ, 3ai = 30 + 50 + 20 = 100

3bj = 20 + 40 + 30 = 100
\ 3ai = 3bj
¬ \ Ûøı˛ı˝Ì ¸˜¸…±øÈ¬ ¸˜Ó¬±¬Û”Ì« (balanced)º
¬Ûøı˛ı˝Ì ÂÀfl¬ min ‡ı˛‰¬ ˝ÀBÂ 1, ˚± (1, 1), D1 D2 D3 D4
(1, 3) ¤ı— (2, 4) cell-¤ øı…˜±Úº ’±˜ı˛± ¤Àı˛ O 20 1 .. 2 1 4 30
10
˜ÀÒ… Œ˚ Œfl¬±Ú ¤fl¬øÈ¬ cell-Œfl¬ ŒıÀÂ øÚ˝◊º (1, 1)
1
.
O2 . 50
cell-¤ x11 = min (20, 30) = 20 √õ∂±Ú fl¬øı˛º 3 . 3 2 1
.
D1 ·ôL√ı…îÀ˘ı˛ ‰¬±ø˝± ‚ÀÈ¬˚±›˚˛±˚˛ D1 ’Ô«±» √õ∂Ô˜ O3 4 . 2 5 9 20
.
ô¶∏y¬Àfl¬ ˜…±øÈ¬™' ŒÔÀfl¬ ı± øÀ˚˛ Œ›˚˛± ˝˘º øÚÀ‰¬ı˛ 20 40 30 10
Âfl¬øÈ¬ ¬Û±›˚˛± Œ·˘º
D2 D3 D4
O1 . . . 2. . . . 10
. . .1. . . . . . .4. . 10
O2 3 2 1 50
O3 2 5 9 20
40 30 10
20
46
NSOU
¤˝◊ ˜…±øÈ¬™À' (1, 2) cell-¤ x12 = min (30, 10) √õ∂±Ú fl¬ı˛± ˝˘º O1 Î¬◊»À¸ ’±ı˛ Œfl¬±Ú øÊøÚ¯∏
’ıø˙©Ü Ô±fl¬˘ Ú±º O2-Œfl ’Ô«±» √õ∂Ô˜ ¸±øı˛Àfl¬ ı± øÀ˚˛ Œ›˚˛± ˝˘º
øÚÀ‰¬ı˛ ˜…±øÈ¬™'øÈ¬ ¬Û±›˚˛± Œ·˘º D D D
2 3 4
.
O2 10
3 2 1 .. 40
.
O3 .
2 5 9 . 20
.
40 20 10
Î¬◊¬ÛÀı˛ı˛ ¬ÛX¬øÓ¬ ’±ı±ı˛ √õ∂À˚˛±· fl¬ı˛± ˝˘ †
D2 D3
. 20
O2 20 .
3 2 . 40
.
.
O3 2 5 . 20
.
40 20
D2
O2 20 30 20
20
O3 2 20
40
¸˜±Ò±ÚøÈ¬ ¬Û±À˙ı˛ ÂÀfl¬ Œ‡±ÀÚ± ˝˘º
D1 D2 D3 D4
20 10
O1 1 2 1 4 30
20 20 10
O2 3 3 2 1 15
2
O3 4 2 5 9 15
20 40 30 10
¸˜±Ò±ÚøÈ¬ ˝˘ † x11 = 20, x13 = 10, x22 = 20, x23 = 20, x24 = 10, x32 = 20
¤ı— ¤Àé¬ÀS ¬Ûøı˛ı˝Ì ‡ı˛‰¬ = 20 × 1 + 10 × 1 + 20 × 3 + 20 × 2 + 10 × 1 + 20 × 2
= 20 + 10 + 60 +40 + 10 + 40 = 100 ¤fl¬fl¬º
¤˝◊ ¸˜±Ò±ÀÚı˛ Œ˚ Œ˚ cell-¤ øÊøÚ¯∏ √õ∂±Ú fl¬ı˛± ˝À˚˛ÀÂ Œ¸&À˘± ı± Ó¬±ı˛ Œfl¬±Ú ¸±ı-Œ¸Èƒ¬ (subset)
Œfl¬±Ú ˘≈¬Û (loop) ΔÓ¬øı˛ fl¬ı˛ÀÂ Ú±º ¸≈Ó¬ı˛±— ¤˝◊ ¸˜±Ò±ÚøÈ¬ ¤fl¬øÈ¬ √õ∂±ı˛øy¬fl¬ Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú ˝Àıº
47
NSOU
(c) Vogel’s Approximation Method (VAM) :
¤˝◊ ¬ÛX¬øÓ¬ÀÓ¬ ¬Ûøı˛ı˝Ì ÂÀfl¬ı˛ √õ∂øÓ¬øÈ¬ ¸±øı˛ı˛ ¸ıÀÔÀfl¬ fl¬˜ ‡ı˛‰¬ › Ó¬±ı˛ ¬Ûı˛ıÓ«¬œ ‡ı˛À‰¬ı˛ øıÀ˚˛±·Ù¬˘
Œıı˛ fl¬Àı˛ √õ∂øÓ¬øÈ¬ ¸øı˛ı˛ (row) ¬Û±À˙ ï¤ı˛ ˜ÀÒ…ó ø˘‡ÀÓ¬ ˝Àıº ’Ú≈ı˛+¬Ûˆ¬±Àı √õ∂øÓ¬øÈ¬ ô¶∏y¬ (column) ¤ı˛
¸ıÀÔÀfl¬ fl¬˜ ‡ı˛‰¬ › Ó¬±ı˛ ¬Ûı˛ıÓ«¬œ ‡ı˛À‰¬ı˛ øıÀ˚˛±·Ù¬˘ Œıı˛ fl¬Àı˛ √õ∂øÓ¬øÈ¬ ô¶∏Ày¬ı˛ øÚÀ‰¬ ï ó ¤ı˛ ˜ÀÒ… ø˘‡ÀÓ¬
˝Àıº ¤˝◊ øıÀ˚˛±·Ù¬˘ (penalty) &ø˘ı˛ ˜ÀÒ… ¸ıÀÔÀfl¬ ıh¬ penalty ¬øÈ¬ Œ˚ ¸±øı˛ ı± ô¶∏Ày¬ ’±ÀÂ Œ¸˝◊ ¸±øı˛
ı± ô¶∏Ày¬ı˛ ¸ıÀÔÀ‡ fl¬˜ ‡ı˛‰¬ (min cost) Œ˚ cell-¤ ’±ÀÂº Œ¸˝◊ cell-¤ øÊøÚ¯∏ √õ∂±Ú fl¬ı˛ÀÓ¬ ˝Àıº
øÚÀ‰¬ı˛ ¬Ûøı˛ı˝Ì ¸˜¸…±øÈ¬ı˛ √õ∂±ı˛øy¬fl¬ fl¬±˚«…fl¬ı˛ ¸˜±Ò±Ú øÚÌ«˚˛ fl¬ı˛ÀÓ¬ ˝Àıº
D1 D2 D3 D4 ai
O1 2 3 11 7 6
O2 1 2 6 1 1
O3 5 8 15 9 10
bj 7 5 3 2
¸˜±Ò±Ú † ¤‡±ÀÚ, 3ai = 6 + 1 + 10 = 17
3bj = 7 + 5 + 3 + 2 = 17
\ 3ai = 3bj
√õ∂øÓ¬øÈ¬ ¸±øı˛ı˛ ¸ıÀÔÀfl¬ fl¬˜ ‡ı˛‰¬ › Ó¬±ı˛ ¬Ûı˛ıÓ«¬œ
D1 D2 D3 D4 ai
‡ı˛À‰¬ı˛ øıÀ˚˛±·Ù¬˘ Œıı˛ fl¬Àı˛ √õ∂øÓ¬øÈ¬ ¸±øı˛ı˛ ¬Û±À˙
Œ˘‡± ˝˘º ’±ı±ı˛ √õ∂øÓ¬øÈ¬ ô¶∏Ày¬ı˛ ¸ıÀÔÀfl¬ fl¬˜ O1 2 3 11 7 6 (1)
‡ı˛‰¬ ¤ı— ¬Ûı˛ıÓ«¬œ ‡ı˛À‰¬ı˛ øıÀ˚˛±·Ù¬˘ Œıı˛ fl¬Àı˛ O . . . 1. . . . .. . 2. . . . . . .6. . . . .1. .1. . 1 (0)
2
√õ∂øÓ¬øÈ¬ ô¶∏Ày¬ı˛ øÚÀ‰¬ Œ˘‡± ˝˘º ¤˝◊ øıÀ˚˛±·Ù¬˘&ø˘ı˛
˜ÀÒ… ı‘˝M˜ ˝˘ 6 ¤ı— ˝◊˝± ‰¬Ó≈¬Ô« ô¶∏Ày¬ ’ıøîÓ¬º O3 5 8 15 9 10 (4)
¤˝◊ ‰¬Ó≈¬Ô« ô¶∏Ày¬ min cost = 1 ˚±, (2, 4) cell- bj 7 5 3 21
(1) (1) (5) (6)
¤ ’±ÀÂº (2, 4) cell-¤ x24 = min (2, 1) = 1
√õ∂±Ú fl¬ı˛± ˝˘º O2 Î¬◊»À¸ ’±ı˛ Œfl¬±Ú øÊøÚ¸ ’ıø˙©Ü Ú± Ô±fl¬±˚˛ øZÓ¬œ˚˛ ¸±øı˛øÈ¬ ı± Œ›˚˛± ˝˘º
øÚÀ‰¬ı˛ Âfl¬øÈ¬ ¬Û±›˚˛± Œ·˘ † D1 D2 D3 D4
5 1
O2 2 3 11 7 6 (1)
O3 5 8 15 9 10 (3)
7 5 3 1
(3) (5) (4) (2)
48
NSOU
ı‘˝M˜ øıÀ˚˛±·Ù¬˘øÈ¬ øZÓ¬œ˚˛ ô¶∏Ày¬ ’ıøîÓ¬º øZÓ¬œ˚˛ ô¶∏Ày¬ min cost = 3º (1, 2) cell-¤ min
(5, 6) = 5 √õ∂±Ú fl¬ı˛± ˝˘º D2 ¤ı˛ ¸˜ô¶∏ ‰¬±ø˝± ø˜ÀÈ¬ Œ·ÀÂº
D1 D3 D4
1
O1 2 11 7 1 (5)
O3 5 15 9 10 (4)
76 3 1
(3) (4) (2)
D1 D3 D4
1 5 1
O3 10
5 15 9
6 3 1
¸˜±Ò±ÚøÈ¬ øÚÀ‰¬ı˛ ÂÀfl¬ Œ‡±ÀÚ± ˝˘ †
D1 D2 D3 D4
O1 1 2 5
3 11 7 6
O2 1 1
1 2 6 1
O3 6 5 8
3
15
1
9 10
7 5 3 2
¸˜±Ò±ÚøÈ¬ ˝˘ † x11 = 1, x12 = 5, x24 = 1, x31 = 6, x33 = 3, x34 = 1
¤ı— ¤Àé¬ÀS ¬Ûøı˛ı˝Ì ‡ı˛‰¬ = 1 × 2 + 5 × 3 + 1 × 1 + 6 × 5 + 3 × 15 + 1 × 9
= 2 + 15 + 1 + 30 + 45 + 9 = 102 ¤fl¬fl¬º
¤˝◊ ¸˜±Ò±ÀÚı˛ Œ˚ Œ˚ cell-¤ øÊøÚ¯∏ √õ∂±Ú fl¬ı˛± ˝À˚˛ÀÂ Œ¸&À˘± ı± Ó¬±ı˛ Œfl¬±Ú ¸±ı-Œ¸È¬ (subset)
(d) Row-minima ¬ÛX¬øÓ¬ †
¤˝◊ ¬ÛX¬øÓ¬ÀÓ¬ √õ∂Ô˜ ¸±øı˛ÀÓ¬ ¸ı ŒÔÀfl¬ fl¬˜ ¬Ûøı˛ı˝Ì ‡ı˛‰¬ Œ˚ cell-¤ ’±ÀÂ Ó¬± ŒıÀÂ øÚÀÓ¬ ˝Àıº
Ó¬±ı˛¬Ûı˛ ‹ cell-¤ ˚Ó¬ Œıø˙ ¸y¬ı øÊøÚ¯∏ √õ∂±Ú fl¬ı˛ÀÓ¬ ˝Àıº ˚ø ¤fl¬±øÒfl¬ cell-¤ min cost Ô±Àfl¬
Ó¬±˝À˘ Œ˚ Œfl¬±Ú cell-˝◊ ŒÚ›˚˛± Œ˚ÀÓ¬ ¬Û±Àı˛º
49
NSOU
øÚÀ‰¬ı˛ ¬Ûøı˛ı˝Ì ¸˜¸…±øÈ¬ı˛ √õ∂±ı˛øy¬fl¬ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú øÚÌ«˚˛ fl¬ı˛ÀÓ¬ ˝Àıº
D1 D2 D3 D4 ai
O1 25 5 30 5
23 27 16 18
O2 16 12 18 17 20 51 40 18
O3 22 17 28 12
36
32 53 36
bj 22 35 25 41
17 36
¸˜±Ò±Ú † ¤‡±ÀÚ, 3ai = 30 + 40 + 53 = 123

3bj = 22 + 35 + 25 + 41 = 123
\ 3ai = 3bj
√õ∂Ô˜ ¸±øı˛ÀÓ¬ (row) ¸ı ŒÔÀfl¬ fl¬˜ ‡ı˛‰¬ 16 ˚± (1, 3) cell-¤ ’ıøîÓ¬º a(1, 3) cell-¤ x13 =
min (25, 30) = 25 √õ∂±Ú fl¬ı˛± ˝˘º D3 ·ôL√ı…îÀ˘ı˛ ‰¬±ø˝± ø˜ÀÈ¬ ˚±›˚˛±˚˛ D3 ’Ô«±» Ó‘¬Ó¬œ˚˛ ô¶∏y¬Àfl¬
˜…±øÈ¬™' ŒÔÀfl¬ ı± Œ›˚˛± ˝˘º O1 Î¬◊»À¸ ¤‡Ú 5øÈ¬ øÊøÚ¯∏ ¬ÛÀh¬ ı˛±˝◊˘º ’±ı±ı˛ √õ∂Ô˜ ¸±øı˛ÀÓ¬ Ó¬±ı˛
¬ÛÀı˛ı˛ é≈¬^Ó¬˜ ‡ı˛‰¬ 18 ˚± (1, 4) cell-¤ ’ıøîÓ¬º (1, 4) cell-¤ x14 = min (41, 4) = 5 √õ∂±Ú
fl¬ı˛± ˝˘º O1 Î¬◊»À¸ı˛ ’±ı˛ Œfl¬±Ú øÊøÚ¸ ’ıø˙©Ü Ô±fl¬ÀÂ Ú±º O1 Î¬◊»¸Àfl¬ ı± Œ›˚˛± ˝˘º ¤‡Ú,
øZÓ¬œ˚˛ ¸±øı˛ÀÓ¬ ¸ıÀÔÀfl¬ fl¬˜ ‡ı˛‰¬ (2, 1) cell-¤, (2, 1_ cell-¤ x21 = min (22, 40) = 22 √õ∂±Ú
fl¬ı˛± ˝˘º D1 ·ôL√ı… îÀ˘ı˛ ‰¬±ø˝± ¬Û≈Àı˛±¬Û≈øı˛ ø˜ÀÈ¬ ˚±›˚˛±˚˛ √õ∂Ô˜ ô¶∏y¬øÈ¬ ı± Œ›˚˛± ˝˘º øZÓ¬œ˚˛
¸±øı˛ÀÓ¬ ¤‡Ú é≈¬^Ó¬˜ ‡ı˛‰¬ (2, 2) cell-¤, (2, 2) cell-¤ x22 = min (35, 18) = 18 √õ∂±Ú fl¬ı˛±
˝˘º O2 Î¬◊»À¸ı˛ ’±ı˛ Œfl¬±Ú øÊøÚ¯∏ Œ›˚˛±ı˛ é¬˜Ó¬± ŒÚ˝◊º Œ¸ÊÚ… øZÓ¬œ˚˛ ¸±øı˛ ı± Œ›˚˛± ˝˘º Ó‘¬Ó¬œ˚˛
¸±øı˛ÀÓ¬ é≈¬^Ó¬˜ ‡ı˛‰¬ (3, 2) cell, (3, 2) cell-¤ x32 = min (17, 53) = 17 √õ∂±Ú fl¬ı˛± ˝˘º D2
·ôL√ı…îÀ˘ı˛ ¸˜ô¶∏ ‰¬±ø˝± ø˜ÀÈ¬ Œ·ÀÂº ¸≈Ó¬ı˛±— øZÓ¬œ˚˛ ô¶∏y¬øÈ¬ ı± Œ›˚˛± ˝˘º ¤‡Ú ’ıø˙©Ü î±Ú (3,
4) cell-¤ min (36, 36) √õ∂±Ú fl¬ı˛± ˝˘º Œfl¬±Ú Î¬◊»À¸˝◊ ’±ı˛ Œfl¬±Ú ’ıø˙©Ü øÊøÚ¸ Ô±fl¬˘ Ú± ıı˛—
¸˜ô¶∏ ·ôL√ı…îÀ˘ı˛ ‰¬±ø˝± ø˜ÀÈ¬ Œ·ÀÂº ¸≈Ó¬ı˛±— ¸˜¸…±øÈ¬ı˛ ¤fl¬øÈ¬ √õ∂±ı˛øy¬fl¬ ¸˜±Ò±Ú ¬Û±›˚˛± Œ·ÀÂº
¸˜±Ò±ÚøÈ¬ ˝˘ † x13 = 25, x14 = 5, x21 = 2, x22 = 18, x32 = 17, x34 = 36
¤ı— ¤Àé¬ÀS ¬Ûøı˛ı˝Ì ‡ı˛‰¬ = 25 × 16 + 18 × 22 × 12 + 18 + 17 × 17 + 28 × 36 × 32
= 400 + 90 + 264 + 306 + 476 + 1125 = 2688 ¤fl¬fl¬º
¤˝◊ ¸˜±Ò±ÀÚı˛ Œ˚ Œ˚ cell-¤ øÊøÚ¯∏ √õ∂±Ú fl¬ı˛± ˝À˚˛ÀÂ Œ¸&À˘± ı± Ó¬±ı˛ Œfl¬±Ú ¸±ı-Œ¸È¬ (subset)
50
NSOU
(f) Column-Minima Method :
¤˝◊ ¬ÛX¬øÓ¬ øÍ¬fl¬ ’±À·ı˛ ¬ÛX¬øÓ¬ı˛ ’Ú≈ı˛+¬Ûº Œfl¬ı˘˜±S ¸±øı˛ı˛ Ê±˚˛·±˚˛ ô¶∏y¬ ÒÀı˛ ’±À·ı˛ ¬ÛX¬øÓ¬ÀÓ¬
¤ø·À˚˛ Œ·À˘˝◊ ¸˜±Ò±Ú ¬Û±›˚˛± ˚±Àıº
12.3 Œfl¬±Ú Œ˜Ã˘ fl¬±˚« fl ¬ı˛ ¸˜±Ò±Ú ‰¬ı˛ ˜ ¸˜±Ò±Ú ˝Àı øfl¬Ú±
Ó¬±ı˛ ¬Ûı˛ œ é¬± (Test for optimality of a basic fea-
sible solution)¬
’±˜ı˛± Ê±øÚ Œ˚ m ¸—‡…fl¬ Î¬◊»¸î˘ › n ¸—‡…fl¬ ·ôL√ı…î˘ øıø˙©Ü ¬Ûøı˛ı˝Ú ¸˜¸…±ı˛ Œé¬ÀS Œ˜Ã˘
‰¬À˘ı˛ ¸—‡…± ¸ı«±øÒfl¬ m + n – 1 ˝Àıº ¸≈Ó¬ı˛±— ¤Àé¬ÀS Œfl¬±Ú Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú Œfl¬ ¬Ûøı˛ı˝Ì
ÂÀfl¬ Œ‡±ÀÚ± ˝À˘ ¸ı«±øÒfl¬ m + n – 1 ¸—‡…fl¬ occupied cell ¬Û±›˚˛± ˚±Àıº
¤‡Ú øÚÀ‰¬ ¤fl¬øÈ¬ Î¬◊¬Û¬Û±… ï√õ∂˜±Ì Â±h¬±ó øıı‘Ó¬ fl¬ı˛± ˝˘ Œ˚ Î¬◊¬Û¬Û±… Œfl¬±Ú Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú
‰¬ı˛˜ ¸˜±Ò±Ú (Optimal solution) ˝Àı øfl¬Ú± Ó¬± ¬Ûı˛œé¬± fl¬ı˛ÀÓ¬ ¸±˝±˚… fl¬ı˛Àıº
Î¬◊¬Û¬Û±… † ˚ø Œfl¬±Ú Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±ÀÚ Œ˜Ã˘ ‰¬À˘ı˛ ¸—‡…± m + n – 1 ˝˚˛ (m, n √õ∂‰¬ø˘Ó¬
’ÀÔ« ı…ı˝±ı˛ fl¬ı˛± ˝À˚˛ÀÂó ¤ı— Œfl¬±Ú Œ˜Ã˘ ‰¬À˘ı˛ ˜±Ú ˙”Ú… Ú± ˝˚˛ ’Ô«±» ˚ø ¸˜±Ò±ÚøÈ¬ non-
degenerate ˝˚˛ ¤ı— ˚ø (m + n) ¸—‡…fl¬ ¸—‡…± ui vj (i=1, 2 ...........m; j=1, 2,..........n) øÚÌ«˚˛
fl¬ı˛± ˚±˚˛ Œ˚‡±ÀÚ √õ∂ÀÓ¬…fl¬ occupied cell (i, j) ¤ı˛ ÊÚ… cij = ui + vj, Ó¬±˝À˘ √õ∂ÀÓ¬…fl¬ un
occupied (i, j)-¤ cell evaluation Dij˝Àı cij = (ui + vj) ¤ı— Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±ÚøÈ¬ ‰¬ı˛˜
¸˜±Ò±Ú ˝Àı (optimal solution) ˚ø ¬Ûøı˛ı˝Ì ÂÀfl¬ı˛ √õ∂ÀÓ¬…fl¬ cell (i, j) ¤ı˛ ÊÚ… Dij$0 ˝˚˛º
[cij ˝˘ i-Ó¬˜ Î¬◊»¸ î˘ ŒÔÀfl¬ j-Ó¬˜ ·ôL√ı… îÀ˘ ¬Û±Í¬±ÀÚ± commodity-ı˛ ¤fl¬ ¤fl¬Àfl¬ı˛ ¬Ûøı˛ı˝Ì
‡ı˛‰¬]
˜ôL√ı… †
1. ˚ø occupied cell-¤ı˛ ¸—‡…± m + n – 1 ˝˚˛ Ó¬±˝À˘ cij = ui + vj √[õ∂øÓ¬ occupied cell
(i, j)-ı˛ ÊÚ… ŒÔÀfl¬ (m + n) ’:±Ó¬ ı˛±ø˙ u1 = u2........um; v1, v2,........vn Œfl¬ øÚÀ˚˛ ( m+ n – 1)
-øÈ¬ ¸˜œfl¬ı˛Ì ¬Û±›˚˛± ˚±˚˛ ¤ı— ¤Àé¬ÀS Œ˚ Œfl¬±Ú ¤fl¬øÈ uiı± vj ¤ı˛ ˜±Ú ˚‘BÂˆ¬±Àı (arbitraily)
øÚÀ˚˛ ui (i=1, 2 ...........m) ¤ı— vj ( j=1, 2 ...........n) ¤ı˛ ˜±Ú øÚÌ«˚˛ fl¬ı˛± ˚±Àıº ¸±Ò±ı˛ÌÓ¬ Œ˚
¸±øı˛ ı± Œ˚ ô¶∏Ày¬ ¸ıÀ‰¬À˚˛ Œı˙œ ¸—‡…fl¬ cell-¤ allocation Œ›˚˛± ˝À˚˛ÀÂ ¤ı˛ ¬Ûı˛ corresponding
uiı± vj = 0 Òı˛± ˝˚˛º
2. ˚ø √õ∂ÀÓ¬…fl¬ unoccupied cell (i, j) ¤ı˛ ÊÚ… Dij = cij – (ui + vj) > 0 ˝˚˛ Ó¬±˝À˘ ¤fl¬øÈ¬
˜±S ‰¬ı˛˜ ¸˜±Ò±Ú (unique optimal solution) Ô±fl¬Àıº ˚ø √õ∂ÀÓ¬…fl¬ unoccupied cell (i, j) ¤ı˛
ÊÚ… Dij$0 ˝˚˛ ¤ı— ’ôL√Ó¬ ¤fl¬øÈ¬ un occupied cell (i, j) ¤ı˛ ÊÚ… Dij = 0 ˝˚˛º
51
NSOU
Ó¬±˝À˘ ¤fl¬±øÒfl¬ ‰¬ı˛˜ ¸˜±Ò±Ú ¬Û±›˚˛± ˚±Àı ’Ô«±» ¤Àé¬ÀS ‰¬ı˛˜ ¸˜±Ò±Ú unique ˝Àı Ú±º
3. ˚ø ’ôL√Ó¬ ¤fl¬øÈ¬ unoccupied cell ¤ı˛ Œé¬ÀS Dij<0 ˝˚˛ Ó¬±˝À˘ corresponding Œ˜Ã˘
fl¬±˚«fl¬ı˛ ¸˜±Ò±ÚøÈ¬ ‰¬ı˛˜ ¸˜±Ò±Ú ˝Àı Ú±º ¤Àé¬ÀS ‰¬ı˛˜ ¸˜±Ò±ÀÚı˛ ÊÚ… øÚ•ßø˘ø‡Ó¬ Î¬◊¬Û±À˚˛ ’Ú… ¤fl¬øÈ¬
Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú øÚÌ«˚˛ fl¬ı˛ÀÓ¬ ˝Àı †
Œ˚ unoccupied cell (i, j) ŒÓ¬ Dij<0 ¤ı— *Dij* ¸ıÀ‰¬À˚˛ Œı˙œ, Œ¸˝◊ cell-øÈ¬Àfl¬ ¤fl¬øÈ¬ basic
cell ı˛+À¬Û Òı˛± ˝Àı ¤ı— ¤˝◊ cell-¤ ¸ıÀ‰¬À˚˛ Œı˙œ ¬Ûøı˛˜±Ì ï¸˜¸…±ı˛ ˙Ó«¬ Œ˜ÀÚ ˚± ¸y¬ıó alloca-
tion fl¬ı˛ÀÓ¬ ˝Àı › ¬Ûøı˛ıÀÓ«¬ ’±À·ı˛ Œfl¬±Ú basic cell ï˚± occupied cell øÂ˘ó ¤ı˛ allocation
¤ı˛ ¬Ûøı˛˜±Ì ˙”Ú… fl¬ı˛ÀÓ¬ ˝Àıº ¤ı˛ Ù¬À˘ ÚÓ≈¬Ú Œ˚ Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú ¬Û±›˚˛± ˚±Àı Ó¬±ı˛ ÊÚ… Œ˜±È¬
¬Ûøı˛ı˝Ì ‡ı˛‰¬ ’±À·ı˛ ¸˜±Ò±ÀÚı˛ Œ˜±È¬ ¬Ûøı˛ı˝Ì ‡ı˛À‰¬ı˛ Œ‰¬À˚˛ fl¬˜ ˝Àıº
¤˝◊ ÚÓ≈¬Ú ¸˜±Ò±ÚøÈ¬ øÚÀ˚˛ ’±ı±ı˛ optimality test fl¬ı˛ÀÓ¬ ˝Àıº
˚øÓ¬ ÚÓ≈¬Ú¸˜±Ò±ÚøÈ¬ ‰¬ı˛˜ ¸˜±Ò±Ú ˝˚˛ Ó¬±˝À˘ ¬Ûøı˛ı˝Ì ¸˜¸…±øÈ¬ı˛ ‰¬ı˛˜ ¸˜±Ò±Ú ¬Û±›˚˛± Œ·˘º
˚ø ÚÓ≈¬Ú ¸˜±Ò±ÚøÈ¬ ‰¬ı˛˜ ¸˜±Ò±Ú Ú± ˝˚˛ Ó¬±˝À˘ ¬Û”Àı«ı˛ øÚ˚˛˜ ’Ú≈¸ı˛Ì fl¬Àı˛ ’±ı˛ ¤fl¬øÈ¬ Œ˜Ã˘
fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú øÚÌ«˚˛ fl¬ı˛ÀÓ¬ ˝Àı ¤ı— ¤˝◊ˆ¬±Àı Œ˙¯∏ ¬Û˚«ôL√ ¬Ûøı˛ı˝Ì ¸˜¸…±øÈ¬ı˛ ‰¬ı˛˜ ¸˜±Ò±Ú ¬
Û±›˚˛± ˚±Àıº
¤˝◊ ¬ÛX¬øÓ¬øÈ¬ ˆ¬±˘ fl¬Àı˛ Œı±Á¬±ı˛ ÊÚ… ï12.4ó ’Ú≈ÀBÂÀı˛ Î¬◊±˝ı˛ÀÌı˛ Œ‡≈Úº
4. ˚Ô±ı˛œøÓ¬ √õ∂ÀÓ¬…fl¬ cell-¤ allocation ¤ı˛ ¬Ûøı˛ ˜ ±Ì ï˙”Ú… Ú± ˝À˘ó ‹ cell ¤ı˛ Î¬◊ ¬ ÛÀı˛ ı ˛ left
¤ hand corner ŒÂ±È¬ square ¤ı˛ ˜ÀÒ… Œ‡±ÀÚ± ˝Àı ¤ı— ‹ cell ¤ √õ∂M ¬Ûøı˛ı˝Ì ‡ı˛‰¬Àfl¬
cell ¤ı˛ øÚÀ‰¬ı˛ right hand corner ¤ ŒÂ±È¬ square ¤ı˛ ˜ÀÒ… Œ‡±ÀÚ± ˝Àıº √õ∂ÀÓ¬…fl¬ unoc-
cupied cell (i, j) ¤ı˛ ÊÚ… ui + vj ¤ı˛ ˜±Ú ŒÂ±È¬ ı‘ À Mı˛ ˜ÀÒ… display fl¬ı˛ ± ˝Àıº
12.4 Î¬◊  ±˝ı˛ Ì

1. øÚÀ‰¬ı˛ ¬Ûøı˛ı˝Ì ¸˜¸…±øÈ¬ ¸˜±Ò±Ú fl¬èÚ †
ai
O1 5 4 6 14 15
O2 2 9 9 6 4
O3 6 1 7 13 8
bj 9 7 5 6
¸˜±Ò±Ú † √õ∂ÔÀ˜ VAM-¤ı˛ ¸±˝±À˚… √õ∂M ¬Ûøı˛ı˝Ì ¸˜¸…±øÈ¬ı˛ ¤fl¬øÈ¬ √õ∂±ı˛øy¬fl¬ Œ˜Ã˘ fl¬±˚«fl¬ı˛
¸˜±Ò±Ú øÚÌ«˚˛ fl¬ı˛± ˚±fl¬ †
[ ¤‡±ÀÚ ¸˜¸…±øÈ¬ ¸˜Ó¬±¬Û”Ì« (balanced) fl¬±ı˛Ì 3ai = 3bj = 27 ]
52
NSOU
D1 D2 D3 D4 ai
O1 5 4 6 14 15 (1)
O2 2 9 9 4 6 4 (4)
O3 6 1 7 13 8 (1)
9 7 5 6 2
(3) (5) (2) (7)
D1 D2 D3 D4 ai
7 8
O1 5 4 6 14 15 (1)
O3 6 1 7 13 8 (1)
9 7 5 2
(3) (5) (2) (7)
D1 D3 D4
O1 8 5 6 14 8 (1)
O3 6 7 13 8 (1)
9 5 2
(1) (1) (1)
D1 D3 D4
1 5 2
O3 6 7 13 8
1 5 2
VAM-¤ı˛ ¸±˝±À˚… ¬Û±›˚˛± ¸˜±Ò±ÚøÈ¬ øÚÀ‰¬ı˛ ¬Ûøı˛ı˝Ì ÂÀfl¬ Œ‡±ÀÚ ˝˘ †
D1 D2 D3 D4
8 7
O1 30
5 4 6 14
4
O2 15
2 9 9 6
1 5 2
O3 15
6 11 7 13
9 7 5 6
53
NSOU
Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±ÚøÈ¬ ˝˘ñ
x11 = 8, x12 = 7, x24 = 4, x31 = 1, x33 = 5, x34 = 2,
¤‡±ÀÚ Œ˜Ã˘ ‰¬À˘ı˛ ¸—‡…± = 3 + 4 – 1 = 6 ¤ı— Î¬◊¬ÛÀı˛ı˛ ¸˜±Ò±ÀÚ Œfl¬±Ú Œ˜Ã˘ ‰¬À˘ı˛ ˜±Ú 0
Ú˚˛ ¸≈Ó¬ı˛±— ¤˝◊ ¸˜±Ò±ÚøÈ¬ ¤fl¬øÈ¬ non-degenerate Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±Úº
Test for Optimality :
D1 D2 D3 D4 u i
8 7 6 12
15 – 1
5 6 144
–1 0 4 –2
2 9 9 6 4–7
1 7 5 2
8 0
6 11 7 13
9 7 5 6
vj 6 5 7 13
Table—1
’±˜ı˛± Ê±øÚ ui (i = 1, 2, 3), vj (j = 1, 2, 3, 4) ¤˝◊ 7øÈ¬ ¸—‡…± ui + vj = cij [√õ∂ÀÓ¬…fl¬
occupied cell (i, j) ÒÀı˛] ŒÔÀfl¬ Œ˚ 6øÈ¬ ¸˜œfl¬ı˛Ì ¬Û±›˚˛± ˚±˚˛ Œ¸&ø˘ ¸˜±Ò±Ú fl¬Àı˛ ¬Û±›˚˛± ˚±Àı
Œ˚‡±ÀÚ ui (i = 1, 2, 3), vj (j = 1, 2, 3, 4) ¤ı˛ ˜ÀÒ… ¤fl¬øÈ¬ ˜±Ú ˚‘BÂˆ¬±Àı Òı˛± ˚±˚˛º
ı˛œøÓ¬ ’Ú≈˚±˚˛œ ¤fl¬±ÀÚ ’±˜ı˛± u3 = 0 Òı˛˘±˜ ïfl¬±ı˛Ì 3Ú— ¸±øı˛ÀÓ¬ ¸ıÀ‰¬À˚˛ Œı˙œ¸—‡…fl¬ cell-¤
allocation ’±ÀÂóº
Ó¬±˝À˘ ’’˜ı˛± ¬Û±˝◊ u1 = –1, u2 = –7, u3 = 0, v1 = 6, v2 = 5, v3 = 7, v4 = 13.
¤‡Ú √õ∂ÀÓ¬…fl¬ un occupied cell (i, j) ¤ı˛ ÊÚ… ui + vj-¤ı˛ ˜±Ú corresponding cell-¤ ŒÂ±È¬
ı‘ÀMı˛ ˜ÀÒ… Œ‡±ÀÚ± ˝À˚˛ÀÂº [ Table–1 Œ‡≈Ú ]
Cell evalution Dij = cij – (ui + vj) ¤ı˛ ˜±Ú&ø˘ ï√õ∂ÀÓ¬…fl¬ unoccupied cell-¤ı˛ ÊÚ…ó øÚÀ‰¬ı˛
ÂÀfl¬ Œ‡±Ú ˝˘ †
D1 D2 D3 D4
O1 · · 0 2
O2 3 11 9 ·
O3 · 4 · ·
¤‡±ÀÚ ‘dots’ &ø˘ basic cell øÚÀ«˙ fl¬Àı˛º
Ó¬±˝À˘ Œ‡± ˚±ÀBÂ Œ˚ √õ∂ÀÓ¬…fl¬ unoccupied cell (i, j)-¤ı˛ ÊÚ… Dij$ 0 [Œ˚˜Ú (1, 4) cell-
¤ı˛ ÊÚ… D14 = c14 – (ui + vj) = 14 – ( – 1 + 13) = 2]
54
NSOU
¸≈Ó¬ı˛±—, VAM-¤ı˛ ¸±˝±À˚… ¬Û±›˚˛± ¸˜±Ò±ÚøÈ¬ ‰¬ı˛˜ ¸˜±Ò±Ú (optimal solution) ˝Àıº
\ ¤Àé¬ÀS ¤fl¬øÈ¬ ‰¬ı˛˜ Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú ˝˘ñ
x11 = 8, x12 = 7, x14 = 4, x31 = 1, x33 = 5, x34 = 2
¤ı— ¸ı«øÚ•ß ¬Ûøı˛ı˝Ì ‡ı˛‰¬ ˝Àıñ
8 × 5 + 7 × 4 + 4 × 6 + 1 × 6 + 5 × 7 + 2 × 13 = 159 ¤fl¬fl¬º
˜ôL√ı… † ¤‡±ÀÚ unoccupied cell (1, 3) ¤ı˛ ÊÚ… D14 = 0º ¸≈Ó¬ı˛±—, √õ∂M ¸˜¸…±øÈ¬ı˛ ¤fl¬±øÒfl¬
‰¬ı˛˜ ¸˜±Ò±Ú ¬Û±›˚˛± ˚±Àı ï¸ı«øÚ•ß ¬Ûøı˛ı˝Ì ‡ı˛‰¬ √õ∂ÀÓ¬…fl¬ ‰¬ı˛˜ ¸˜±Ò±ÀÚı˛ ÊÚ… ¤fl¬˝◊ ˝Àıóº
D1 D2 D3 D4 ai
O1 1 5 8 6 8
O2 4 2 5 4 9
O3 6 4 3 1 13
bj 10 3 4 13
¸˜±Ò±Ú † √õ∂M ¸˜¸…±øÈ¬ ¸˜Ó¬±¬Û”Ì« (balanced) fl¬±ı˛Ì 3ai = 3bj = 30º

¤‡±ÀÚ ‘Row-minima’ ¬ÛX¬øÓ¬ÀÓ¬ √õ∂±ı˛øy¬fl¬ Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú øÚÌ«˚˛ fl¬ı˛± ˝˘ ¤ı— ¸˜±Ò±ÚøÈ¬
øÚÀ‰¬ı˛ ÂÀfl¬ Œ‡±ÀÚ± ˝˘º
D1 D2 D3 D4
8
O1 8
2 3 4
O2 9
4 9
O3 13
10 3 4 13
¤‡±ÀÚ m + n – 1 = 3 + 4 – 1 = 6 Î¬◊¬ÛÀı˛ı˛ ÂÀfl¬ 6øÈ¬ occupied cell ’±ÀÂ ¤ı— ’±˜ı˛±

˘é¬… fl¬ı˛øÂ Œ˚ ¤˝◊ ¸˜±Ò±ÚøÈ¬ non-degenerate Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±Úº
¸˜±Ò±ÚøÈ¬ ˝˘ñ
x11 = 8, x21 = 8, x22 = 3, x24 = 4, x33 = 4, x34 = 9º
55
NSOU
Optimality test
D1 D2 D3 D4 ui
8 –1 3 1
8–3
1 5 8 6
2 3 6 4
4 2 5 4 9 0
1 –1 4 9
13 – 0
6 4 3 1
10 3 4 13
vj 4 2 6 4
Table–II
ui (i = 1, 2, 3), vj (j = 1, 2, 3, 4) ¤˝◊ 7øÈ¬ ¸—‡…± ˚Ôı˛œøÓ¬ cij – ui + vj [√õ∂ÀÓ¬…fl¬ occupied
cell (i, j) ÒÀı˛] ¸˜œfl¬ı˛Ì&ø˘ ¸˜±Ò±Ú fl¬Àı˛ øÚÌ«˚˛ fl¬ı˛± Œ˚‡±ÀÚ Òı˛± u2 = 0 ˝À˚˛ÀÂº
¤‡Ú √õ∂ÀÓ¬…fl¬ un occupied cell (i, j) ¤ı˛ ÊÚ… ui + vj-¤ı˛ ˜±Ú ‹ cell-¤ ŒÂ±È¬ ı‘ÀMı˛ ˜ÀÒ…
Œ‡±ÀÚ± ˝À˚˛ÀÂº [ Table–II Œ‡≈Ú ]
¤‡Ú cell evalution Dij = cij – (ui + vj) ¤ı˛ ˜±Ú&ø˘ ï√õ∂ÀÓ¬…fl¬ unoccupied cell-¤ı˛ ÊÚ…ó
øÚÀ‰¬ı˛ ÂÀfl¬ Œ‡±Ú ˝˘ †
D1 D2 D3 D4
O1 · 6 5 5
O2 3 · –1 ·
O3 5 5 · ·
Œ‡± ˚±ÀBÂ D14 = – 1 < 0

¸≈Ó¬±ı˛—, ‘row-minima’ ¬ÛX¬øÓ¬ÀÓ¬ ¬Û±›˚˛± ¸˜±Ò±ÚøÈ¬ ‰¬ı˛˜ ¸˜±Ò±Ú ˝Àı Ú±º ¤‡Ú ¤fl¬øÈ¬ ˜±S
unoccupied cell-¤ı˛ cell evaluative Ÿ¬Ì±Rfl¬ ¤ı— cell-øÈ¬ ˝˘ (2, 3)
¸≈Ó¬ı˛±—, ’±˜ı˛± ’Ú… ¤fl¬øÈ¬ Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú øÚÌ«˚˛ fl¬ı˛ı Œ˚‡±ÀÚ (2, 3) cell-øÈ¬ ¤fl¬øÈ¬ basic
cell ˝Àıº
¤‡Ú (2, 3) ¤˝◊ un occupied cell-øÈ¬ ¤ı— (2, 4), (3, 4), (3, 3) occupied cell &ø˘ øÚÀ˚˛
¤fl¬øÈ¬ ˘≈¬Û ¬Û±›˚˛± ˚±˚˛ ïøÚÀ‰¬ı˛ Âfl¬øÈ¬ Œ‡≈Úóº
56
NSOU
D1 D2 D3 D4
O1
O2 q 4–q
O3
4–q 9+q
˜ÀÚ fl¬èÚ (2, 3) cell-¤ q (> 0) allocation fl¬ı˛± ˝˘º Ó¬±˝À˘ √õ∂M ¬Ûøı˛ı˝Ì ¸˜¸…±ı˛ ˙Ó«¬&ø˘
˚±ÀÓ¬ ø¸X¬ ˝˚˛, ˘≈¬ÛøÈ¬ı˛ ’Ú… cell &ø˘ı˛ allocations ¤ı˛ ¸À/ alternately q Œ˚±· › øıÀ˚˛±· fl¬ı˛±
˝˘ [Î¬◊¬ÛÀı˛ı˛ Âfl¬øÈ¬ Œ‡≈Ú]º
¤‡Ú ˚±ÀÓ¬ √õ∂ÀÓ¬…fl¬ allocation ¤ı˛ ˜±Ú 0 ˝˚˛ ¤ı— q (> 0) ¤ı˛ ˜±Ú ¸ıÀ‰¬À˚˛ Œı˙œ ˝˚˛
q = min [4, 9, 4] = 4 Òı˛± ˝˘º
ÚÓ≈¬Ú Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±ÚøÈ¬ øÚÀ‰¬ı˛ ÂÀfl¬ Œ‡±ÀÚ± ˝˘ †
D1 D2 D3 D4 ui
8 –1 3 1
8–3
1 5 8 6
2 3 6 4
4 2 5 4 9 0
1 –1 4 9
13 – 0
6 4 3 1
10 3 4 13
vj 4 2 6 4
Table–III
¤˝◊ ¸˜±Ò±ÀÚ 5øÈ¬ occupied basic cell ’±ÀÂº øfl¬c√ ¤‡±ÀÚ Œ˜Ã˘ ‰¬À˘ı˛ ¸—‡…± 6º Ó¬±˝À˘
Î¬◊¬ÛÀı˛ı˛ ¸˜±Ò±ÚøÈ¬ ¤fl¬øÈ¬ degenerate Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±Úº
¸˜±Ò±ÚøÈ¬ ˝˘ñ
x11 = 8, x21 = 8, x22 = 3, x23 = 4, x34 = 13
Optimality test ïÚÓ≈¬Ú ¸˜±Ò±ÀÚı˛ ÊÚ…ó
¤‡±ÀÚ occupied cell ¤ı˛ ¸—‡…± 5 ˚± m+ n – 1 = 6 ¤ı˛ Œ‰¬À˚˛ fl¬˜º ¤‡±ÀÚ 5øÈ¬ occupied
basic cell ¤ı˛ ¸À/ Œ˚ Œfl¬±Ú ¤fl¬øÈ¬ unoccupied cell ŒÚ›˚˛± ˝Àı ˚±ÀÓ¬ 6øÈ¬ cell ˘≈¬Û ΔÓ¬øı˛ Ú±
fl¬Àı˛º
’±˜ı˛± (3, 3) cell øÈ¬ ŒÚ›˚˛± ˝˘ ¤ı— ¤˝◊ cell ¤ e (> 0) ¬Ûøı˛˜±Ì Œ˚‡±ÀÚ e ¤ı˛ ˜±Ú ˚ÀÔ©Ü
57
NSOU
ŒÂ±È¬ ˚±ÀÓ¬ Œ˚ Œfl¬±Ú ¸—‡…± a-ı˛ ÊÚ… a ± e Œfl¬ a Òı˛± ˚±˚˛º ¤ı˛ Ù¬À˘ √õ∂M ¸˜¸…±øÈ¬ı˛ ¬Ûøı˛ıÓ«¬Ú
˝À˘›, optimal stage-¤ e = 0 Òı˛À˘ √õ∂M ¸˜¸…±øÈ¬ı˛˝◊ optimal solution ¬Û±›˚˛± ˚±Àıº
Ó¬±˝À˘ ˚Ô±ı˛œøÓ¬ cij = ui + vj ï√õ∂ÀÓ¬…fl¬ occupied cell ÒÀı˛ó ¸˜œfl¬ı˛Ì&ø˘ (6øÈ¬ó ¸˜±Ò±Ú fl¬Àı˛
ui (i = 1, 2, 3), vi (j = 1, 2, 3, 4) ¤ı˛ ˜±Ú øÚÌ«˚˛ fl¬ı˛± ˚±Àıº
¤‡±ÀÚ u2 = 0 Òı˛± ˝À˚˛ÀÂº ui, vj -ı˛ ˜±Ú&ø˘ı˛ ÊÚ… Table–III Œ‡≈Úº ˚Ô±ı˛œøÓ¬ uj + vj ¤ı˛
˜±Ú&ø˘ Table–III-ŒÓ¬ ŒÂ±È¬ ı‘ÀMı˛ ˜ÀÒ… Œ‡±ÀÚ± ˝À˚˛ÀÂº
Cell evaluations [Dij = Cij – (vi + vi)]
D1 D2 D3 D4
O1 . 6 6 6
O2 . . . 4
O3 4 4 . .
¤‡Ú Œ‡± ˚±ÀBÂ Œ˚ √õ∂ÀÓ¬…fl¬ cell-¤ı˛ ÊÚ… Dji ³ 0º ¸≈Ó¬ı˛±— e = 0 ÒÀı˛ Œ˚ ¸˜±Ò±ÚøÈ¬ ¬Û±›˚˛±
˚±Àı Ó¬± ˝Àı √õ∂M ¸˜¸…±øÈ¬ı˛ ¤fl¬øÈ¬ ‰¬ı˛˜ Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±Úº
Ó¬±˝À˘ ‰¬ı˛˜ ¸˜±Ò±ÚøÈ¬ ˝˘ x11 = 8, x21 = 2, x22 = 3, x23 = 4, x34 = 13 ˚± ¤fl¬øÈ¬ degenerate
Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±Úº
1 × 8 + 4 × 2 + 2 × 3 + 5 × 4 + 1 × 13 = 55 ¤fl¬fl¬º
12.5 ’¸˜Ó¬±¬Û” Ì « ¬Ûøı˛ ı ˝Ì ¸˜¸…± (Unbalanced Trans-

portation problem)
˚ø Œfl¬±Ú ¬Ûøı˛ı˝Ú ¸˜¸…±˚˛ Œ˜±È¬ Œ˚±·±ÀÚı˛ (availability) ¬Ûøı˛˜±Ì ¤ı— Œ˜±È¬ ‰¬±ø˝±ı˛ (re-
m n
quirements) ¬Ûøı˛˜±Ì ¸˜±Ú Ú± ˝˚˛ ’Ô«±» ˚ø åa ¹ åb

i =1
i
j =1
j ˝˚˛ Ó¬±˝À˘ ’±˜ı˛± ¸˜¸…±øÈ¬Àfl¬
’¸˜Ó¬±¬Û”Ì« ¬Ûøı˛ı˝Ì ¸˜¸…± ı˘ıº
¤Àé¬ÀS ¸˜¸…±øÈ¬Àfl¬ √õ∂ÔÀ˜ ¤fl¬øÈ¬ ¸˜Ó¬±¬Û”Ì« ¸˜¸…±˚˛ ı˛+¬Û±ôL√ı˛ fl¬ı˛ÀÓ¬ ˝Àıº ¤ı˛ ÊÚ… ¤fl¬øÈ¬ fic-
m n m n
titious Î¬◊»¸î˘ ï˚ø å a < åb

i =1
i
j =1
j ˝˚˛ó ı± fictitious ·ôL√ı…î˘ ï˚ø å a > åb
i =1
i
j =1
j ˝˚˛ó
introduce fl¬ı˛ÀÓ¬ ˝Àı Œ˚‡±ÀÚ fictitious Î¬◊»î˘ ŒÔÀfl¬ › fictitious ·ôL√ı…îÀ˘ ¬Û±Í¬±ÀÚ± ¤fl¬fl¬
¬Ûøı˛˜±Ì øÊøÚÀ¯∏ı˛ ¬Ûøı˛ı˝Ú ‡ı˛‰¬ ˙”Ú… Òı˛ÀÓ¬ ˝Àıº
58
NSOU
˚ø ficititious Î¬◊»¸îÀ˘ı˛ √õ∂À˚˛±ÊÚ ˝˚˛ Ó¬±˝À˘ ¤˝◊ Î¬◊»À¸ Œ˚±·±ÀÚı˛ ¬Ûøı˛˜±¬Û Òı˛ÀÓ¬ ˝Àı
m m
å bi > å a j ¤ı—¬ ˚ø fictitions ·ôL√ı…îÀ˘ı˛ √õ∂À˚˛±ÊÚ ˝˚˛ Ó¬±˝À˘ ¤˝◊ ·ôL√ı…îÀ˘ ‰¬±ø˝±ı˛
i =1 j =1
m m
¬Ûøı˛˜±Ì Òı˛ÀÓ¬ ˝Àı åa - åb

i =1
i
j =1
j º
¤fl¬øÈ¬ Î¬◊±˝ı˛Ì Œ›˚˛± ˚±fl¬ †
øÚÀ‰¬ı˛ ¬Ûøı˛ı˝Ì ¸˜¸…±øÈ¬ ’±˜ı˛± øıÀı‰¬Ú± fl¬ı˛ıº
D1 D2 D3 D4 ai
O1 10 8 2 7 50
O2 5 6 4 3 40
O3 12 21 9 8 30
bj 60 40 20 30
¤‡±ÀÚ Sai = 120 ¤ı— Sbi = 150º Ó¬±˝À˘ ¤Àé¬ÀS Sbj > Saiº
¸≈Ó¬ı˛±—, ¤‡±ÀÚ ¤fl¬øÈ¬ fictitious Î¬◊»¸ O4-¤ Œ˚±·±ÀÚı˛ ¬Ûøı˛˜±Ì Òı˛ÀÓ¬ ˝Àı 150 – 120 = 30
¤ı— ı˛+¬Û±ôL√øı˛Ó¬ ¸˜Ó¬±¬Û”Ì« ¬Ûøı˛ı˝Ì ¸˜¸…±øÈ¬ ˝Àıñ
D1 D2 D3 D4 ai
O1 10 8 2 7 50
O2 5 6 4 3 40
O3 12 21 9 8 30
O4 0 0 0 0
bj 60 40 20 30
¤‡±Ú ¸˜Ó¬±¬Û”Ì« ¸˜¸…±øÈ¬Àfl¬ ˚Ô±ı˛œøÓ¬ ¸˜±Ò±Ú fl¬ı˛± ˝Àıº ¤˝◊ ¸˜¸…±ı˛ ‰¬ı˛˜ ¸˜±Ò±Ú fictitious
Î¬◊»À¸ı˛ ¸±øı˛ı˛ Œ˚ Œfl¬±Ú cell-¤ı˛ allocation-Œfl¬ ï˚ø Ô±Àfl¬ó ı± øÀ˘ ’±˜ı˛± √õ∂M ’¸˜Ó¬±¬Û”Ì«
¸˜¸…±øÈ¬ı˛ ‰¬ı˛˜ ¸˜±Ò±Ú ¬Û±ıº ¤Àé¬ÀS fictitious Î¬◊»¸ O4-¤ı˛ 30 ¤fl¬fl¬ ¬Ûøı˛˜±ÀÌı˛ Œ˚±·±Ú Œfl¬±Ú
·ôL√ı…îÀ˘ ¬Û±Í¬±ÀÚ± ˚±Àı Ú± ’Ô«±» ¤Àé¬ÀS ·ôL√ı…î˘&ø˘ı˛ Œ˜±È¬ ‰¬±ø˝±ı˛ 30 ¤fl¬fl¬ Œ˜È¬±ÀÚ±
˚±Àı Ú±º
˚ø ˝˚˛ Ó¬±˝À˘ ¤fl¬øÈ¬ fictious ·ôL√ı…î˘ øÚÀ˚˛ ¤fl¬˝◊ˆ¬±Àı ’±˜ı˛± ’¸˜Ó¬± ¬Û”Ì« ¸˜¸…±øÈ¬ı˛ ‰¬ı˛˜
¸˜±Ò±Ú øÚÌ«˚˛ fl¬ı˛ÀÓ¬ ¬Û±ı˛ıº
[’Ú≈˙œ˘Úœ 12.7-¤ 7 Ú— ¸˜¸…±øÈ¬ Œ‡≈Ú]
59
NSOU
12.6 ¸±ı˛ ± —˙
¤˝◊ ¤fl¬Àfl¬ √õ∂ÔÀ˜ ¸˜Ó¬±¬Û”Ì« ¬Ûøı˛ı˝Ú ¸˜¸…±ı˛ √õ∂±ı˛øy¬fl¬ Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú øÚÌ«À˚˛ı˛ øıøˆ¬iß
¬ÛX¬øÓ¬ ’±À˘±‰¬Ú± fl¬ı˛± ˝À˚˛ÀÂº ¤ı˛ ¬Ûı˛ √õ∂±ı˛øy¬fl¬ Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±ÚøÈ¬ ‰¬ı˛˜ ¸˜±Ò±Ú øfl¬ Ú± Ó¬±
¬Ûı˛œé¬± fl¬ı˛±ı˛ ¬ÛX¬øÓ¬ ı˘± ˝À˚˛ÀÂ ¤ı— ‰¬ı˛˜ ¸˜±Ò±Ú Ú± ˝À˘ øfl¬ˆ¬±Àı ’Ú… ¤fl¬øÈ¬ Œ˜Ã˘ fl¬±˚«fl¬ı˛
¸˜±Ò±Ú øÚÌ«˚˛ fl¬ı˛± ˚±˚˛ Ó¬±› ’±˜ı˛± ŒÊÀÚøÂº ¸ıÀ˙À¯∏ ’¸˜Ó¬±¬Û”Ì« ¬Ûøı˛ı˝Ú ¸˜¸…± øfl¬ˆ¬±Àı ¸˜±Ò±Ú
fl¬ı˛± ˚±˚˛ Ó¬± ı˘± ˝À˚˛ÀÂº
12.7 ’Ú≈ ˙ œ˘Úœ
1. øÚÀ‰¬ı˛ ¬Ûøı˛ı˝Ú ¸˜¸…±øÈ¬ı˛ (i) North-West Corner, (ii) Vogel’s approximation ¬ÛX¬øÓ¬ı˛
¸±˝±À˚… √õ∂±ı˛øy¬fl¬ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú øÚÌ«˚˛ fl¬èÚ †
D1 D2 D3 ai
O1 5 1 8 12
O2 2 4 0 14
O3 3 6 7 4
bj 9 10 11
Œfl¬±Ú ¬ÛX¬øÓ¬ı˛ ¸˜±Ò±Ú ’À¬Ûé¬±fl‘¬Ó¬ ˆ¬±˘∑
2. Matrix Minima ¬ÛX¬øÓ¬ÀÓ¬ øÚÀ‰¬ı˛ ¬Ûøı˛ı˝Ì ¸˜¸…±øÈ¬ı˛ ¤fl¬øÈ¬ √õ∂±ı˛øy¬fl¬ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú
øÚÌ«˚˛ fl¬èÚ † D1 D2 D3 D4 D5 ai
O1 2 11 10 3 7 4
O2 1 4 7 2 1 8
O3 3 9 4 8 12 9
bj 3 3 4 30
3. øÚÀ‰¬ı˛ ¬Ûøı˛ı˝Ì ¸˜¸…±&ø˘ ¸˜±Ò±Ú fl¬èÚ †

D1 D2 D3 ai
(i)
O1 30 20 10 500
O2 5 15 25 500
bj 300 300 400
60
NSOU
(ii) D1 D2 D3 ai
O1 7 3 4 2
O2 2 1 3 3
O3 3 4 6 5
bj 4 1 5
4. øÚÀ‰¬ı˛ ¬Ûøı˛ı˝Ì ¸˜¸…±øÈ¬ı˛ ¤fl¬øÈ¬ ‰¬ı˛˜ Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú øÚÌ«˚˛ fl¬èÚ †
W1 W2 W3 W4 ai
O1 19 30 50 10 7
O2 70 30 40 60 9
O3 40 8 70 20 18
bj 60 40 20 30
5. øÚÀ‰¬ı˛ ¬Ûøı˛ı˝Ì ¸˜¸…±øÈ¬ ¸˜±Ò±Ú fl¬èÚ ¤ı— ¬Ûı˛œé¬± fl¬Àı˛ Œ‡≈Ú ¸˜¸…±øÈ¬ı˛ ‰¬ı˛˜ ¸˜±Ò±Ú
unique øfl¬Ú± † D1 D2 D3 ai
O1 6 8 4 14
O2 4 9 3 12
O3 1 2 6 5
bj 6 10 15
D1 D2 D3 ai
O1 0 2 1 5
O2 2 1 5 10
O3 2 4 3 5
bj 5 5 10
7. øÚÀ‰¬ı˛ ’¸˜Ó¬±¬Û”Ì« ¬Ûøı˛ı˝Ì ¸˜¸…±øÈ¬ ¸˜±Ò±Ú fl¬èÚ †
D1 D2 D3 D4 ai
O1 3 8 7 4 50
O2 5 2 9 5 40
O3 4 3 6 2 30
bj 60 40 20 30
61
NSOU
¸˜±Ò±Ú † ¤‡±ÀÚ Sai = 160 ¤ı— Sbj = 175º ¸≈Ó¬ı˛±— ¸˜¸…±øÈ¬ ¤fl¬øÈ¬ ’¸˜Ó¬±¬Û”Ì« ¬Ûøı˛ı˝Ì
¸˜¸…±º ¤‡±ÀÚ Sbi – Sai = 15º
Ó¬±˝À˘ ¤‡±ÀÚ ¤fl¬øÈ¬ fictitious Î¬◊»¸î˘ O4 Òı˛± ˝˘ Œ˚‡±ÀÚ Œ˚±·±ÀÚı˛ ¬Ûøı˛˜±Ì 15 ¤fl¬fl¬º
¤‡Ú ı˛+¬Û±ôL√øı˛Ó¬ ¬Ûøı˛ı˝Ì ¸˜¸…±øÈ¬ ˝Àıñ
D1 D2 D3 D4 ai
O1 3 8 7 4 30
O2 5 2 9 5 50
O3 4 3 6 2 80
O4 0 0 0 0 15
bj 20 60 55 40
¤‡±ÀÚ VAM ¤ı˛ ¸±˝±À˚… ¤fl¬øÈ¬ Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú øÚÌ«˚˛ fl¬ı˛± ˝˘ ˚± øÚÀ‰¬ı˛ ÂÀfl¬ Œ‡±ÀÚ±
˝À˚˛ÀÂº
Optimality test
¤‡±ÀÚ occupied basic cell ¤ı˛ ¸—‡…± 7 (= m + n – 1 = 4 + 4 – 1)º
˚Ô±ı˛œøÓ¬ cji = ui + vj ï√õ∂ÀÓ¬…fl¬ occupied cell ÒÀı˛ó 7øÈ¬ ¸˜œfl¬ı˛Ì (u3 = 0 ÒÀı˛ó ¸˜±Ò±Ú fl¬Àı˛
’±˜ı˛± ¬Û±˝◊ u1 = 1, u2 = – 1, u3 = 0, u4 = – 6, v1 = 2, v2 = 3, v3 = 6, v4 = 2º Ó¬±ı˛¬Ûı˛ √õ∂ÀÓ¬…fl¬
unoccupied cell ÒÀı˛ cell evaluation Dji-ı˛ ˜±Ú&ø˘ øÚÌ«˚˛ fl¬Àı˛ ÚœÀ‰¬ı˛ ŒÂ±È¬ ı‘ÀMı˛ ˜ÀÒ… Œ‡±ÀÚ±
˝˘ [øÚÀ‰¬ı˛ Âfl¬øÈ¬ Œ‡≈Ú]º
62
NSOU
¤‡±ÀÚ ’±˜ı˛± Œ‡øÂ Œ˚ i, j-¤ı˛ ¸fl¬˘ ˜±ÀÚı˛ ÊÚ… Dji = cji – (ui + vi) ³ 0º
¸≈Ó¬ı˛±— VAM-¤ı˛ ¸±˝±À˚… ¬Û±›˚˛± Œ˜Ã˘ fl¬±˚«fl¬ı˛ ¸˜±Ò±ÚøÈ¬ ‰¬ı˛˜ ¸˜±Ò±Ú (optimal solution)
˝Àıº
Ó¬±˝À˘ √õ∂M ’¸˜Ó¬±¬Û”Ì« ¸˜¸…±øÈ¬ı˛ ‰¬ı˛˜ ¸˜±Ò±Ú ˝Àıñ
x11 = 20, x13 = 10, x22 = 50, x32 = 10, x33 = 30, x34 = 40
¤ı— minimum cost = 20 × 3 + 10 × 7 + 50 × 2 + 10 × 3 + 30 × 6 + 40 × 2 = 520
¤fl¬fl¬º
[¤‡±ÀÚ ˘é¬… fl¬èÚ ’¸˜Ó¬±¬Û”Ì« ¸˜¸…±ı˛ Œé¬ÀS x43 = 15-Œfl¬ ı± Œ›˚˛± ˝À˚˛ÀÂñ¤ı˛ ’Ô« ˝˘
Œ˚ D3 ·ôL√ı…îÀ˘ı˛ 15 ¤fl¬fl¬ ‰¬±ø˝± Œ˜È¬±ÀÚ± ˚±Àı Ú±º]
8. øÚÀ‰¬ı˛ ’¸˜Ó¬±¬Û”Ì« ¬Ûøı˛ı˝Ì ¸˜¸…±ı˛ Œé¬ÀS minimum ¬Ûøı˛ı˝Ì ‡ı˛‰¬ øÚÌ«˚˛ fl¬èÚ †
D1 D2 D3 ai
O1 4 3 2 10
O2 1 5 0 13
O3 3 8 6 12
bj 8 5 7
12.8 Î¬◊ M ı˛ ˜ ±˘±

1. (i) x11 = 9, x12 = 3, x22 = 7, x23 = 7, x33 = 4; ‡ı˛‰¬ = 104
(ii) x11 = 2, x12 = 10, x21 = 3, x23 = 11, x31 = 4; ‡ı˛‰¬ = 38
Vogel-¤ı˛ ¬ÛX¬øÓ¬ ’À¬Ûé¬±fl‘¬Ó¬ ˆ¬±˘º
2. x11 = 1, x14 = 3, x21 = 2, x25 = 6, x32 = 3; x33 = 4, x34 = 2
3. (i) x12 = 100, x13 = 400, x21 = 300, x22 = 200; Minimum ‡ı˛‰¬ = 10500
(ii) x13 = 2, x2 = 1, x23 = 2, x31 = 4, x33 = 1; Minimum ‡ı˛‰¬ = 33
4. x11 = 5, x14 = 2, x22 = 2, x23 = 7, x32 = 6, x34 = 12
5. x12 = 5, x13 = 9, x21 = 6, x23 = 6, x32 = 5; Unique.
6. x13 = x21 = x22 = x33 = 5; Minimum ‡ı˛‰¬ = 35.
8. Minimum ¬Ûøı˛ı˝Ì ‡ı˛‰¬ = 23.
63
NSOU
¤fl¬fl¬ 13
¬¤fl¬fl¬ ❑ ’±Àı˛ ± ¬Û ¸˜¸…± (Assignment Problem)
·Í¬Ú
√ 13.1 õ∂ô¶∏ ± ıÚ±
√ 13.2 ’±Àı˛ ± ¬Û ¸˜¸…±ı˛ ·±øÌøÓ¬fl¬ ı˛ + ¬ Û (Mathematical formulation of an
as signment problem)
√ 13.3 ’±Àı˛ ± ¬Û ¸˜¸…±ı˛ ¸˜±Ò±Ú
√ 13.4 ‰¬ı˛ ˜ ˜±Ú øÚÌ« ˚ ˛ ¸—[±ôL√ (Maximization problem) ’±Àı˛ ± ¬Û ¸˜¸…±º
√ 13.5 Î¬◊  ±˝ı˛ Ì
√ 13.6 ëw±˜…˜±Ì øıÀ[Ó¬±í ¸˜¸…± (Travelling Salesman problem)
√ 13.7 Î¬◊  ±˝ı˛ Ì
√ 13.8 ¸±ı˛ ± —˙
√ 13.9 ’Ú≈ ˙ œ˘Úœ
√ 13.10 Î¬◊ M ı˛ ˜ ±˘±
13.1 õ∂ô¶∏ ± ıÚ±
ı±ô¶∏ıÀé¬ÀS ’±˜ı˛± ¤˜Ú øfl¬Â≈ ¸˜¸…± ¬Û±˝◊ Œ˚&ø˘Àfl¬ ’±Àı˛±¬Û ¸˜¸…± (assignment problem)
ı˘± ˝˚˛º ¤ı˛+¬Û ¸˜¸…±ı˛ ¤fl¬øÈ¬ Î¬◊±˝ı˛Ì Œ›˚˛± ˚±fl¬º ˜ÀÚ fl¬èÚ Œfl¬±Ú fl¬±ı˛‡±Ú±ı˛ ˜±ø˘fl¬ ¬Û“±‰¬ ı…øª
A, B, C, D, E -Œfl¬ ¬Û“±‰¬øÈ¬ fl¬±Ê 1, 2, 3, 4, 5 ¸•Ûiß fl¬ı˛±ı˛ ±ø˚˛Q øÀÓ¬ ‰¬±˚˛º ¤Àé¬ÀS ’±˜ı˛±
˜ÀÚ fl¬ı˛ÀÓ¬ ¬Û±øı˛ Œ˚ ¤˝◊ ¬Û“±‰¬ ı…øª ¬Û“±‰¬øÈ¬ fl¬±ÀÊı˛ √õ∂ÀÓ¬…fl¬ fl¬±ÀÊ ¸˜±Ú é¬ (efficient) Ú˚˛ ¤ı—
Ù¬À˘ Œfl¬±Ú ı…øªÀfl¬ øÀ˚˛ Œfl¬±Ú fl¬±Ê fl¬ı˛±À˘ Œ˚ cost ï˜Ê≈øı˛ ˝◊Ó¬…±øó ¬Ûh¬Àı Ó¬± ı…øª › fl¬±ÀÊı˛ Î¬◊¬Ûı˛
øÚˆ«¬ı˛ fl¬ı˛Àıº ¤‡Ú fl¬±ı˛‡±Ú±ı˛ ˜±ø˘fl¬ ˜±S ¤fl¬ÊÚ ı…øªÀfl¬ ¤fl¬øÈ¬ ˜±S fl¬±Ê ŒÀı ¤ı— ¤˝◊ˆ¬±Àı ¬Û“±‰¬
ı…øª A, B, C, D, E-Œfl¬ 1, 2, 3, 4, 5 ¬Û“±‰¬øÈ¬ fl¬±ÀÊı˛ ±ø˚˛Q øÀÓ¬ ˝Àıº ¤˝◊ ˙ÀÓ«¬ Œfl¬±Úƒ ı…øªÀfl¬
Œfl¬±Úƒ fl¬±ÀÊı˛ ±ø˚˛Q øÀ˘ Œ˜±È¬ cost ¸ıÀ‰¬À˚˛ fl¬˜ ˝Àı ı± fl¬±Ê&ø˘ ¸•Ûiß ˝À˘ Œ˜±È¬ ˘±Àˆ¬ı˛ ¬Ûøı˛˜±Ì
¸ıÀ‰¬À˚˛ Œı˙œ ˝Àı Ó¬± øÚÌ«˚˛ fl¬ı˛±ı˛ ¸˜¸…±˝◊ ˝˘ ’±Àı˛±¬Û ¸˜¸…± (assignment problem)º
64
NSOU
¤‡Ú ˜ÀÚ fl¬èÚ m ¸—‡…fl¬ job-Œfl¬ m ¸—‡…fl¬ ı…øªÀfl¬ (machine ı± ’Ú… facilities) ’±Àı˛±¬Û
(assign) fl¬ı˛ÀÓ¬ ˝Àıº ˜ÀÚ fl¬èÚ i-Ó¬˜ job ˚ø j-Ó¬˜ facility ŒÓ¬ ’±Àı˛±¬Û fl¬ı˛± ˝˚˛ Ó¬±˝À˘ cost
˝Àı cij (i = 1, 2, ......... m; j = 1, 2, ......... m)º
øÚÀ‰¬ı˛ Âfl¬øÈ¬Àfl¬ cost matrix ıÀ˘º
¤‡±ÀÚ Job &ø˘Àfl¬ facilities Œı˛ ˜ÀÒ… øfl¬ı˛+À¬Û ’±Àı˛±¬Û fl¬ı˛À˘ ï√õ∂ÀÓ¬…fl¬øÈ¬ job-Œfl¬ Œfl¬ı˘˜±S
¤fl¬øÈ¬ facility-ŒÓ¬ ¤ı— √õ∂ÀÓ¬…fl¬ facility-ŒÓ¬ ¤fl¬øÈ¬ ˜±S Job) Œ˜±È¬ cost ¸ıÀ‰¬À˚˛ fl¬˜ ˝˚˛ Ó¬± øÚÌ«˚˛
fl¬ı˛±ı˛ ¸˜¸…±˝◊ ˝˘ ’±Àı˛±¬Û ¸˜¸…± Œ˚‡±ÀÚ cost matrix Œ›˚˛± Ô±fl¬Àıº
Profit matrix Œ›˚˛± Ô±fl¬À˘, Job &ø˘Àfl¬ facilities Œı˛ ˜ÀÒ… øfl¬ı˛+À¬Û ’±Àı˛±¬Û fl¬ı˛À˘ Œ˜±È¬
˘±ˆ¬ (profit) ¸ıÀ‰¬À˚˛ Œı˙œ ˝˚˛ Ó¬± øÚÌ«˚˛ fl¬ı˛±ı˛ ¸˜¸…±˝◊ ˝˘ ’±Àı˛±¬Û ¸˜¸…±º ¤‡±ÀÚ ’±˜ı˛± ˘é¬…
fl¬ı˛øÂ Job-¤ı˛ ¸—‡…± ¤ı— facilities-Œı˛ ¸—‡…± ¸˜±Ú ’Ô«±» cost matrix ïı± profit matrix ı·«
˜…±øÈ¬™' (square matrix) ˝Àıº
’±Àı˛±¬Û ¸˜¸…± ¸˜±Ò±ÀÚı˛ Œé¬ÀS øfl¬Â≈ Î¬◊À{°‡ Ú± Ô±fl¬À˘ ’±˜ı˛± ÒÀı˛ ŒÚı Œ˚ √õ∂M ˜…±øÈ¬™'øÈ¬ cost
matrixº
13.2 ’±Àı˛ ± ¬Û ¸˜¸…±ı˛ ·±øÌøÓ¬fl¬ ı˛ + ¬ Û (Mathematical for-

mulation of an assignment problem)
˜ÀÚ fl¬èÚ ’±Àı˛±¬Û ¸˜¸…±øÈ¬ÀÓ¬ m ¸—‡…fl¬ job › m ¸—‡…fl¬ facilities ’±ÀÂ ¤ı— ˜ÀÚ fl¬èÚ √õ∂M
cost matrixøÈ¬ [Cij]m × m Œ˚‡±ÀÚ i-Ó¬˜ Job-Œfl¬ j-Ó¬˜ facility-ŒÓ¬ ’±Àı˛±¬Û fl¬ı˛± ˝À˘ cost ¤ı˛
¬Ûøı˛˜±Ì cij ˝Àıº
¤‡Ú xij (i = 1, 2, .........m; j = 1, 2,.........m) ‰¬˘&ø˘ı˛ ¸—:± øÚÀ‰¬ Œ›˚˛± ˝˘ †
xij = 1 ˚ø i-Ó¬˜ Job øÈ¬ j-Ó¬˜ facility ŒÓ¬ ’±Àı˛±¬Û fl¬ı˛± ˝˚˛
= 0 ’Ú…Ô±˚˛º
65
NSOU
’±Àı˛±¬Û ¸˜¸…±ı˛ ˙Ó«¬ ’Ú≈¸±Àı˛ i-¤ı˛ Œ˚ Œfl¬±Ú øÚø«©Ü ˜±ÀÚı˛ ÊÚ… j-Œı˛ ¤fl¬øÈ¬ ˜±S ˜±ÀÚı˛ ÊÚ…
xij=1 ˝Àı ¤ı— j-¤ı˛ ¤fl¬øÈ¬ ˜±ÀÚı˛ ÊÚ… xij=1 ˝Àıº ¤˝◊ ˙Ó«¬&ø˘ı˛ ·±øÌøÓ¬fl¬ ı˛+¬Û ˝˘
m
åx
j =1
ij = 1, i = 1, 2,............... m
¤ı— åx i =1
ij = 1, j = 1, 2,............... m
’±˜ı˛± ˘é¬… fl¬ı˛øÂ Œ˚ Œ˜±È¬ cost-¤ı˛ ˜±Ú z-Œfl¬ Œ˘‡± ˚±˚˛

m m
z=å åc ij xij ,
i =1 j =1
Ó¬±˝À˘ ’±Àı˛±¬Û ¸˜¸…±ı˛ ïcost matrix ¤ı˛ Œé¬ÀSó ·±øÌøÓ¬fl¬ ı˛+¬ÛøÈ¬ ˝Àı
m m
’ı˜ z = å åc ij xij ,
i =1 j =1
j =1
ij = 1, i = 1, 2,............ m ;
åx
i =1
ij = 1 , j = 1, 2,............ m ;
¤ı— xij=1 ı± 0º
¤‡±ÀÚ xij-Œı˛ ˜±Ú øÍ¬fl¬ øÚÌ«˚˛ fl¬ı˛ÀÓ¬ ¬Û±ı˛À˘˝◊ ’±Àı˛±¬Û ¸˜¸…±ı˛ ¸˜±Ò±Ú ˝À˚˛ ˚±Àıº
˜ôL√ı… – ’±Àı˛±¬Û ¸˜¸…±ı˛ ·±øÌøÓ¬fl¬ ı˛+¬Û ŒÔÀfl¬ ’±˜ı˛± ˘é¬… fl¬ı˛øÂ Œ˚ xij ‰¬˘&ø˘ı˛ ˜±Ú Œfl¬ı˘˜±S
0 ¤ı— 1 ˝ÀÓ¬ ¬Û±Àı˛ ï¸±Ò±ı˛Ì L.P.P-ı˛ Œé¬ÀS ¤ı˛+¬Û ˙Ó«¬ Ô±Àfl¬ Ú±óº ¸≈Ó¬ı˛±— ’±Àı˛±¬Û ¸˜¸…±Àfl¬ ˚Ô±Ô«
L.P.P ı˘± ˚±˚˛ Ú±º
13.3 ’±Àı˛ ± ¬Û ¸˜¸…±ı˛ ¸˜±Ò±Ú
¤‡±ÀÚ ’±˜ı˛± ÒÀı˛ ŒÚı Œ˚ Cost matrix [ cij]m×m ¤ı˛ Œé¬ÀS i, j-¤ı˛ ¸fl¬˘ ˜±ÀÚı˛ ÊÚ… cij
³ 0º ¤‡Ú ˚ø i-Ó¬˜ Job j-Ó¬˜ facility-ŒÓ¬ ’±Àı˛±¬Û fl¬ı˛± ˝˚˛ Ó¬±˝À˘ xij=1 ÚÓ≈¬ı± xij=0º
Ó¬±˝À˘ ˚ø ¤ı˛+À¬Û ’±Àı˛±¬Û fl¬ı˛± ¸y¬ı ˝˚˛ Œ˚ corresponding √õ∂ÀÓ¬…fl¬ cij-¤ı˛ ˜±Ú 0 ˝˚˛ Ó¬Àı
¤˝◊ assignment-¤ı˛ ÊÚ… Œ˜±È¬ cost 0 ˝Àı ¤ı— ˚± ¸ıÀ‰¬À˚˛ fl¬˜ cost ¤ı— ¤øÈ¬ ˜ÀÚ Œı˛À‡ ’±˜ı˛±
66
NSOU
’±Àı˛±¬Û ¸˜¸…±ı˛ ¸˜±Ò±ÀÚı˛ Î¬◊¬Û˚≈ª algorithm øÚÒ«±ı˛Ì fl¬ı˛ÀÓ¬ ¬Û±øı˛ ˚± øÚÀ‰¬ øıı‘Ó¬ ≈øÈ¬ Î¬◊¬Û¬Û±À…ı˛
ï√õ∂˜±Ì Â±h¬±ó Î¬◊¬Ûı˛ øÚˆ«¬ı˛ fl¬Àı˛º
Î¬◊¬Û¬Û±… 1 : ˚ø Œfl¬±Ú ÒËnıfl¬ ¸—‡…± ïÒÚ±Rfl¬ ı± ŸÌ±Rfl¬ó cost matrix ¤ı˛ Œfl¬±Ú ¸±øı˛ ¤ı—ìı±
ô¶∏Ày¬ı˛ √õ∂ÀÓ¬…fl¬ ¬ÛÀı˛ ¸À/ Œ˚±· fl¬ı˛± ˝˚˛ Ó¬±˝À˘ ı˛+¬Û±ôL√øı˛Ó¬ ’±Àı˛±¬Û ¸˜¸…± ¤ı— √õ∂M ’±Àı˛±¬Û
¸˜¸…±ı˛ ‰¬ı˛˜ ¸˜±Ò±Ú (optimal solution) ¤fl¬˝◊ ˝Àıº
[ Œ˚ assignment ¤ı˛ ÊÚ… ’±Àı˛±¬Û ¸˜¸…±ı˛ Œ˜±È¬ cost ¸ıÀ‰¬À˚˛ fl¬˜ ˝˚˛ Ó¬±Àfl¬ ı˘± ˝Àı
optimal assignment ı± optimal solution ]
Î¬◊¬Û¬Û±… 2 : ˚ø i, j-¤ı˛ ¸fl¬˘ ˜±ÀÚı˛ ÊÚ… cij ³ 0 ˝˚˛ ¤ı— ˚ø xij=x*ij (i=1, 2.....m; j=1,
m m
2,.....m) øÚÌ«˚˛ fl¬ı˛± ˚±˚˛ ˚±ÀÓ¬ å åc

i =1 j =1
ij x*ij=0 ˝˚˛ ï’ı˜ ˜±Ú øÚÌ«˚˛ ¸—[±ôL√ ¸˜¸…±˚˛ó Ó¬±˝À˘
¸˜±Ò±ÚøÈ¬ (x*ij ; i=1, 2,.....m ; j=1, 2,.....m) ‰¬ı˛˜ ¸˜±Ò±Ú (optimal solution) ˝Àıº
Ó¬±˝À˘ Î¬◊¬ÛÀı˛ı˛ ≈øÈ¬ Î¬◊¬Û¬Û±… ŒÔÀfl¬ Œı±Á¬± Œ·˘ Œ˚ cost matrix-¤ı˛ ¸±øı˛ ¤ı— ı± ô¶∏Ày¬ı˛ √õ∂ÀÓ¬…fl¬
¬ÛÀı˛ ¸À/ Î¬◊¬Û˚≈ª ÒÚ±Rfl¬ ¸—‡…± øıÀ˚˛±· fl¬Àı˛ matrix-øÈ¬ı˛ Œı˙ fl¬À˚˛fl¬øÈ¬ ¬ÛÀı˛ ˜±Ú ˙”Ú… fl¬ı˛±
˚±Àıº Ó¬±˝À˘ ¤˝◊ˆ¬±Àı ’±˜ı˛± ¤ı˛+¬Û assignment øÚÌ«˚˛ fl¬ı˛ÀÓ¬ ¬Û±ı˛ı ˚±ÀÓ¬ corresponding
√õ∂ÀÓ¬…fl¬ cij ¤ı˛ ˜±Ú ˙”Ú… ˝Àı ¤ı— ¤˝◊ assignment ’ı˙…˝◊ optimal assignment ˝Àıº
¤‡Ú ’±˜ı˛± ’±Àı˛±¬Û ¸˜¸…± (assignment problem) ¸˜±Ò±ÀÚı˛ Step-&ø˘ (assignment
algorithum) ø˘‡ÀÓ¬ ¬Û±øı˛ ïøÚÀ‰¬ Œ‡≈Úóº
˚ø √õ∂M cost matrix-¤ı˛ ¤fl¬ ı± ¤fl¬±øÒfl¬ ¬Û (element) ³ 0 Ú± ˝˚˛ Ó¬±˝À˘ Î¬◊¬Û¬Û±… 1 √õ∂À˚˛±·
fl¬Àı˛ √õ∂ÀÓ¬…fl¬ ¬ÛÀfl¬ non-negative ïı± ³ 0ó fl¬ı˛ÀÓ¬ Û±øı˛º ¤ı˛¬Ûı˛ øÚ•ßø˘ø‡Ó¬ Step &ø˘ ’Ú≈¸ı˛Ì
fl¬ı˛ÀÓ¬ ˝Àıº
Step 1 : Cost matrix-¤ı˛ √õ∂ÀÓ¬…fl¬ ¸±øı˛ı˛ minimum ¬ÛøÈ¬ ‹ ¸±øı˛ı˛ √õ∂ÀÓ¬…fl¬ ¬Û ŒÔÀfl¬ øıÀ˚˛±·
fl¬ı˛ÀÓ¬ ˝Àıº ¤‡Ú ˜…±øÈ¬™'øÈ¬ı˛ √õ∂ÀÓ¬…fl¬ ¸±øı˛ÀÓ¬ ’ôL√Ó¬ ¤fl¬øÈ¬ ˙”Ú… ¬Û±›˚˛± ˚±Àıº ¤ı˛¬Ûı˛ √õ∂ÀÓ¬…fl¬ ô¶∏Ày¬ı˛
minimum ¬ÛøÈ¬ ‹ ô¶∏Ày¬ı˛ √õ∂ÀÓ¬…fl¬ ¬Û ŒÔÀfl¬ øıÀ˚˛±· fl¬ı˛ÀÓ¬ ˝Àıº ¤‡Ú Œ˚ ˜…±øÈ¬™' ¬Û±›˚˛± ˚±Àı
Ó¬± ˝Àı staring cost matrixº
¤‡Ú ˙”Ú… cost ¤ı˛ cell &ø˘ÀÓ¬ assigment fl¬ı˛ÀÓ¬ ˝Àı ¤ı— assigment &ø˘ optimal
assignments ˝Àı ˚ø ¸ı&ø˘ assignment Œfl¬ı˘˜±S ˙”Ú… cost ¤ı˛ cell &ø˘ÀÓ¬ fl¬ı˛± ¸y¬ı ˝˚˛º
¬Ûı˛ıÓ«¬œ step-¤ ’±˜ı˛± ¤fl¬øÈ¬ ¬ÛX¬øÓ¬ Î¬◊À{°‡ fl¬ı˛ı ˚± ŒÔÀfl¬ steop 1 ¤ı˛ assignments optimal
˝Àı øfl¬ Ú± ’±˜ı˛± ı˘ÀÓ¬ ¬Û±ı˛ıº
Step 2 : Starting matrix ¤ı˛ ¸ı&ø˘ zero øÀ˚˛ ¸ıÀ‰¬À˚˛ fl¬˜ ¸—‡…fl¬ vertical ¤ı— hori-
zontal lines È¬±ÚÀÓ¬ ˝Àıº
67
NSOU
¤‡Ú ˝˚˛ ¬Û±›˚˛± ˚±Àı (i) ¸ı˛˘Àı˛‡±ı˛ Œ˜±È¬ ¸—‡…± cost matrix ¤ı˛ [À˜ı˛ ¸˜±Ú ı± (ii)
¸ı˛˘Àı˛‡±ı˛ Œ˜±È¬ ¸—‡…± cost martix ¤ı˛ [À˜ı˛ Œ‰¬À˚˛ fl¬˜º ¤‡Ú (i) ¤ı˛ Œé¬ÀS Step 3-ŒÓ¬ Œ˚ÀÓ¬
˝Àı ¤ı— ¤‡±ÀÚ optimal assignments ¬Û±›˚˛± ˚±Àıº
Step 3 : Starting matrix ¤ı˛ √õ∂Ô˜ ¸±øı˛ ŒÔÀfl¬ qè fl¬Àı˛ √õ∂ÀÓ¬…fl¬ ¸±øı˛ ¬Ûı˛œé¬± fl¬Àı˛ ¤fl¬øÈ¬ ˜±S
0 Œ¬ÛÀ˘ 0-Œfl¬ ¨ ¤ı˛ ˜ÀÒ… ’±ıX¬ fl¬èÚ (assignment ¤ı˛ ÊÚ…) ¤ı— Ó¬±ı˛¬Ûı˛ ø‰¬ø˝êÓ¬ 0 øÀ˚˛
vertical ˘±˝◊Ú È¬±Ú≈Úº ¸ı ¸±øı˛&ø˘ ¤˝◊ˆ¬±Àı ¬Ûı˛œé¬± fl¬ı˛± ˝À˚˛ Œ·À˘ ô¶∏y¬&ø˘ ¤fl¬˝◊ˆ¬±Àı ¬Ûı˛œé¬±
fl¬èÚº ¤Àé¬ÀS √õ∂Ô˜ ô¶∏y¬ ŒÔÀfl¬ qè fl¬èÚ ¤ı— ¸˜ô¶∏ uncrossed ô¶∏Ày¬ ¤fl¬øÈ¬ ˜±S 0 Œ¬ÛÀ˘ 0-Œfl¬
¨ ¤ı˛ ˜ÀÒ… ’±ıX¬ fl¬èÚ (assignment ¤ı˛ ÊÚ…) ¤ı— ¤ı˛+¬Û √õ∂ÀÓ¬…fl¬ ø‰¬ø˝êÓ¬ O-¤ı˛ ˜Ò… øÀ˚˛
horizontal line È¬±Ú≈Úº ¤‡Ú ¸˜ô¶∏ ø‰¬ø˝êÓ¬ O &ø˘ ÒÀı˛ ï¨ ¤ı˛ ˜ÀÒ…ó optimal assignments
¬Û±›˚˛± ˚±Àıº
Step 2 ŒÓ¬ (ii) ¤ı˛ Œé¬ÀS ’±˜±Àı˛ Step 4-¤ Œ˚ÀÓ¬ ˝Àıº
Step 4 : Step 2 ŒÓ¬ Œ˚ ˘±˝◊Ú&ø˘ È¬±Ú± ˝À˚˛ÀÂ ˘±˝◊Ú&ø˘ı˛ ı±˝◊Àı˛ Œ˚ ¬Û&ø˘ ’±ÀÂ Ó¬±Àı˛ ˜ÀÒ…
Œ˚øÈ¬ ¸ıÀ‰¬À˚˛ ŒÂ±È¬ Œ¸˝◊ ¬ÛøÈ¬ ˘±˝◊Ú&ø˘ı˛ ı±˝◊Àı˛ı˛ √õ∂ÀÓ¬…fl¬øÈ¬ ¬Û ŒÔÀfl¬ øıÀ˚˛±· fl¬ı˛ÀÓ¬ ˝Àı ¤ı—
horizontal line › vertical line ¤ı˛ intersection ¤ Œfl¬±Ú ¬Û ¬Ô±fl¬À˘ Ó¬±ı˛ ¸À/ Œ˚±· fl¬ı˛ÀÓ¬
˝Àıº ¤ı˛ Ù¬À˘ modified matrix ¤ ’±ı˛› Œı˙œ ¸—‡…±fl¬ ˙”Ú… ¬Û±›˚˛± ˚±Àıº
¤ı˛¬Ûı˛ modified matrix øÚÀ˚˛ Step 2 ŒÓ¬ Œ˚ÀÓ¬ ˝Àıº ¤‡Ú› ˚ø ¸ı&ø˘ assignments Ú±
¬Û±›˚˛± ˚±˚˛ Ó¬±˝À˘ Step 4 ¤ı— Step 2 ı±ı˛ ı±ı˛ √õ∂À˚˛±· fl¬Àı˛ Œ˙¯∏ ¬Û˚«ôL√ Step 3-Œfl¬ ø·À˚˛
optimal assignments ¬Û±›˚˛± ˚±Àıº
Step 5 : Step 3 ¤ı˛ ≈øÈ¬ operation ï¸±øı˛ ı± ô¶∏y¬ øÚÀ˚˛ó ¬Ûı˛ ¬Ûı˛ fl¬ı˛À˘ Œ˙¯∏ ¬Û˚«ôL√ ’±˜ı˛±
¬Û±ı—(i) Œfl¬±Ú unmarked ˙”Ú… Ô±fl¬Àı Ú±º ı± (ii) ¤fl¬˝◊ ¸±øı˛ ı± ô¶∏Ày¬ ¤fl¬±øÒfl¬ unmarked ˙”Ú…
Ô±fl¬Àıº
√õ∂Ô˜ Œé¬ÀS unique optimal assignment ¬Û±›˚˛± ˚±Àıº
øZÓ¬œ˚˛ Œé¬ÀS ¤fl¬øÈ¬ ¸±øı˛ı˛ ïı± ô¶∏Ày¬ı˛ó ¤fl¬±øÒfl¬ unmarked ˙”Ú…&ø˘ı˛ ˜ÀÒ… ¤fl¬øÈ¬Àfl¬ ˚‘BÂˆ¬±Àı
(arbitrarily) ŒıÀÂ øÚÀ˚˛ ‹ ¸±øı˛ ı± ô¶∏Ày¬ı˛ ı±øfl¬ ˙”Ú…Àı˛ ignore fl¬ı˛ÀÓ¬ ˝Àıº ¤˝◊ √õ∂ø[˚˛±øÈ¬ ı±ı˛
ı±ı˛ ¸•Ûiß fl¬ı˛À˘ Œ˙¯∏ ¬Û˚«ôL√ ¬˜…±øÈ¬™'øÈ¬ÀÓ¬ Œfl¬±Ú unmarked ˙”Ú… Ô±fl¬Àı Ú±º ¤Àé¬ÀS ¤fl¬±øÒfl¬
optimal assignments ¬Û±›˚˛± ˚±Àıº øfl¬c√ √õ∂ÀÓ¬…fl¬ optimal assignment ¤ı˛ ÊÚ… minumum
cost ¤fl¬˝◊ ˝Àıº
[ ˆ¬±˘ fl¬Àı˛ Œı±Á¬±ı˛ ÊÚ… 13.5 ¤ı˛ Î¬◊±˝ı˛Ì&ø˘ Œ‡≈Ú ]
˜ôL√ı… † Î¬◊¬ÛÀı˛ı˛ Step &ø˘ Z±ı˛± ’±Àı˛±¬Û ¸˜¸…± ¸˜±Ò±ÀÚı˛ Œ˚ algorithm ı˘± ˝˘ Ó¬±Àfl¬
Hungarian Method ıÀ˘º
68
NSOU
13.4 ‰ ¬ı˛ ˜ ˜±Ú øÚÌ« ˚ ˛ ¸—[±ôL (Maximization Problem)
’±Àı˛ ± ¬Û ¸˜¸…±
√õ∂M ˜…±øÈ¬™'øÈ¬ profit matrix ˝À˘ ’±Àı˛±¬Û ¸˜¸…±øÈ¬ ‰¬ı˛˜ ˜±Ú øÚÌ«˚˛ ¸—[±ôL√ ’±Àı˛±¬Û ¸˜¸…±
˝Àıº ¤Àé¬ÀS profit matrix ¤ı˛ ¸ıÀ‰¬À˚˛ ıh¬ ¬ÛøÈ¬ (element) ŒÔÀfl¬ matrix-øÈ¬ı˛ √õ∂ÀÓ¬…fl¬ ¬ÛÀfl¬
(element) øıÀ˚˛±· fl¬ı˛ÀÓ¬ ˝Àı ¤ı— ¤ı˛ Ù¬À˘ Œ˚ ÚÓ≈¬Ú matrix-øÈ¬ ¬Û±›˚˛± ˚±Àı Ó¬±Àfl¬ Œfl¬±Ú ’±Àı˛±¬Û
¸˜¸…±ı˛ cost matrix ÒÀı˛ optimal assignments øÚÌ«˚˛ fl¬ı˛ÀÓ¬ ˝Àıº
’±˜ı˛± ˘é¬… fl¬ı˛øÂ Œ˚ ¤˝◊ optimal assignment-¤ı˛ ÊÚ… ÚÓ≈¬Ú ’±Àı˛±¬Û ¸˜¸…±ı˛ cost ¸ıÀ‰¬À˚˛
fl¬˜ ˝Àı ¤ı— Ó¬±ı˛ Ù¬À˘ √õ∂M ’±Àı˛±¬Û ¸˜¸…±ı˛ profit ¸ıÀ‰¬À˚˛ Œı˙œ ˝Àıº ¸≈Ó¬ı˛±— ¤˝◊ optimal
assignment-˝◊ √õ∂M ’±Àı˛±¬Û ¸˜¸…±ı˛ optimal assignment ˝Àıº
[ ’Ú≈ÀBÂ 3.5 ¤ı˛ Î¬◊±˝ı˛Ì 4 Œ‡≈Ú ]
13.5 Î¬◊  ±˝ı˛ Ì

1. ¤fl¬øÈ¬ ·±h¬œ ˆ¬±h¬±ı˛ Œfl¬±•Û±Úœı˛ I, II, III, › IV ¤˝◊ ¬Û“±‰¬øÈ¬ Ê±˚˛·± ŒÔÀfl¬ ·±h¬œ ˆ¬±h¬± Œ˚˛º
√õ∂ÀÓ¬…fl¬ Ê±˚˛·±ÀÓ¬˝◊ ¤fl¬øÈ¬ fl¬Àı˛ ·±h¬œ ’±ÀÂº A, B, C › D ¤˝◊ ‰¬±ı˛øÈ¬ ˙˝Àı˛ı˛ √õ∂ÀÓ¬…fl¬øÈ¬ÀÓ¬˝◊ ≈ÊÚ
Œ˘±Àfl¬ı˛ ¤fl¬øÈ¬ fl¬Àı˛ ·±h¬œ ı˛fl¬±ı˛º ‹ Ê±˚˛·±&ø˘ ŒÔÀfl¬ ˙˝Àı˛ı˛ Œ˚‡±ÀÚ ·±h¬œı˛ √õ∂À˚˛±ÊÚ ’±ÀÂ ¤Àı˛
”ı˛Q øfl¬À˘±ø˜È¬±Àı˛ øÚ•ßø˘ø‡Ó¬ ˜…±øÈ¬™À'ı˛ ¸±˝±À˚… √õ∂fl¬±˙ fl¬ı˛± ˝˘—
I II III IV
A 10 14 19 13
B 15 19 7 18
C 13 15 22 14
D 18 20 10 9
¸˜±Ò±Ú † √õ∂Ô˜ ¸±øı˛ı˛ ¸ı«øÚ•ß Î¬◊¬Û±±Ú 10 ; ›˝◊ ¸±øı˛ı˛ ’Ú… Î¬◊¬Û±±Ú&ø˘ ŒÔÀfl¬ 10 øıÀ˚˛±· fl¬ı˛±
˝˘º ’Ú≈ı˛+¬Ûˆ¬±Àı ’¬Ûı˛ ¸±øı˛&ø˘ı˛ Œé¬ÀS› ¸ı«øÚ•ß Î¬◊¬Û±±Ú ’¬Ûı˛ Î¬◊¬Û±±Ú&ø˘ ŒÔÀfl¬ øıÀ˚˛±· fl¬ı˛±
˝˘º ’±˜ı˛± øÚÀ‰¬ı˛ ˜…±øÈ¬™'øÈ¬ ¬Û±ıº
I II III IV
A 0 4 9 3
B 8 12 0 11
C 0 2 9 1
D 9 11 1 0
69
NSOU
¤‡Ú √õ∂øÓ¬øÈ¬ ô¶∏Ày¬ı˛ ¸ı«øÚ•ß Î¬◊¬Û±±Ú ›˝◊ ô¶∏Ày¬ı˛ ’Ú… Î¬◊¬Û±±Ú&ø˘ ŒÔÀfl¬ øıÀ˚˛±· fl¬ı˛± ˝˘º øÚÀı˛
˜…±øÈ¬™'øÈ¬ ¬Û±›˚˛± Œ·˘ †
I II III IV
A 0 2 9 3
B 8 10 0 11
C 13 15 22 14
D 18 20 10 9
Œ‡± ˚±ÀBÂ Œ˚, (1, 1), (2, 3), (3, 1), (3, 2) › (4, 4) cell ¤ı˛ √õ∂ÀÓ¬…fl¬øÈ¬ÀÓ¬ 0 ï˙”Ú…ó
’±ÀÂº
¸˜ô¶∏ ˙”Ú…&ø˘Àfl¬ minimum ¸—‡…fl¬ ¸ı˛˘Àı˛‡± Z±ı˛± fl¬±È¬±
˝˘º ¤‡±ÀÚ ¸ı˛˘Àı˛‡±ı˛ ¸—‡…± = 4 = ˜…±øÈ¬™À'ı˛ [˜º
√õ∂Ô˜ ¸±øı˛ı˛ (1, 1) cell-¤ Œfl¬ı˘˜±S ¤fl¬øÈ¬ ˙”Ú… ’±ÀÂº
¤˝◊ zero-Œfl¬ ¨ ø‰¬À˝êı˛ ˜ÀÒ… Œı˛À‡ √õ∂Ô˜ ô¶∏y¬Àfl¬ ı± Œ›˚˛±
˝˘ ’Ô«±» A-Œfl¬ I Ú— Ê±˚˛·± ŒÔÀfl¬ ·±h¬œ Œ›˚˛± ˝˘º øZÓ¬œ˚˛
¸±øı˛ı˛ (2, 3) cell-¤ Œfl¬ı˘˜±S ¤fl¬øÈ¬ ˙”Ú… ’±ÀÂº ¤˝◊ ˙”Ú…Àfl¬
¨ ø‰¬À˝êı˛ ˜ÀÒ… Œı˛À‡ Ó‘¬Ó¬œ˚˛ ô¶∏y¬Àfl¬ Œfl¬ÀÈ¬ Œ›˚˛± ˝˘ ’Ô«±»
B-Œfl¬ III Ú— Ê±˚˛·± ŒÔÀfl¬ ·±h¬œ Œ›˚˛± ˝˘º Ó‘¬Ó¬œ˚˛ ¸±øı˛ÀÓ¬
¤‡Ú Œfl¬ı˘˜±S (3, 2) cell-¤ ˙”Ú… ’±ÀÂº ¤˝◊ ˙”Ú…Àfl¬
¨ ø‰¬À˝êı˛ ˜ÀÒ… Œı˛À‡ øZÓ¬œ˚˛ ô¶∏y¬Àfl¬ Œfl¬ÀÈ¬ Œ›˚˛± ˝˘ ’Ô«±»
C-Œfl¬ II Ú— Ê±˚˛·± ŒÔÀfl¬ ·±h¬œ Œ›˚˛± ˝˘º ‰¬Ó≈¬Ô« ¸±øı˛ÀÓ¬
Œfl¬ı˘˜±S (4, 4) cell-¤ ˙”Ú… ’±ÀÂº ¤˝◊ ˙”Ú…Àfl¬ ¨ ø‰¬À˝êı˛
˜ÀÒ… Œı˛À‡ ‰¬Ó≈¬Ô« ô¶∏y¬Àfl¬ Œfl¬ÀÈ¬ Œ›˚˛± ˝˘ ’Ô«±» D-Œfl¬ IV
Ú— Ê±˚˛·± ŒÔÀfl¬ ·±h¬œ Œ›˚˛± ˝˘º
\ ’±Àı˛±¬Û ¸˜¸…±øÈ¬ı˛ ¸˜±Ò±Ú ˝˘ † A ® I, B ® III, C ® II, D ® IV
¤ı— ’ı˜ ”ı˛Q (minimum distance) = 10 + 7 + 15 + 9 = 41 øfl¬À˘±ø˜È¬±ı˛º
2. A, B, C, D ‰¬±ı˛ÊÚ… ı…øªÀfl¬ ‰¬±ı˛øÈ¬ Œ˜˙øÚ I, II, III › IV-¤ fl¬±ÀÊ øÚÀ˚˛±· fl¬ı˛ÀÓ¬ ˝Àıº
È¬±fl¬±˚˛ ’±Àı˛±À¬Ûı˛ ‡ı˛‰¬ (assignment cost) Œ›˚˛± ˝˘º ’±Àı˛±À¬Ûı˛ ’ı˜ ‡ı˛‰¬ (minumum cost)
øÚÌ«˚˛ fl¬èÚº
70
NSOU
I II III IV
A 18 26 17 11
B 13 38 14 26
C 38 39 18 15
D 19 26 24 10
¸˜±Ò±Ú † ¬√õ∂Ô˜ ¸±øı˛ı˛ ¸ı«øÚ•ß ‡ı˛‰¬ 11, ‹ ¸±øı˛ı˛ ’Ú… Î¬◊¬Û±±Ú&ø˘ ŒÔÀfl¬ øıÀ˚˛±· fl¬ı˛± ˝˘º
’Ú≈ı˛+¬Ûˆ¬±Àı ’¬Ûı˛ ¸±øı˛&ø˘ı˛ Œé¬ÀS› ¸ı«øÚ•ß ‡ı˛‰¬ ’¬Ûı˛ Î¬◊¬Û±±Ú&ø˘ ŒÔÀfl¬ øıÀ˚˛±· fl¬ı˛± ˝˘º
’±˜ı˛± øÚÀ‰¬ı˛ ˜…±øÈ¬™'øÈ¬ ¬Û±ı †
I II III IV
A 7 15 6 0
B 0 25 1 13
C 23 24 3 0
D 9 16 14 0
¤‡Ú √õ∂øÓ¬øÈ¬ ô¶∏Ày¬ı˛ ¸ı«øÚ•ß ‡ı˛‰¬ ›˝◊ ô¶∏Ày¬ı˛ ’Ú… Î¬◊¬Û±±Ú&ø˘ ŒÔÀfl¬ øıÀ˚˛±· fl¬ı˛± ˝˘º øÚÀ‰¬ı˛
˜…±øÈ¬™'øÈ¬ ¬Û±›˚˛± Œ·˘ †
I II III IV
A 7 0 5 0
B 0 10 0 13
C 23 9 2 0
D 9 11 13 0
Œ‡± ˚±ÀBÂ Œ˚ (1, 2), (2, 1), (2, 3), (3, 4) › (4, 4) cell-¤ı˛ √õ∂ÀÓ¬…fl¬øÈ¬ÀÓ¬ ˙”Ú… ’±ÀÂº
71
NSOU
¸˜ô¶∏ ˙”Ú…&ø˘Àfl¬ minimum ¸—‡…fl¬ ¸ı˛˘Àı˛‡± Z±ı˛± fl¬±È¬± ˝˘º ¤‡±ÀÚ ¤ı˛fl¬˜ ¸ı˛˘Àı˛‡±ı˛
¸—‡…± = 3 = ¹ ˜…±øÈ¬™À'ı˛ [˜º
\ ’±Àı˛±¬Û ¸˜¸…±øÈ¬ı˛ ¸˜±Ò±Ú ¬Û±›˚˛± ˚±˚˛øÚº
Î¬◊¬ÛÀı˛ı˛ ˜…±øÈ¬™'øÈ¬ÀÓ¬ ¸ı˛˘Àı˛‡± Z±ı˛± fl¬±È¬± ˝˚˛øÚ fl¬±ı˛Ì Î¬◊¬Û±±Ú&ø˘ı˛ ˜ÀÒ… é≈¬^Ó¬˜ Î¬◊¬Û±±ÚøÈ¬ ˝˘
2º fl¬±È¬± ˝˚˛øÚ ¤˜Ú Î¬◊¬Û±±Ú&ø˘ı˛ √õ∂ÀÓ¬…fl¬øÈ¬ı˛ ŒÔÀfl¬ 2 øıÀ˚˛±· fl¬ı˛ÀÓ¬ ˝Àı, ¸ı˛˘Àı˛‡±&ø˘ Œ˚ Œ˚
Ê±˚˛·±˚˛ øÚÀÊÀı˛ ˜ÀÒ… ŒÂ fl¬Àı˛ÀÂ Œ¸‡±ÀÚ 2 Œ˚±· fl¬ı˛ÀÓ¬ ˝Àı Ä ı±fl¬œ ŒÂøÓ¬ Î¬◊¬Û±±Ú&ø˘
’¬Ûøı˛ıøÓ«¬Ó¬ Ô±fl¬Àıº Ó¬±˝À˘ øÚÀ‰¬ı˛ ˜…±øÈ¬™'øÈ¬ ¬Û±›˚˛± ˚±Àıº
5 0 3 0
0 12 0 15
21 9 0 0
7 11 11 0
’±ı±ı˛, ¸˜ô¶∏ ˙”Ú…&ø˘Àfl¬ minimum ¸—‡…fl¬ ¸ı˛˘Àı˛‡± øÀ˚˛ fl¬±È¬± ˝˘º

¤‡±ÀÚ ¤ı˛fl¬˜ ¸ı˛˘Àı˛‡±ı˛ ¸—‡…± = 4 = ˜…±øÈ¬™À' [˜º
’±Àı˛±¬Û ¸˜¸…±øÈ¬ı˛ ¸˜±Ò±Ú ¬Û±›˚˛± Œ·˘º

¸˜±Ò±ÚøÈ¬ ˝˘ † A ® II, B ® I, C ® III, D ® IV
¤ı— ’ı˜ ‡ı˛‰¬ (minimum cost) = 26 + 13 + 18 + 10 + = 67 È¬±fl¬±º
3. ‰¬±ı˛øÈ¬ Œ˜ø˙Ú ‰¬±˘±ÀÚ±ı˛ ÊÚ… ‰¬±ı˛ÊÚ ’¬Û±Àı˛È¬ı˛ øÚÀ˚˛±· fl¬ı˛± ˝Àıº Œfl¬±Ú øıÀ˙¯∏ Œ˜ø˙ÀÚ Œfl¬±Ú
’¬Û±Àı˛È¬±ı˛Àfl¬ øÚÀ˚˛±· fl¬ı˛À˘ Ó¬±ı˛ èÌ ‡ı˛‰¬ øfl¬ ˝Àı Ó¬± øÚÀ‰¬ ïÈ¬±fl¬±˚˛ ø˝¸±Àıó Œ›˚˛± ˝˘º 3 Ú—
Œ˜ø˙ÀÚ A ’¬Û±Àı˛È¬ı˛Àfl¬ › 4 Ú— Œ˜ø˙ÀÚ C ’¬Û±Àı˛È¬ı˛Àfl¬ øÚÀ˚˛±· fl¬ı˛± ˚±Àı Ú±º fl¬±Àfl¬ Œfl¬±Ô±˚˛
øÚÀ˚˛±· fl¬ı˛À˘ Œ˜±È¬ ‡ı˛‰¬ ¸ı«øÚ•ß ˝Àı∑ Œ˜ø˙Ú
1 2 3 4
A 5 5 ¥ 2
B 7 4 2 3
’¬Û±Àı˛È¬ı˛
C 9 3 5 ¥
D 7 2 6 7
72
NSOU
¸˜±Ò±Ú † Œ˚À˝Ó≈¬ A ’¬Û±Àı˛È¬ı˛Àfl¬ 3 Ú— Œ˜ø˙ÀÚ ¤ı— C ’¬Û±Àı˛È¬ı˛Àfl¬ 4Ú— Œ˜ø˙ÀÚ øÚÀ˚˛±· fl¬ı˛±
˚±Àı Ú±, ’±˜ı˛± (1, 3) › (2, 4) cell-¤ ’Ú…±Ú… ‡ı˛‰¬&À˘±ı˛ Ó≈¬˘Ú±˚˛ ¤fl¬È≈¬ Œıø˙ ‡ı˛‰¬ 10 ÒÀı˛ ŒÚıº
Ó¬±˝À˘ ˜…±øÈ¬™'øÈ¬ ˝Àıñ 1 2 3 4
A 5 5 10 2
B 7 4 2 3
C 9 3 5 10
D 7 2 6 7
√õ∂Ô˜ ¸±øı˛ı˛ ¸ı«øÚ•ß ‡ı˛‰¬ 2, ‹ ¸±øı˛ı˛ ’Ú…±Ú… ‡ı˛‰¬&ø˘ ŒÔÀfl¬ øıÀ˚˛±· fl¬ı˛± ˝˘º ’Ú≈ı˛+¬Ûˆ¬±Àı
’Ú…±Ú… ¸±øı˛&ø˘ı˛ Œé¬ÀS› ¸ı«øÚ•ß ‡ı˛‰¬ ’Ú…±Ú… ‡ı˛‰¬&ø˘ ŒÔÀfl¬ øıÀ˚˛±· fl¬ı˛± ˝˘º ’±˜ı˛± øÚÀ‰¬ı˛
˜…±øÈ¬™'øÈ¬ ¬Û±ıº 1 2 3 4
A 3 3 8 0
B 5 2 0 1
C 6 0 2 7
D 5 0 4 5
’±ı±ı˛, √õ∂øÓ¬øÈ¬ ô¶∏Ày¬ı˛ ¸ı«øÚ•ß ‡ı˛‰¬ ›˝◊ ô¶∏Ày¬ı˛ ’Ú…±Ú… ‡ı˛‰¬&ø˘ ŒÔÀfl¬ øıÀ˚˛±· fl¬ı˛± ˝˘º øÚÀ‰¬ı˛
˜…±øÈ¬™'øÈ¬ ¬Û±›˚˛± Œ·˘º
¸˜ô¶∏ ˙”Ú…&ø˘Àfl¬ ¸ı ŒÔÀfl¬ fl¬˜ ¸—‡…fl¬ ¸ı˛˘Àı˛‡± Z±ı˛± fl¬±È¬± ˝˘º

¤‡±ÀÚ ı˛fl¬˜ ¸ı˛˘Àı˛‡±ı˛ ¸—‡…± = 3 ˜…±øÈ¬™À'ı˛ [˜º
\ ’±Àı˛±¬Û ¸˜¸…±øÈ¬ı˛ ¸˜±Ò±Ú ¬Û±›˚˛± Œ·˘ Ú±º
Î¬◊¬ÛÀı˛ı˛ ˜…±øÈ¬™'øÈ¬ÀÓ¬ fl¬±È¬± ˚±˚˛øÚ ¤˜Ú Î¬◊¬Û±±Ú&ø˘ı˛ ˜ÀÒ… é≈¬^Ó¬˜ Î¬◊¬Û±±Ú ˝˘ 1 ï¤fl¬óº fl¬±È¬±
˝˚˛øÚ ¤˜Ú Î¬◊¬Û±±Ú&ø˘ ŒÔÀfl¬ 1 øıÀ˚˛±· fl¬ı˛± ˝˘º ¸ı˛˘Àı˛‡±&ø˘ Œ˚ Œ˚ Ê±˚˛·±˚˛ øÚÀÊÀı˛ ˜ÀÒ…
ŒÂ fl¬Àı˛ÀÂ Œ¸‡±ÀÚ 1 Œ˚±· fl¬ı˛ÀÓ¬ ˝Àı Ä ı±fl¬œ ŒÂøÓ¬ Î¬◊¬Û±±Ú&ø˘ ’¬Ûøı˛ıøÓ«¬Ó¬ Ô±fl¬Àıº Ó¬±˝À˘
øÚÀ‰¬ı˛ ˜…±øÈ¬™'øÈ¬ ¬Û±›˚˛± ˚±Àı †
73
NSOU
¸˜ô¶∏ ˙”Ú…&ø˘Àfl¬ ¸ıÀÔÀfl¬ fl¬˜ ¸—‡…fl¬ ¸ı˛˘Àı˛‡± Z±ı˛± fl¬±È¬± ˝˘º ¤˜Ú ¸ı˛˘Àı˛‡±ı˛
¸—‡…± =3 ¹ ˜…±øÈ¬™À'ı˛ [˜º
\ ¤‡Ú› ¬Û˚«ôL√ ’±Àı˛±¬Û ¸˜¸…±ı˛ ¸˜±Ò±Ú ¬Û±›˚˛± Œ·˘ Ú±º ’±ı±ı˛, ¤˝◊ ˜…±øÈ¬™À'ı˛ Î¬◊¬Û±±Ú&ø˘ı˛
Œé¬ÀS Î¬◊¬ÛÀı˛ı˛ ¬ÛX¬øÓ¬ √õ∂À˚˛±· fl¬Àı˛ øÚÀ‰¬ı˛ ˜…±øÈ¬™'øÈ¬ ¬Û±›˚˛± Œ·˘º
¸˜ô¶∏ ˙”Ú…&ø˘Àfl¬ ¸ıÀÔÀfl¬ fl¬˜ ¸—‡…fl¬ ¸ı˛˘Àı˛‡± Z±ı˛± fl¬±È¬± ˝˘º

¤‡±ÀÚ, ¤ı˛fl¬˜ ¸ı˛˘Àı˛‡± ¸—‡…± = 4 = ˜…±øÈ¬™À'ı˛ [˜º
’±Àı˛±¬Û ¸˜¸…±øÈ¬ı˛ ¸˜±Ò±Ú ¬Û±›˚˛± Œ·˘º
¸˜±Ò±ÚøÈ¬ ˝˘ † A ® 4, B ® 3, C ® 2, D ® 1
¸ı«øÚ•ß ‡ı˛‰¬ = 2 + 2 + 3 + 7 = 14 È¬±fl¬±º
4. ¤fl¬øÈ¬ ¸±ı±Ú √õ∂dÓ¬fl¬±ı˛œ ¸—î±˚˛ 4 ÊÚ Œ¸˘¸ƒ˜…±Ú A, B, C › D-Œfl¬ ‰¬±ı˛øÈ¬ ˙˝ı˛ 1, 2, 3,
¤ı— 4-¤ ¸±ı±Ú øı[œı˛ ÊÚ… ¬Û±Í¬±˚˛º √õ∂øÓ¬øÈ¬ Œ¸˘¸ƒ˜…±Ú ¤ı˛ Œé¬ÀS øıøˆ¬iß ˙˝Àı˛ ¸±ı±Ú ˘±Àˆ¬ı˛
¬Ûøı˛˜±Ì ïÈ¬±fl¬±ı˛ó Œ›˚˛± ˝˘º fl¬±Àfl¬ Œfl¬±Ô±˚˛ øÚÀ˚˛±· fl¬ı˛À˘ ›˝◊ ¸—î±˚˛ Œ˜±È¬ ˘±ˆ¬ ¸ıÀÔÀfl¬ Œıø˙
˝Àı∑
˙˝ı˛
1 2 3 4
A 42 35 28 21
B 30 25 20 15
Œ¸˘¸ƒ˜…±Ú
C 30 25 20 15
D 24 20 16 12
74
NSOU
¸˜±Ò±Ú † ¤‡±ÀÚ ¸˜…¸±øÈ¬ ˝˘ ¸ıÀ‰¬À˚˛ Œıø˙ ˘±Àˆ¬ı˛ ¬Ûøı˛˜±Ì øÚÌ«˚˛ fl¬ı˛±º √õ∂M ˜…±øÈ¬™À'ı˛
¸ıÀÔÀfl¬ ıh¬ Î¬◊¬Û±±Ú ˝˘ 42º 42 ŒÔÀfl¬ ˜…±øÈ¬™À'ı˛ ¸˜ô¶∏ Î¬◊¬Û±±Ú&À˘±Àfl¬ øıÀ˚˛±· fl¬Àı˛ ÚÓ≈¬Ú ¤fl¬È¬±
˜…±øÈ¬™' ΔÓ¬øı˛ fl¬ı˛± ˝˘º ¤ı˛ Î¬◊¬Û±±Ú&ø˘ é¬øÓ¬ı˛ ¬Ûøı˛˜±Ì øÚÀ˙ fl¬ı˛Àıº ÚÓ≈¬Ú ˜…±øÈ¬™À'ı˛ Œé¬ÀS ¸ı«øÚ•ß
é¬øÓ¬ı˛ ¬Ûøı˛˜±Ì øÚÌ«˚˛ fl¬ı˛ÀÓ¬ ˝Àıº
ÚÓ≈¬Ú ˜…±øÈ¬™'øÈ¬ ˝˘ † 1 2 3 4
A 0 7 14 21
B 12 17 22 27
C 12 17 22 27
D 18 22 26 30
√õ∂øÓ¬øÈ¬ ¸±øı˛ı˛ Œé¬ÀS ¸ı«øÚ•ß Î¬◊¬Û±±Ú ’¬Ûı˛ Î¬◊¬Û±±Ú&ø˘ ŒÔÀfl¬ øıÀ˚˛±· fl¬Àı˛ øÚÀ‰¬ı˛ ˜…±øÈ¬™'øÈ¬
¬Û±›˚˛± Œ·˘º 1 2 3 4
A 0 7 14 21
B 0 5 10 15
C 0 5 10 15
D 0 4 8 12
√õ∂øÓ¬øÈ¬ ô¶∏Ày¬ı˛ Œé¬ÀS ¸ı«øÚ•ß Î¬◊¬Û±±Ú ’¬Ûı˛ ¬Î¬◊¬Û±±Ú&ø˘ı˛ ŒÔÀfl¬ øıÀ˚˛±· fl¬Àı˛ øÚÀ‰¬ı˛ ˜…±øÈ¬™'øÈ¬
¬Û±›˚˛± Œ·˘º
1 2 3 4
.
A 0 3 6 9
.
B 0. 1 2 3
.
C 0. 1 2 3
.
D 0.. 0 0 0
¸˜ô¶∏ ˙”Ú…&ø˘ı˛ Î¬◊¬Ûı˛ øÀ˚˛ ¸ıÀÔÀfl¬ fl¬˜ ¸—‡…fl¬ ¸ı˛˘Àı˛‡± È¬±Ú± ˝˘º ¤˜Ú ¸ı˛˘Àı˛‡±ı˛ ¸—‡…±
= 2 ¹ ˜…±øÈ¬™À'ı˛ [˜º
Œ˚ Î¬◊¬Û±±Ú&ø˘ fl¬±È¬± ˝˚˛øÚ Ó¬±Àı˛ ˜ÀÒ… ¸ı«øÚ•ß ¸—‡…± ˝˘ 1º Œ˚ Î¬◊¬Û±±Ú&ø˘ ŒÂøÓ¬ ˝˚˛øÚ
Ó¬±Àı˛ √õ∂ÀÓ¬…Àfl¬ı˛ ŒÔÀfl¬ 1 øıÀ˚˛±· fl¬ı˛± ˝˘º ¸ı˛˘Àı˛‡±≈øÈ¬ı˛ ŒÂøıj≈ÀÓ¬ 1 Œ˚±· fl¬ı˛± ˝˘ Ä ’Ú…±Ú…
ŒÂøÓ¬ Î¬◊¬Û±±Ú&ø˘ ’¬Ûøı˛ıøÓ«¬Ó¬ Ô±fl¬˘º øÚÀ‰¬ı˛ ˜…±øÈ¬™'øÈ¬ ¬Û±›˚˛± Œ·˘ †
75
NSOU
¸˜ô¶∏ ˙”Ú…&ø˘ ¸ıÀÔÀfl¬ fl¬˜ ¸—‡…fl¬ ¸ı˛˘Àı˛‡± Z±ı˛± fl¬±È¬± ˝˘º ¤˜Ú ¸ı˛˘Àı˛‡±ı˛ ¸—‡…± = 3 ˜…±øÈ¬™À'ı˛
[˜º
’±ı±ı˛ Î¬◊¬ÛÀı˛ı˛ ¬ÛX¬øÓ¬ √õ∂À˚˛±· fl¬Àı˛ øÚÀ‰¬ı˛ ˜…±øÈ¬™'øÈ¬ ¬Û±›˚˛± Œ·˘º
¸˜ô¶∏ ˙”Ú…&ø˘ ¸ıÀÔÀfl¬ fl¬˜ ¸—‡…fl¬ ¸ı˛˘Àı˛‡± Z±ı˛± ˚≈ª fl¬ı˛À˘ ¸ı˛˘Àı˛‡±ı˛ ¸—‡…± = 4 = ˜…±øÈ¬™À'ı˛
[˜º
’±Àı˛±¬Û ¸˜¸…±øÈ¬ı˛ ¸˜±Ò±Ú ¬Û±›˚˛± Œ·˘º
A ® 1, B ® 3, C ® 2, D ® 4
¸ıÀÔÀfl¬ Œıø˙ ˘±ˆ¬ = 42 + 20 + 25 + 12 = 99 È¬±fl¬±º
¸˜¸…±øÈ¬ı˛ øıfl¬ä ¸˜±Ò±Ú †

A ® 1, B ® 2, C ® 3, D ® 4
¸Àı«±B‰¬ ˘±ˆ¬ = 42 + 25 + 20 + 12 = 99 È¬±fl¬±º
76
NSOU
13.6 ëw±˜…˜±Ì øıÀ[Ó¬± ¸˜¸…± (Travelling Salesman
Problem)
ëw±˜…˜±Ì øıÀ[Ó¬±í ¸˜¸…± ı˘ÀÓ¬ øfl¬ Œı±Á¬±˚˛ Ó¬± øÚÀ‰¬ ı˘± ˝˘ †

˜ÀÚ fl¬èÚ ¤fl¬ÊÚ w±˜…˜±Ì øıÀ[Ó¬±Àfl¬ n ¸—‡…fl¬ ˙˝ı˛ visit fl¬ı˛ÀÓ¬ ˝Àıº ¤‡Ú ÒèÚ Œ˚ Œfl¬±Ú ˙˝ı˛
ŒÔÀfl¬ ’Ú… Œ˚ Œfl¬±Ú ˙˝Àı˛ı˛ ”ı˛Q ïı± ¤fl¬øÈ¬ ˙˝ı˛ ŒÔÀfl¬ ’Ú… ˙˝Àı˛ ˚±›˚˛±ı˛ ¸˜˚˛ ı± ¬Ûøı˛ı˝Ì ‡ı˛‰¬ó
Ê±Ú± ’±ÀÂº Œ˚ Œfl¬±Ú ˙˝ı˛ ŒÔÀfl¬ w˜Ì qè fl¬Àı˛ √õ∂ÀÓ¬…fl¬ ˙˝ı˛Àfl¬ ¤fl¬ı±ı˛ visit fl¬Àı˛ w±˜…˜±Ì øıÀ[Ó¬±Àfl¬
starting ˙˝Àı˛ øÙ¬Àı˛ ’±¸ÀÓ¬ ˝Àıº w±˜…˜±Ì øıÀ[Ó¬±ı˛ ¸˜¸…± ˝˘ ¤˜Ú route øÍ¬fl¬ fl¬ı˛ÀÓ¬ ˝Àı ˚±ÀÓ¬
route øÈ¬ı˛ Œ˜±È¬ Δ‚«… ïı± ¸˜˚˛ ı± ‡ı˛‰¬ó ¸ıÀ‰¬À˚˛ fl¬˜ ˝˚˛º ’±˜ı˛± ˘é¬… fl¬ı˛øÂ Œ˚ ¤‡±ÀÚ Œ˚ Œfl¬±Ú ˙˝ı˛Àfl¬
starting ˙˝ı˛ ø˝¸±Àı ŒÚ›˚˛± ˚±˚˛º
¸˜¸…±øÈ¬ı˛ ·±øÌøÓ¬fl¬ ı˛+¬Û †
˜ÀÚ fl¬èÚ i-Ó¬˜ ˙˝ı˛ ŒÔÀfl¬ j-Ó¬˜ ˙˝Àı˛ ˚±›˚˛±ı˛ ¸˜˚˛ ïı± ”ı˛Q ı± ‡ı˛‰¬ó ˝˘ cij ¤ı— ÒèÚ xij=1,
˚ø øıÀ[Ó¬± ¸ı˛±¸øı˛ i-Ó¬˜ ˙˝ı˛ ŒÔÀfl¬ j-Ó¬˜ ˙˝ı˛ ˚±˚˛º
= 0 ’Ú…Ô±˚˛º
¤‡Ú øıÀ[Ó¬±ı˛ ¸˜¸…± ˝˘ ‰¬˘ xij Œı˛ ˜±Ú øÚÌ«˚˛ fl¬ı˛± ˚±ÀÓ¬ √õ∂ÀÓ¬…fl¬ ˙˝ı˛ visit fl¬Àı˛ tour ¸•Û”Ì« fl¬ı˛±ı˛
’±À· Œ˚Ú Œfl¬±Ú ˙˝ı˛ Œ¸ ≈ı±ı˛ visit Ú± fl¬Àı˛ ¤ı— Œ˜±È¬ ”ı˛Q ïı± ‡ı˛‰¬ ı± ¸˜˚˛ó
m n
z=å åc ij xij , ¸ıÀ‰¬À˚˛ fl¬˜ ˝˚˛º
i =1 j =1
¤˝◊ ¸˜¸…±ı˛ Œé¬ÀS ’±ı˛ ¤fl¬øÈ¬ ˙Ó«¬ ˝˘ Œ˚ Œfl¬±Ú ˙˝ı˛ ŒÔÀfl¬ Œ¸˝◊ ˙˝Àı˛˝◊ ˚±›˚˛±ı˛ ‚È¬Ú± fl¬‡Ú˝◊ ˝Àı
Ú± ¤ı— Ù¬À˘ ı˛œøÓ¬ ’Ú≈˚±˚˛œ cii= ¥ , Òı˛ÀÓ¬ ˝Àı (i=1, 2,....n)º ¸≈Ó¬ı˛±— xii-¤ı˛ ˜±Ú fl¬‡Ú˝◊ 1 ˝Àı Ú±º
Ó¬±˝À˘ ëw±˜…˜±Ú øıÀ[Ó¬±í ¸˜¸…±øÈ¬ı˛ ·±øÌøÓ¬fl¬ ı˛+¬Û ˝˘ †
m n
’ı˜ z = å åc ij xij ,
i -1 j =1
˙Ó«¬¸±À¬ÛÀé åx
j =1
ij = 1 , i=1, 2,.....n ;
åx
i =1
ij = 1, j=1, 2,.....n ;
¤ı— xij=1 ı± 0, xii ¹ 1, (i=1, 2,.....n ; j=1, 2,.....n)

’±˜ı˛± ˘é¬… fl¬ı˛øÂ Œ˚ ˚ø w±˜…˜±Ì øıÀ[Ó¬±Àfl¬ n ¸—‡…fl¬ ˙˝ı˛ visit fl¬ı˛ÀÓ¬ ˝˚˛ Ó¬±˝À˘ distance (or
cost or time) matrix øÈ¬ øÚÀ‰¬ı˛ ’±fl¬±ı˛ ˝Àı †
77
NSOU
1 2 . . . . . . . . n
1 ¥ c12 . . . . . . . . c1n
2 c21 ¥ . . . . . . . . c2n
.
. . . . .
. . . .
. . . . .
. . . . .
n cm1 cm2 . . . . . . . . ¥
ëw±˜…˜±Ì øıÀ[Ó¬± ¸˜¸…±ı˛ ·øÌøÓ¬fl¬ ı˛¬+ Û ŒÔÀfl¬ ’±˜ı˛± ı˘ÀÓ¬ ¬Û±øı˛ Œ˚ ¤˝◊ ¸˜¸…± ¤ı— ’±Àı˛±¬Û ¸˜¸…±
’ÀÚfl¬È¬±˝◊ ¤fl¬˝◊ ı˛fl¬˜—qÒ≈ ¬Û±Ô«fl¬… ˝˘ ¤˝◊ Œ˚ √õ∂Ô˜ ¸˜¸…±øÈ¬ÀÓ¬ ’øÓ¬øı˛ª ˙Ó«¬ ïŒfl¬±Ú ˙˝ı˛ ŒÔÀfl¬ qè
fl¬Àı˛ tour ¸•Û”Ì« fl¬Àı˛ Œ¸˝◊ ˙˝Àı˛˝◊ øÙ¬Àı˛ ’±¸ÀÓ¬ ˝Àıó Ô±fl¬±ı˛ ÊÚ… ¸˜¸…±øÈ¬Àfl¬ ’±Àı˛±¬Û ¸˜¸…± ø˝¸±Àı
¸˜±Ò±Ú fl¬Àı˛ ˚ø 1 ® 2 ® 3 ® 4.....n ® 1 ı± ’Ú≈ı˛+¬Û ’±fl¬±Àı˛ı˛ optimal assignment ¬Û±›˚˛± ˚±˚˛
ï˚±ÀÓ¬ Œfl¬±Ú sub-loop Ú±˝◊ó Ó¬±˝À˘ ¤˝◊ optimal assignment ŒÔÀfl¬ ëw±˜…˜±Ì øıÀ[Ó¬±í ¸˜¸…±ı˛ ‰¬ı˛˜
¸˜±Ò±Ú ¬Û±›˚˛± ˚±Àıº
øfl¬c√ ’±Àı˛±¬Û ¸˜¸…± ø˝¸±Àı ¸˜±Ò±Ú fl¬ı˛ÀÓ¬ ø·À˚˛ ˚ø optimal assignment ¤ ¤fl¬±øÒfl¬ sub-loop
¬Û±›˚˛± ˚±˚˛ Ó¬±˝À˘ ëw±˜…˜±Ì øıÀ[Ó¬±í ¸˜…¸±øÈ¬ı˛ ¸˜±Ò±Ú øÚÌ«˚˛ fl¬ı˛ÀÓ¬ ˝À˘ enumerative ï·ÌÚ±˜”˘fl¬ó
¬ÛX¬øÓ¬ √õ∂À˚˛±· fl¬ı˛ÀÓ¬ ˝Àı ï13.7 ¤ı˛ Î¬◊±˝ı˛Ì Œ‡≈Úóº Œ˚˜Ú 4øÈ¬ ˙˝ı˛ 1, 2, 3, 4 ¤ı˛ Œé¬ÀS ˚ø
optimal assignment 1 ® 4, 2 ® 3, 3 ® 2, 4 ® 1 ˝˚˛ Ó¬±˝À˘ ¤Àé¬ÀS enumerative ï·ÌÚ±˜”˘fl¬ó
¬ÛX¬øÓ¬ √õ∂À˚˛±· fl¬ı˛ÀÓ¬ ˝Àı fl¬±ı˛Ì ¤‡±ÀÚ (1, 4), (4, 1) ¤ı— (2, 3), (3, 2) ≈øÈ¬ sub-loop ’±ÀÂº
13.7 Î¬◊  ±˝ı˛ Ì
øÚÀ‰¬ı˛ ëw±˜…˜±Ì øıÀ[Ó¬± ¸˜¸…±øÈ¬ ¸˜±Ò±Ú fl¬ı˛+Ú †

A B C D E
A ¥ 6 12 0 4
B 6 ¥ 10 5 4
C ¥ 7 ¥ 11 3
D 5 4 11 ¥ 5
E 5 2 7 ¥ ¥
¸˜±Ò±Ú † √õ∂M ¸˜¸…±øÈ¬Àfl¬ Hungarian ¬ÛX¬øÓ¬ÀÓ¬ ’±Àı˛±¬Û ¸˜¸…± (minumumization) ø˝¸±Àı

¸˜±Ò±Ú fl¬ı˛ÀÓ¬ ø·À˚˛ øÚÀ‰¬ı˛ ˜…±øÈ¬™'&ø˘ ¬Ûı˛ ¬Ûı˛ ¬Û±›˚˛± ˚±˚˛ †
78
NSOU
A B C D E
A ¥ 6 12 0 4
B 2 ¥ 6 1 0
C 5 4 ¥ 8 0
D 1 0 7 ¥ 1
E 3 0 5 6 ¥
(i)
¤‡±ÀÚ minimum ¸—‡…fl¬

˘±˝◊ÀÚı˛ ¸—‡…± = 4 < 5
(ii)
minimum ¸—‡…fl¬ ˘±˝◊ÀÚı˛

¸—‡…± = 5
(iii)
¤Àé¬ÀS ’±Àı˛±¬Û ¸˜¸…± ø˝¸±Àı optimal assignments ˝Àı—
A ® D, B ® A, C ® E, D ® B, E ® C ’Ô«±» (A, D), (B, A), (C, E), (D, B), (E, C)
Cell &ø˘ÀÓ¬ assignment fl¬ı˛± ˝À˚˛ÀÂº ¤‡±ÀÚ minimum cost = 0 + 6 + 3 + 4 + 7 = 20º
øfl¬c√ ¤˝◊ optimal assignments ëw±˜…˜±Ì øıÀ[Ó¬± ¸˜¸…±ı˛ ˙Ó«¬ satisfy fl¬Àı˛ Ú± fl¬±ı˛Ì ¤‡±ÀÚ (A,
D, (D, B), (B, A), (C, E), (E, C) ¤˝◊ ≈øÈ¬ sub-loop ’±ÀÂº
¤‡Ú ’±˜ı˛± enumerative ï·ÌÚ±˜”˘fl¬ó ¬ÛX¬øÓ¬ÀÓ¬ ëw±˜…˜±Ì øıÀ[Ó¬±í ¸˜¸…±øÈ¬ı˛ ¸˜±Ò±Ú øÚÌ«˚˛ fl¬ı˛ıº
79
NSOU
’±˜ı˛± ˘é¬… fl¬ı˛øÂ Œ˚ (iii) Ú— ˜…±øÈ¬™À' minimum nonzero element ˝˘ 1 ˚± (B, D) cell-¤
’±ÀÂº
øfl¬c√ (A, D), (D, B), (B, A) ˘≈À¬Ûı˛ Œé¬ÀS (B, A)-ı˛ ¬Ûøı˛ıÀÓ«¬ (B, D) Òı˛± ˚±Àı Ú± fl¬±ı˛Ì ¤˝◊
˘≈À¬Û (D, B) cell ’±ÀÂº ¤˝◊ ˜…±øÈ¬™À' next non-zero minimum element ˝˘ 2 ˚± (E, A) ›
(D, C) cell-¤ ’±ÀÂº ¤‡±ÀÚ (D, B) cell-¤ı˛ ¬Ûøı˛ıÀÓ«¬ (D, C) øÚÀ˘ ¤ı— (E, C) cell-¤ı˛ ¬Ûøı˛ıÀÓ«¬
(E, A) øÚÀ˘ ’±˜ı˛± Œfl¬±ÀÚ± route ¬Û±˝◊ Ú±º
¬Û≈Úı˛±˚˛ (B, C) cell-¤ 0 Ô±fl¬±˚˛ A ® D ® B ® A ˘≈À¬Ûı˛ Œé¬ÀS (B, A) cell-¤ı˛ ¬Ûøı˛ıÀÓ«¬
(B, C) cell øÚÀ˘ ¤ı— (E, C)-ı˛ ¬Ûøı˛ıÀÓ«¬ (E, A) øÚÀ˘ ’±˜ı˛± ¬Û±˝◊—
A ® D ® B ® C ® E ® A ˚± ¤fl¬øÈ¬ route Œ˚‡±ÀÚ cost=20 + (10 – 6) + (5 – 7) = 22
¤fl¬fl¬º ’±˜ı˛± ˘é¬… fl¬ı˛øÂ ’Ú… route-¤ı˛ Œé¬ÀS cost 22 ¤ı˛ Œ‰¬À˚˛ Œı˙œ ˝Àıº
¸≈Ó¬ı˛±—, w±˜…˜±Ì ¸˜¸…±øÈ¬ı˛ ¸˜±ÒÚ ˝˘ A ® D ® B ® C ® E ® A ¤ı— minumum
cost = 22º
13.8 ¸±ı˛ ± —˙
¤˝◊ ¤fl¬Àfl¬ √õ∂ÔÀ˜ ’±Àı˛±¬Û ¸˜¸…± ı˘ÀÓ¬ øfl¬ Œı±Á¬±˚˛ Ó¬± ı˘± ˝À˚˛ÀÂº ¤ı˛ ¬Ûı˛ ’±Àı˛±¬Û ¸˜¸…± ¸˜±Ò±ÀÚı˛
Hungarian ¬ÛX¬øÓ¬ ı…±‡…± fl¬ı˛± ˝À˚˛ÀÂº ¸ıÀ˙À¯∏ w±˜…˜±Ì øıÀ[Ó¬± ¸˜¸…± ¤ı— ’±Àı˛±¬Û ¸˜¸…±ı˛ ˜ÀÒ… Œ˚
’ÀÚfl¬È¬±˝◊ ø˜˘ ’±ÀÂ Ó¬± ˘é¬… fl¬Àı˛ ëw±˜…˜±Ì øıÀ[Ó¬±í ¸˜¸…± ¸˜±Ò±ÀÚı˛ ·ÌÚ±˜”˘fl¬ (enumerative)
¬ÛX¬øÓ¬øÈ¬ ı…±‡…± fl¬ı˛± ˝À˚˛ÀÂº
13.9 ’Ú≈ ˙ œ˘Úœ
1. ¸ı«øÚ•ß ‡ı˛‰¬ øÚÌ«À˚˛ı˛ Œé¬ÀS øÚÀ‰¬ı˛ ’±Àı˛±¬Û ¸˜¸…±&ø˘ ¸˜±Ò±Ú øÚÌ«˚˛ fl¬èÚº
(i) (ii)
J1 J2 J3 J4 A B C D
1 10 12 19 11 I 1 4 6 3
2 5 10 7 8 II 9 7 10 9
3 12 14 13 11 III 4 5 11 7
4 8 15 11 9 IV 8 7 8 5
80
NSOU
(iii) 1 2 3 4 5 (iv) J1 J2 J3 J4 J5
A 8 4 2 6 1 1 4 2 7 3 1
B 0 9 5 5 4 2 2 9 2 7 1
C 3 8 9 2 6 3 6 8 7 6 1
D 4 3 1 0 3 4 4 6 5 3 1
E 9 5 8 9 5 5 5 3 9 5 1
2. ¸Àı«±B‰¬ ˘±ˆ¬ øÚÌ«À˚˛ı˛ Œé¬ÀS øÚÀ‰¬ı˛ ’±Àı˛±¬Û ¸˜¸…±&ø˘ı˛ ¸˜±Ò±Ú øÚÌ«˚˛ fl¬èÚ †
(i) A B C D E (ii) J1 J2 J3 J4 J5
A 32 38 40 28 40 A 2 4 3 5 4
B 40 24 28 21 36 B 7 4 6 8 4
C 41 27 33 30 37 C 2 9 8 10 4
D 22 38 41 36 36 D 8 8 12 7 4
E 29 33 40 35 39 E 2 8 5 8 8
3. ¸ı«øÚ•ß ‡ı˛‰¬ øÚÌ«À˚˛ı˛ Œé¬ÀS øÚÀ‰¬ı˛ unbalanced ’±Àı˛±¬Û ¸˜¸…±&ø˘ı˛ ¸˜±Ò±Ú øÚÌ«˚˛ fl¬èÚ †
(i) A B C D (ii) W X Y Z
1 10 12 8 6 A 18 24 28 32
2 6 9 12 14 B 8 13 17 19
3 3 8 7 12 C 10 15 19 22
4. ¬Û“±‰¬øÈ¬ fl”¬¬Û ¸—¶®±ı˛ ÊÚ… ¬Û“±‰¬øÈ¬ ¬Û±•Û ˜Ê≈Ó¬ ’±ÀÂº øıøˆ¬iß fl”¬À¬Û ¬Û±•Û ‰¬±˘±À˘ ¤fl¬øÈ¬ ¬Û±À•Ûı˛
¸±˝±À˚… ¸Àı«±B‰¬ fl¬Ó¬È¬± ¸—¶®±ı˛ ˝˚˛ Œ¸˝◊ øÚøı˛À‡ ¬Û±•ÛøÈ¬ı˛ fl¬˜«é¬˜Ó¬± øÚÀ‰¬ √õ∂M ˝˘º øfl¬ˆ¬±Àı øıøˆ¬iß fl”¬À¬Û
¤fl¬øÈ¬ fl¬Àı˛ ¬Û±•Û øÚ˚≈ª fl¬ı˛À˘ ¸Àı«±B‰¬ fl¬±˚«é¬˜Ó¬± ¬Û±›˚˛± ˚±˚˛ Ó¬± øÚÌ«˚˛ fl¬ı˛º
fl”¬¬Û
1 2 3 4 5
1 45 40 65 30 55
2 50 30 25 60 30
¬Û±•Û 25 20 15 20 40
3
4 35 25 30 25 20
5 80 60 60 70 50
81
NSOU
5. 5øÈ¬ Œ˜ø˙ÀÚı˛ ÊÚ… 5 ÊÚ ’¬Û±Àı˛È¬ı˛Àfl¬ øÚÀ˚˛±· fl¬ı˛ÀÓ¬ ˝Àıº √õ∂ÀÓ¬…fl¬ ’¬Û±Àı˛È¬Àı˛ı˛ √õ∂øÓ¬øÈ¬ fl¬±ÀÊı˛
ÊÚ… Œ˚ ¸˜˚˛ ï‚∞I◊±˚˛ó ˘±À· Ó¬± øÚÀ‰¬ı˛ ˜…±øÈ¬™À' Œ›˚˛± ’±ÀÂ ’¬Û±Àı˛È¬ı˛ A, 3Ú— Œ˜ø˙ÀÚ ¤ı— ’¬Û±Àı˛È¬ı˛
C, 4Ú— Œ˜ø˙ÀÚ fl¬±Ê fl¬ı˛ÀÓ¬ ¬Û±Àı˛ Ú±º øfl¬ ˆ¬±Àı Œfl¬±Úƒ fl¬±ÊøÈ¬ Œfl¬±Úƒ ’¬Û±Àı˛È¬ı˛Àfl¬ øÀ˘ ¸ı«øÚ•ß ¸˜À˚˛
fl¬±Ê&ø˘ ¸•Ûiß fl¬ı˛± ˚±Àı∑ Œ˜ø˙Ú
1 2 3 4 5
1 5 5 – 2 6
2 7 4 2 3 4
’¬Û±Àı˛È¬ı˛ 9 3 5 – 3
3
4 7 2 6 7 2
5 6 5 7 9 1
6. øÚÀ‰¬ı˛ √õ∂ÀÓ¬…fl¬øÈ¬ ëw±˜…˜±Ì øıÀ[Ó¬±í ¸˜¸…± ¸˜±Ò±Ú fl¬èÚ †
(i) (ii)
A B C D E A B C D E
A ¥ 5 8 4 5 A ¥ 7 6 8 4
B 5 ¥ 7 4 5 B 7 ¥ 8 5 6
C 8 7 ¥ 8 6 C 6 8 ¥ 9 7
D 4 4 8 ¥ 8 D 8 5 9 ¥ 8
E 5 5 6 8 ¥ E 4 6 7 8 ¥
13.10 Î¬◊ M ı˛ ˜ ±˘±

1. (i) 1 ® J2, 2 ® J3, 3 ® J4, 4 ® J1
¸ı«øÚ•ß ‡ı˛‰¬=38 ¤fl¬fl¬º
(ii) I ® A, II ® C, III ® B, IV ® D
¸ı«øÚ•ß ‡ı˛‰¬ = 21 ¤fl¬fl¬º
(iii) A ® 5, B ® 1, C ® 4, D ® 3, E ® 2
¸ı«øÚ•ß ‡ı˛‰¬ = 9 ¤fl¬fl¬º
(iv) 1 ® J4, 2 ® J3, 3 ® J5, 4 ® J1, 5 ® J2
or, 1 ® J1, 2 ® J3, 3 ® J5, 4 ® J4, 5 ® J2
¸ı«øÚ•ß ‡ı˛‰¬ = 13 ¤fl¬fl¬º
82
NSOU
2. (i) 1 ® B, 2 ® A, 3 ® E, 4 ® C, 5 ® D
Or, 1 ® B, 2 ® E, 3 ® A, 4 ® C, 5 ® D
Or, 1 ® B, 2 ® A, 3 ® E, 4 ® D, 5 ® C
Or, 1 ® B, 2 ® E, 3 ® A, 4 ® D, 5 ® C
¸Àı«±B‰¬ ˘±ˆ¬ = 191 ¤fl¬fl¬º
(ii) 1 ® J5, B ® J1, C ® J4, D ® J3, E ® J2
Or, A ® J2, B ® J1, C ® J4, D ® J3, E ® J5
Or, A ® J4, B ® J1, C ® J2, D ® J3, E ® J5
¸Àı«±B‰¬ ˘±ˆ¬ = 41 ¤fl¬fl¬º
3. (i) 1 ® D, 2 ® B, 3 ® A
¸ı«øÚ•ß ‡ı˛‰¬ = 18 ¤fl¬fl¬º
(ii) A ® W, B ® X, C ® Y or A ® W, B ® Y, C ® X
¸ı«øÚ•ß ‡ı˛‰¬ = 50 ¤fl¬fl¬º
4. 1 ® 3, 2 ® 4, 3 ® 5, 4 ® 2, 5 ® 1
¸Àı«±B‰¬ é¬˜Ó¬± = 270 ¤fl¬fl¬º
5. A ® 4, B ® 3, C ® 5, D ® 2, E ® 1
Or A ® 4, B ® 3, C ® 2, D ® 1, E ® 5
¸ı«øÚ•ß ¸˜˚˛ = 15 ‚∞I◊±¬º
6. (i) A ® D ® C ® E ® B ® A min cost = 28 ¤fl¬fl¬º
(ii) A ® E ® B ® D ® C ® A
Or, (i) A ® C ® D ® B ® E ® A; min cost = 30 ¤fl¬fl¬º
83
NSOU
¤fl¬fl¬ 14
¬¤fl¬fl¬ ❑ [œh¬± Ó¬MW (Game Theory) ’Àù´±¬ÛÀı˙Ú øıj≈
(Saddle Point) › ø˜øÚ˜…±' ÚœøÓ¬
·Í¬Ú
√ 14.1 õ∂ô¶∏ ± ıÚ±
√ 14.2 ≈ ˝ ◊ ı…øªı˛ ˙” Ú … Œ˚±·Ù¬˘ øıø˙©Ü [œh¬± (Two-person zero-sum game)
ñ˜” ˘ …¸” ‰ ¬fl¬ ˜…±øÈ¬™ ' ¤ı— [œh¬± Œfl¬Ã˙˘ (payoff matrix and strat-
egies of a game)
√ 14.3 øıqX¬ › ø˜| Œfl¬Ã˙˘ (Pure and mixed strategies)
√ 14.4 Î¬◊ M ˜ Œfl¬Ã˙˘ (optimal strategies) ¤ı— [œh¬±ı˛ ˜±Ú (value of a
game)
√ 14.5 ø˜øÚ˜…±' ïı± ˜…±ø'ø˜Úó ÚœøÓ¬ › ’Àù´±¬ÛÀı˙Ú øıj≈ (saddle point)
√ 14.6 Î¬◊±˝ı˛Ì
√ 14.7 ¸±ı˛±—˙
√ 14.8 ’Ú≈ ˙ œ˘Úœ
√ 14.9 Î¬◊ M ı˛ ˜ ±˘±
14.1 õ∂ô¶∏ ± ıÚ±
ı±ô¶À∏ ı ’±˜ı˛± ’ÀÚfl¬ ¸˜¸…± ¬Û±˝◊ Œ˚‡±ÀÚ ≈˝◊ ı± Ó¬ÀÓ¬±øÒfl¬ √õ∂øÓ¬¬ÛÀé¬ı˛ (opponents) ˜ÀÒ… √õ∂øÓ¬À˚±ø·Ó¬±
(competition) ¤ı— Ze (conflict) ˘é¬… fl¬ı˛± ˚±˚˛º
Î¬◊±˝ı˛Ì¶§ı¬+˛ Û ≈˝◊ ı…øªı˛ ˜ÀÒ… ı± ≈˝◊ ŒÀ˙ı˛ ˜ÀÒ… ı± ≈˝◊ ı±øÌøÊ…fl¬ √õ∂øÓ¬á¬±ÀÚı˛ ˜ÀÒ… ¤ı˛¬+ Û √õ∂øÓ¬À˚±ø·Ó¬±
˘é¬… fl¬ı˛± ˚±˚˛º ¤˝◊ Òı˛ÀÌı˛ ¸˜¸…±Àfl¬ [œh¬± ¸˜¸…± ı˘± ˝˚˛º ¤ı— [œh¬± Ó¬ÀMWı˛ øı¯∏˚˛ ˝˘ñ√õ∂ÀÓ¬…fl¬ ¬Ûé¬
Ó¬±ı˛ √õ∂M Œfl¬Ã˙˘&ø˘ (strategies) ŒÔÀfl¬ ¤˜Ú Œfl¬Ã˙˘ øÍ¬fl¬ fl¬ı˛Àı Œ˚ Œfl¬Ã˙˘ ’ı˘•§Ú fl¬ı˛À˘ Œ¸˝◊ ¬Ûé¬
ï’Ú…ı˛± Œ˚ Œfl¬Ã˙˘˝◊ ’ı˘•§Ú fl¬èfl¬ó ¸ı«±øÒfl¬ ˘±ˆ¬ÊÚfl¬ ’ıî±˚˛ Ô±fl¬ÀÓ¬ ¬Û±Àı˛º øı¯∏˚ø˛ È¬ ¶Û©Ü fl¬ı˛±ı˛ ÊÚ…
’±˜ı˛± ¤fl¬øÈ¬ ¸˜¸…± Î¬◊À{°‡ fl¬øı˛º
84
NSOU
Òı˛± ˚±fl¬ A ¤ı— B ≈ÊÚ ı…ı¸±±ı˛ Œfl¬±Ú ŒÀ˙ı˛ Œfl¬±Ú øıÀ˙¯∏ ’=¡À˘ electronic goods [˚˛
øı[À˚˛ı˛ ı…ı¸± fl¬ı˛ÀÂ ¤ı— ÒÀı˛ ŒÚ›˚˛± ˚±flƒ¬ Œ˚ ‹ ’=¡À˘ electronic goods [˚˛-øı[À˚˛ı˛ ’Ú… Œfl¬±Ú
ı…ı¸±±ı˛ Ú±˝◊º
¤‡±ÀÚ A ¤ı— B-Œfl¬ Œ‡À˘±˚˛±h¬ (player) ¤ı— ı…ı¸±øÈ¬Àfl¬ ¤fl¬øÈ¬ [œh¬± (game) ı˘± ˝Àıº ˜ÀÚ fl¬èÚ
ı…ı¸± øÚ˚˛LaÌ fl¬ı˛±ı˛ ÊÚ… A ı…ı¸±±Àı˛ı˛ øÓ¬ÚÊÚ executive A1, A2, A3 ¤ı— B ı…ı¸±±Àı˛ı˛ ‰¬±ı˛ÊÚ
executive B1, B2, B3, B4 ’±ÀÂº ’±˜ı˛± ÒÀı˛ ŒÚı Œ˚ √õ∂ÀÓ¬…fl¬ Œ‡À˘±˚˛±h¬ ï¤‡±ÀÚ ı…ı¸±±ı˛ó ı…ı¸±
øÚ˚˛LaÀÌı˛ ÊÚ… Ó¬±ı˛ øÚÀÊı˛ executive Œı˛ ŒÔÀfl¬ ¤fl¬ ¸À/ (at a time) ˜±S ¤fl¬ÊÀÚı˛ ¸±˝±˚… ·Ë˝Ì
fl¬ı˛Àıº Œ˚˜Ú, A Œfl¬ı˘˜±S A3 ¤ı˛ ¸±˝±˚… øÚÀÓ¬ ¬Û±Àı˛ ¤ı— B Œfl¬ı˘˜±S B1 ¤ı˛ ¸±˝±˚… øÚÀÓ¬ ¬Û±Àı˛º
¤˝◊ executive øÚı«±‰¬Ú ïŒfl¬Ã˙˘ øÍ¬fl¬ fl¬ı˛±ó √õ∂ÀÓ¬…fl¬ ı…ı¸±±Àı˛ı˛ ïŒ‡À˘±˚˛±Àh¬ı˛ó ¸•Û”Ì« øÚÀÊı˛ ı…±¬Û±ı˛
¤ı— ’¬Ûı˛ √õ∂øÓ¬¬Ûé¬ ı…ı¸±±Àı˛ı˛ ïŒ‡À˘±˚˛±Àh¬ı˛ó executive øÚı«±‰¬Ú Î¬◊À¬Ûé¬± (ignoring) fl¬ı˛Àı˝◊ ¤˝◊
øÚı«±‰¬Ú fl¬ı˛± ˝˚˛º ˜ÀÚ fl¬èÚ, ≈ÊÚ Œ‡À˘±˚˛±Àh¬ı˛ ï¤‡±ÀÚ ı…ı¸±±Àı˛ıó˛ Œfl¬Ã˙˘ (strategy-¤‡±ÀÚ execu-
tive) øÚı«±‰¬Ú ’Ú≈˚±˚˛œ øÚÀ‰¬ı˛ Âflƒ¬øÈ¬ ï˚±ı˛ ı…±‡…± ¬ÛÀı˛ Œ›˚˛± ˝À˚˛ÀÂó Œ›˚˛± ’±ÀÂ †
Œ‡À˘±˚˛±h¬ B
B1 B2 B3 B4
A1 5 2 –4 2
Œ‡À˘±˚˛±h¬ A
A2 0 – 3 3 7
A3 3 3 2 – 8
¤‡Ú ¤˝◊ Âflƒ¬øÈ¬ı˛ ı…±‡…± øÚÀ‰¬ Œ›˚˛± ˝˘º ¤‡±ÀÚ Œ˜±È¬ 12øÈ¬ ŒÂ±È¬ ı·«±fl¬±ı˛ ‚ı˛ (Cell) ’±ÀÂº ¤˝◊
Âflƒ¬ ¤ı˛ (1, 1) cell ¤ı˛ entry ˝˘ 5ñ¤ı˛ ’Ô« ˝˘ Œ˚ ˚ø Œ‡À˘±˚˛±h¬ A, A1 Œfl¬Ã˙˘ (strategy) ·Ë˝Ì
fl¬Àı˛ ¤ı— B, B1 Œfl¬Ã˙˘ ·Ë˝Ì fl¬Àı˛ Ó¬±˝À˘ ¤˝◊ Œ‡˘±˚˛ ï¤‡±ÀÚ ı…ı¸±˚˛ó A-¤ı˛ 5 ¤fl¬fl¬ ˘±ˆ¬ ˝Àı ¤ı—
Ù¬À˘ B-¤ı˛ 5 ¤fl¬fl¬ Œ˘±fl¬¸±Ú ˝Àı ’Ô«±» ’±˜ı˛± ı˘ÀÓ¬ ¬Û±øı˛ Œ˚ A, B ˚Ô±[À˜ A1, B1 Œfl¬Ã˙˘ ’ı˘•§Ú
fl¬ı˛À˘ Œ‡À˘±˚˛±h¬ A, Œ‡À˘±˚˛±h¬ B-ı˛ fl¬±Â ŒÔÀfl¬ 5 ¤fl¬fl¬ ˜”˘… (payment) ¬Û±Àıº ’±ı±ı˛ (1, 3) celløÈ¬
øıÀı‰¬Ú± fl¬ı˛± ˚±fl¬º ¤˝◊ cell øÈ¬ı˛ entry (– 4) ˚±ı˛ ’Ô« ˝˘ Œ˚ ˚ø A, A1 Œfl¬Ã˙˘ ’ı˘•§Ú fl¬Àı˛ ¤ı—
B, B3 Œfl¬Ã˙˘ ’ı˘•§Ú fl¬Àı˛ Ó¬±˝À˘ A-ı˛ – 4 ¤fl¬fl¬ ˘±ˆ¬ ˝Àı ’Ô«±» A-ı˛ 4 ¤fl¬fl¬ Œ˘±fl¬¸±Ú ˝Àı ¤ı—
B, A-ı˛ fl¬±Â ŒÔÀfl¬ 4 ¤fl¬fl¬ ˜”˘… (payment) ¬Û±Àı ˚± B-ı˛ ˘±ˆ¬º
¤˝◊ Âflƒ¬ ¤ı˛ (2, 1) cell ¤ı˛ entry ˝˘ 0ñ˚±ı˛ ’Ô« ˝˘ Œ˚ ˚ø A, A2 Œfl¬Ã˙˘ ·Ë˝Ì fl¬Àı˛ ¤ı—
B, B2 Œfl¬Ã˙˘ ·Ë˝Ì fl¬Àı˛ Ó¬±˝À˘ A › B Î¬◊ˆ¬˚˛ Œ‡À˘±˚˛±Àh¬ı˛ Œfl¬±Ú ˘±ˆ¬ ı± Œ˘±fl¬¸±Ú øfl¬Â≈˝◊ ˝Àı
Ú±º ’Ú≈ı˛+¬Ûˆ¬±Àı Âflƒ¬øÈ¬ı˛ ı±fl¬œ Œ˚ Œfl¬±Ú cell ¤ı˛ entry-ı˛ ’Ô« ¬Û±›˚˛± ˚±˚˛º ¤‡±ÀÚ Œ‡À˘±˚˛±h¬ A
ï˚±ı˛ Œfl¬Ã˙˘&ø˘ ¸±øı˛ÀÓ¬ Œ‡±ÀÚ± ˝À˚˛ÀÂó Œfl¬ maximizing Œ‡À˘±˚˛±h¬ ı˘± ˝Àı ¤ı— Œ‡À˘±˚˛±h¬ B
ï˚±ı˛ Œfl¬Ã˙˘&ø˘ ô¶∏Ày¬ Œ‡±ÀÚ± ˝À˚˛ÀÂó Œfl¬ minimizing Œ‡À˘±˚˛±h¬ ı˘± ˝Àıº ¤‡±ÀÚ Î¬◊¬ÛÀı˛ı˛ Âflƒ¬øÈ¬Àfl¬
85
NSOU
maximizing Œ‡À˘±˚˛±h¬ A-ı˛ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™' (pay-off matrix) ıÀ˘º ¤˝◊ Âflƒ¬øÈ¬ı˛ √õ∂ÀÓ¬…fl¬ entry-
ı˛ ø‰¬˝ê ¬Ûøı˛ıÓ«¬Ú fl¬Àı˛ (0 entry-ı˛ Œé¬ÀS Œfl¬±Ú ¬Ûøı˛ıÓ«¬Ú ˝Àı Ú±ó Œ˚ Âflƒ¬ ¬Û±›˚˛± ˚±˚˛ Ó¬± ˝Àı mini-
mizing player B-ı˛ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™'º
[œh¬± Ó¬ÀMWı˛ ¸±˝±À˚… A › B Î¬◊ˆ¬˚˛ Œ‡À˘±˚˛±Àh¬ı˛ Œ|á¬ Œfl¬Ã˙˘ (optimum strategy) øÚÌ«˚˛ fl¬ı˛± ˚±˚˛
˚±ÀÓ¬ maximizing Œ‡À˘±˚˛±h¬ A-ı˛ øÚø}¬Ó¬ (guaranteed) ˘±Àˆ¬ı˛ ¬Ûøı˛˜±Ì ¸ıÀ‰¬À˚˛ Œı˙œ ï˜ÀÚ fl¬èÚ
Jó ˝˚˛ ¤ı— minimizing Œ‡À˘±˚˛±h¬ B-ı˛ Œ˘±fl¬¸±ÀÚı˛ ¬Ûøı˛˜±Ì ¸ıÀ‰¬À˚˛ fl¬˜ J ı˛±‡± ˚±Àıº 1928
‡Ëœà¬±Às J. V. Neuman ¤˝◊ Ó¬ÀMWı˛ ¸”‰¬Ú± fl¬Àı˛Ú ¤ı— ¬ÛÀı˛ G. B. Dantzig Z±ı˛± ¤˝◊ Ó¬MW ¸˜‘X¬ ˝˚˛º
¬Ûı˛ıÓ¬œ« ’Ú≈ÀBÂ&ø˘ÀÓ¬ñëë˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™'íí, ëë[œh¬± Œfl¬Ã˙˘íí, ëëÎ¬◊M˜ [œª± Œfl¬Ã˙˘ (optimal
strategies)”, “[œh¬± ¸˜¸…±ı˛ ˜±Ú (value of a game)” ˝◊Ó¬…±ø Ò±ı˛Ì±&ø˘Àfl¬ ¬Ûøı˛©®±ı˛ fl¬Àı˛ ı≈øÁ¬À˚˛ ı˘±
˝Àıº
14.2 ≈ ˝ ◊ ı…øªı˛ ˙” Ú … Œ˚±·Ù¬˘ øıø˙©Ü [œh¬± ¸˜¸…± (Two-

person zero sum game)ñ˜” ˘ … ¸” ‰ ¬fl¬ ˜…±øÈ¬™ ' ¤ı—
[œh¬± Œfl¬Ã˙˘ (Pay off matrix and strategies of
a game)
¬Û”ıı« Ó¬œ« ’Ú≈ÀBÂÀ ≈ÊÚ ı…ı¸±±Àı˛ı˛ Œ˚ ¸˜¸…± Î¬◊À{°‡ fl¬ı˛± ˝À˚˛ÀÂ Œ¸Àé¬ÀS ı…ı¸±øÈ¬Àfl¬ ¤fl¬øÈ¬ ëë[œh¬±íí
(game) ı˘± ˝À˚˛ÀÂº ≈˝◊ ı± Ó¬ÀÓ¬±øÒfl¬ √õ∂øÓ¬¬ÛÀé¬ı˛ ˜ÀÒ… √õ∂øÓ¬À˚±ø·Ó¬± ¤ı— Ze (conflict) ’±ÀÂ ¤˜Ú
Œ˚ Œfl¬±Ú situation-Œfl¬ ’±˜ı˛± ëë[œh¬±íí (game) ı˘ıº ¤‡±ÀÚ √õ∂ÀÓ¬…fl¬ √õ∂øÓ¬¬Ûé¬Àfl¬ ëëŒ‡À˘±˚˛±h¬íí
(player) ı˘± ˝˚˛º
Œ˚ [œh¬±ı˛ ≈ÊÚ Œ‡À˘±˚˛±h¬ Ô±Àfl¬ ¤ı— ¤fl¬ÊÚ Œ‡À˘±˚˛±Àh¬ı˛ ˘±ˆ¬ (gain) ’¬Ûı˛ Œ‡À˘±˚˛±Àh¬ı˛ Œ˘±fl¬¸±ÀÚı˛
(loss) ¸˜±Ú Œ¸˝◊ [œh¬±Àfl¬ ëë≈ ˝ ◊ ı…øªı˛ ˙” Ú … Œ˚±·Ù¬˘ øıø˙©Ü [œh¬±íí ıÀ˘º
¤‡±ÀÚ √õ∂ÀÓ¬…fl¬ Œ‡À˘±˚˛±Àh¬ı˛ ¬Û”ı«øÚÒ«±øı˛Ó¬ fl¬À˚˛fl¬øÈ¬ ¬Ûøı˛fl¬äÚ± (course of action) Ô±Àfl¬ Œ˚‡±ÀÚ
√õ∂ÀÓ¬…fl¬ Œ‡À˘±˚˛±h¬ Ó¬±ı˛ ¬Û”ı«øÚÒ«±øı˛Ó¬ ¬Ûøı˛fl¬äÚ±&ø˘ ŒÔÀfl¬ ¤fl¬ ¸À/ (at a time) Œfl¬ı˘˜±S
¤fl¬øÈ¬ ¬Ûøı˛fl¬äÚ± ·Ë˝Ì fl¬ı˛Àıº √õ∂ÀÓ¬…fl¬ Œ‡À˘±˚˛±Àh¬ı˛ ¤˝◊ ¬Û”ı«øÚÒ«±øı˛Ó¬ ¬Ûøı˛fl¬äÚ±&ø˘Àfl¬ Œ¸˝◊
Œ‡À˘±˚˛±Àh¬ı˛ ëë[œh¬± Œfl¬Ã˙˘íí (strategy) ıÀ˘º ¬Û”ıı« Ó¬œ« ’Ú≈ÀBÂÀ Î¬◊ø{°ø‡Ó¬ ≈ÊÚ ı…ı¸±±Àı˛ı˛ ¸˜¸…±ı˛
Œé¬ÀS A ¤ı— B ı…ı¸±±ı˛Àı˛ ïŒ‡À˘±˚˛±h¬Àı˛ó [œh¬± Œfl¬Ã˙˘&ø˘ ˝˘ ˚Ô±[À˜ A1, A2, A3 ¤ı— B1,
B2, B3, B4º
˚ø Œfl¬±Ú [œh¬±˚˛ √õ∂ÀÓ¬…fl¬ Œ‡À˘±˚˛±Àh¬ı˛ [œh¬± Œfl¬Ã˙À˘ı˛ ¸—‡…± ¸¸œ˜ (finite) ˝˚˛ Ó¬±˝À˘ [œh¬±øÈ¬Àfl¬
¸¸œ˜ (finite) ı˘± ˝Àı ÚÓ≈¬ı± ˝◊˝±Àfl¬ ’¸œ˜ [œh¬± (infinite game) ı˘± ˝Àıº
’±˜ı˛± [œh¬± ı˘ÀÓ¬ ëë≈˝◊ ı…øªı˛ ˙”Ú… Œ˚±·Ù¬˘ øıø˙©Ü ¸¸˜œ [œh¬±íí ı≈Á¬ıº
86
NSOU
˜”˘… ¸”‰¬fl¬ ˜…±øÈ¬™' (Pay off matrix) :
Òı˛± ˚±fl¬ Œfl¬±Ú [œh¬±˚˛ A ¤ı— B ≈ÊÚ Œ‡À˘±˚˛±h¬º ˜ÀÚ fl¬èÚ A-ı˛ √õ∂M [œh¬± Œfl¬Ã˙˘&ø˘ ˝˘ A1,
A2,.........Am ¤ı— B-ı˛ √õ∂M [œh¬± Œfl¬Ã˙˘&ø˘ ˝˘ B1, B2.........Bnº Ó¬±˝À˘ ¤‡±ÀÚ A-ı˛ m ¸—‡…fl¬
Œfl¬Ã˙˘ ¤ı— B-ı˛ n ¸—‡…fl¬ Œfl¬Ã˙˘ √õ∂M ’±ÀÂº ˜ÀÚ fl¬èÚ ˚ø A, Ai Œfl¬Ã˙˘ (i = 1, 2,.........m)
¤ı— B, Bi Œfl¬Ã˙˘ (j = 1, 2,.........n) øÚı«±‰¬Ú fl¬Àı˛ Ó¬±˝À˘ A-Œfl¬ Œ˚˛ B-ı˛ ’Ô«˜”À˘…ı˛ ˜±Ú aji ’Ô«±»
A, Ai Œfl¬Ã˙˘ ¤ı— B, Bj Œfl¬Ã˙˘ øÚı«±‰¬Ú fl¬ı˛À˘ A-ı˛ ˘±Àˆ¬ı˛ ¬Ûøı˛˜±Ì aij ¤ı— B-ı˛ Œ˘±fl¬¸±ÀÚı˛ ¬Ûøı˛˜±Ì
aij ¤ı— B-ı˛ Œ˘±fl¬¸±ÀÚı˛ ¬Ûøı˛˜±Ì aijº
¤Àé¬ÀS ’±˜ı˛± m × n [À˜ı˛ ˜…±øÈ¬™'øÈ¬ ¬Û±˝◊º
LM a11 a12 .....
a1n OP
MM a21 a22 .....
a2n PP
MM PP
.........................
.........................
a a .....
a
N m1 m2 mn
Q
¤˝◊ ˜…±øÈ¬™'øÈ¬Àfl¬ √õ∂M [œh¬±ı˛ ¤fl¬øÈ¬ ˜”˘… ¸”‰¬fl¬ ˜…±øÈ¬™' (payoff matrix) ıÀ˘ ¤ı— [œh¬±øÈ¬Àfl¬ øÚÀ‰¬ı˛
’±fl¬±Àı˛ √õ∂fl¬±˙ fl¬ı˛± ˝˚˛ †
Œ‡À˘±˚˛±h¬ B
B1 B2 . . . . . . . Bn
A1 a11 a12 . . . . . . . a1n
A2 a21 a22 . . . . . . . a2n
Œ‡À˘±˚˛±h¬ A ..
. ...... ...... ........... ......
. ...... ...... ........... ......
.
Am am1 am2 amn
¤‡±ÀÚ Œ‡À˘±˚˛±h¬ A-Œfl¬ ı˘± ˝Àı maximizing player ˚±ı˛ ˘é¬… ˝Àı ¤˜Ú ˆ¬±Àı Œfl¬Ã˙˘ øÚı«±‰¬Ú
fl¬ı˛± ˚±ÀÓ¬ ïŒ‡À˘±˚˛±h¬ B Œ˚ Œfl¬Ã˙˘˝◊ øÚı«±‰¬Ú fl¬èfl¬ Ú± Œfl¬Úó Ó¬±ı˛ øÚø}¬Ó¬ (guaranteed) ˘±Àˆ¬ı˛ ¬Ûøı˛˜±Ì
¸ıÀ‰¬À˚˛ Œı˙œ ˝˚˛ ¤ı— Œ‡À˘±˚˛±h¬ B-Œfl¬ ı˘± ˝Àı minimizing player ˚±ı˛ ˘é¬… ˝Àı ¤˜Úˆ¬±Àı Œfl¬Ã˙˘
øÚı«±‰¬Ú fl¬ı˛± ïŒ‡À˘±˚˛±h¬ A Œ˚ Œfl¬Ã˙˘˝◊ øÚı«±‰¬Ú fl¬èfl¬ Ú± Œfl¬Úó ˚±ÀÓ¬ Ó¬±ı˛ Œ˘±fl¬¸±ÀÚı˛ (loss) ¤ı˛
¬Ûøı˛˜±Ì ¸ıÀ‰¬À˚˛ fl¬˜ ı˛±‡± ˚±˚˛º
¤‡±ÀÚ [ aij ]m×n ˜…±øÈ¬™'øÈ¬Àfl¬ Œ‡À˘±˚˛±h¬ A-ı˛ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™' ıÀ˘ Î¬◊À{°‡ fl¬ı˛± ˝˚˛ ¤ı— [œh¬±øÈ¬Àfl¬
¤fl¬øÈ¬ m×n [œh¬± ı˘± ˝Àıº Œ‡À˘±˚˛±h¬ B-ı˛ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™'øÈ¬ ˝Àı [ –aij ]m×nº
˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™' ¤ı˛ ¤fl¬øÈ¬ Î¬◊±˝ı˛Ì Œ›˚˛± ˝fl¬ †
˜ÀÚ fl¬èÚ Œ‡À˘±˚˛±h¬ A-ı˛ Œfl¬Ã˙˘&ø˘ ˝˘ A1, A2, A3 ¤ı— B-ı˛ Œfl¬Ã˙˘&ø˘ ˝˘ B1, B2º Œfl¬Ã˙˘
øÚı«±‰¬Ú ’Ú≈¸±Àı˛ Œ˚˛ ’Ô«˜”À˘…ı˛ ¬Ûøı˛˜±Ì øÚÀ‰¬ Œ›˚˛± ˝˘ †
87
NSOU
øÚı«±ø‰¬Ó¬ Œfl¬Ã˙˘ Œ˚˛ ’Ô«˜”˘…
A : A1 ; B : B1 A-ı˛ fl¬±Â ŒÔÀfl¬ B 3 È¬±fl¬± ¬Û±˚˛º
A : A1 ; B : B2 B-ı˛ fl¬±Â ŒÔÀfl¬ A 2 È¬±fl¬± ¬Û±˚˛º
Î¬◊¬ÛÀı˛ı˛ Ó¬±ø˘fl¬± ŒÔÀfl¬ Œ‡± ˚±ÀBÂ Œ˚ Œ‡À˘±˚˛±h¬ A-ı˛ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™'øÈ¬ ˝˘

B1 B2
A1 LM–3 –2 OP
MN PQ
A2 –4 –5
A3 1 8
¤ı— Œ‡À˘±˚˛±h¬ B-ı˛ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™' ˝˘
B1 B2
A1 LM 3 –2 OP
MN PQ
A2 4 –5
A3 –1 8
14.3 øıqX¬ › ø˜| Œfl¬Ã˙˘ (Pure and Mixed strategies)

’±˜ı˛± ’±À·˝◊ ıÀ˘øÂ Œ˚ Œfl¬±Ú √õ∂M [œh¬±ı˛ Œé¬ÀS, [œh¬±øÈ¬ı˛ √õ∂ÀÓ¬…fl¬ ¸•Û±ÀÚ (at each play)
¬√õ∂ÀÓ¬…fl¬ Œ‡À˘±˚˛±h¬ Ó¬±ı˛ √õ∂M Œfl¬Ã˙˘&ø˘ ŒÔÀfl¬ Œfl¬ı˘˜±S ¤fl¬øÈ¬ Œfl¬Ã˙˘ øÚı«±‰¬Ú fl¬Àı˛º
˚ø [œh¬±øÈ¬ı˛ √õ∂ÀÓ¬…fl¬ ¸•Û±ÀÚ Œfl¬±Ú Œ‡À˘±˚˛±h¬ ¤fl¬øÈ¬ øÚø«©Ü [œh¬± Œfl¬Ã˙˘ øÚı«±‰¬Ú fl¬Àı˛, Ó¬±˝À˘ ı˘±
˝Àı Œ˚ ‹ Œ‡À˘±˚˛±h¬ øıqX¬ Œfl¬Ã˙˘ (pure strategy) ’ı˘•§Ú fl¬Àı˛ÀÂ ¤ı— øÚø«©Ü Œfl¬Ã˙˘øÈ¬Àfl¬ ¤fl¬øÈ¬
øıqX¬ Œfl¬Ã˙˘ ı˘± ˝Àıº
˚ø Œfl¬±Ú Œ‡À˘±˚˛±h¬ [œh¬±øÈ¬ı˛ √õ∂ÀÓ¬…fl¬ ¸•Û±ÀÚ ¤fl¬øÈ¬ øÚø«©Ü Œfl¬Ã˙˘ ·Ë˝Ì Ú± fl¬Àı˛ Ó¬±ı˛ √õ∂M
Œfl¬Ã˙˘&ø˘ øÚø«©Ü ¸y¬±ıÚ± ï√õ∂øÓ¬ Œfl¬Ã˙˘ øÚı«±‰¬ÀÚı˛ ¤fl¬˝◊ ¸y¬±ıÚ± Ú±› ˝ÀÓ¬ ¬Û±Àı˛ó øÚÀ˚˛ øÚı«±‰¬Ú fl¬Àı˛,
Ó¬±˝À˘ ı˘± ˝Àı Œ˚ ‹ Œ‡À˘±˚˛±h¬ ø˜| Œfl¬Ã˙˘ (pure strategy) ’ı˘•§Ú fl¬Àı˛ÀÂ ¤ı— øÚø«©Ü Œfl¬Ã˙˘øÈ¬Àfl¬
¤fl¬øÈ¬ øıqX¬ Œfl¬Ã˙˘ ı˘± ˝Àıº
˚ø Œfl¬±Ú Œ‡À˘±˚˛±h¬ [œh¬±øÈ¬ı˛ √õ∂ÀÓ¬…fl¬ ¸•Û±ÀÚ ¤fl¬øÈ¬ øÚø«©Ü Œfl¬Ã˙˘ ·Ë˝Ì Ú± fl¬Àı˛ Ó¬±ı˛ √õ∂M
Œfl¬Ã˙˘&ø˘ øÚø«©Ü ¸y¬±ıÚ± ï√õ∂øÓ¬ Œfl¬Ã˙˘ øÚı«±‰¬ÀÚı˛ ¤fl¬˝◊ ¸y¬±ıÚ± Ú±› ˝ÀÓ¬ ¬Û±Àı˛ó øÚÀ˚˛ øÚı«±‰¬Ú fl¬Àı˛,
Ó¬±˝À˘ ı˘± ˝Àı Œ˚ ‹ Œ‡À˘±˚˛±h¬ ø˜| Œfl¬Ã˙˘ (mixed strategy) ’ı˘•§Ú fl¬Àı˛ÀÂº ø˜| Œfl¬Ã˙À˘ı˛
Ò±ı˛Ì±øÈ¬ ’±ı˛› ¶Û©Ü fl¬Àı˛ ı˘± ˚±fl¬º
˜ÀÚ fl¬èÚ Œfl¬±Ú [œh¬±ı˛ Œé¬ÀS maximizing Œ‡À˘±˚˛±h¬ A-ı˛ √õ∂M Œfl¬Ã˙˘&ø˘ ˝˘ A1, A2, A3º ˚ø
Œ‡À˘±˚˛±h¬ A ø˜| Œfl¬Ã˙˘ ’ı˘•§Ú fl¬Àı˛ Ó¬±˝À˘ [œh¬±øÈ¬ı˛ √õ∂ÀÓ¬…fl¬ ¸•Û±ÀÚ A1, A2, A3 Œfl¬Ã˙˘&ø˘
88
NSOU
ŒÔÀfl¬ Î¬◊ÀV˙…˝œÚ ˆ¬±Àı (at random) Œfl¬ı˘˜±S ¤fl¬øÈ¬ Œfl¬Ã˙˘ øÚı«±‰¬Ú fl¬Àı˛º ˚ø A1, A2, A3 Œfl¬Ã˙˘&ø˘
øÚı«±‰¬Ú fl¬ı˛±ı˛ ¸y¬±ıÚ± ˚Ô±[À˜ P1, P2, P3 ˝˚˛ Ó¬±˝À˘ P1 ³ 0, P2 ³ 0, P3 ³ 0, ¤ı— P1+P2+P3=1º
1 1 1
˚ø P1 = 2 , P2 = 3 , P3 = 6 ˝˚˛ Ó¬±˝À˘ ’±˜ı˛± ı≈Á¬ı Œ˚ [œh¬±øÈ¬ ’ÀÚfl¬ı±ı˛ (large number of
times)º
1
Òı˛± ˚±fl¬ 6000 ı±ı˛ ¸•Û±Ú fl¬ı˛À˘ A1, A2, A3 Œfl¬Ã˙˘ øÓ¬ÚøÈ¬ ˚Ô±[À˜ √õ∂±˚˛ 6000 ´ 2 = 3000 ,
1 1
6000 ´ = 2000 , 6000 ´ = 1000 , ı±ı˛ øÚı«±‰¬Ú fl¬ı˛± ˝À˚˛ÀÂº
3 6
FH 1 1 1 IK
¤Àé¬ÀS Œ‡À˘±˚˛±h¬ A-ı˛ Œ˚ ø˜| Œfl¬Ã˙˘ ’Ú≈¸ı˛Ì fl¬Àı˛ Ó¬±Àfl¬ 2 , 3 , 6 ø˘À‡ √õ∂fl¬±˙ fl¬ı˛± ˝˚˛º
˚ø øıÀ˙¯∏ Œé¬ÀS p1=1, p2=0, p3=0 ˝˚˛ Œ¸ Œé¬ÀS [œh¬±øÈ¬ı˛ ’ÀÚfl¬ı±ı˛ ¸•Û±ÀÚ (large number
of times), Œ‡À˘±˚˛±h¬ A √õ∂±˚˛ √õ∂ÀÓ¬…fl¬ı±ı˛ A1 øÚı«±‰¬Ú fl¬Àı˛ ¤ı— A2, A3 √õ∂±˚˛ Œfl¬±Ú ı±ı˛˝◊ øÚı«±‰¬Ú fl¬Àı˛
Ú±—¸≈Ó¬ı˛±—, ¤‡±ÀÚ ı˘± ˚±˚˛ Œ˚ Œ‡À˘±˚˛±h¬ A øıqX¬ Œfl¬Ã˙˘ A1 ’Ú≈¸ı˛Ì fl¬Àı˛º ’Ú≈ı˛+¬Ûˆ¬±Àı p1=0,
p2=1, p3=0 ; p1=0, p2=0, p3=1 ˝À˘ ı˘± ˚±˚˛ Œ‡À˘±˚˛±h¬ A ˚Ô±[À˜ øıqX¬ Œfl¬Ã˙˘ A2 ¤ı— øıqX¬
Œfl¬Ã˙˘ A3 ’Ú≈¸ı˛Ì fl¬Àı˛º
Ó¬±˝À˘ øıqX¬ Œfl¬Ã˙˘Àfl¬ øıÀ˙¯∏ ø˜| Œfl¬Ã˙˘ ı˘± Œ˚ÀÓ¬ ¬Û±Àı˛º
˜ôL√ı… † ’ÀÚfl¬ ¸˜˚˛ Œ‡À˘±˚˛±h¬ A ¤ı— Œ‡À˘±˚˛±h¬ B-ı˛ √õ∂M Œfl¬Ã˙˘&ø˘Àfl¬ øıqX¬ Œfl¬Ã˙˘ ıÀ˘ Î¬◊À{°‡
fl¬ı˛± ˝˚˛º
14.4 Î¬◊ M ˜ Œfl¬Ã˙˘ (Optimal strategies) ¤ı— [œh¬±ı˛ ˜±Ú

Value of a game)
¤˝◊ ’Ú≈ÀBÂÀ ’±˜ı˛± ÒÀı˛ ŒÚı Œ˚ √õ∂ÀÓ¬…fl¬ Œ‡À˘±˚˛±h¬ øıqX¬ Œfl¬Ã˙˘ ’Ú≈¸ı˛Ì fl¬Àı˛º
Òı˛± ˚±fl¬ Œfl¬±Ú [œh¬±ı˛ Œé¬ÀS A ˝˘ maximizing Œ‡À˘±˚˛±h¬ ¤ı— B ˝˘ minimizing Œ‡À˘±˚˛±h¬º
Œ˚ Œfl¬Ã˙˘ ’ı˘•§Ú fl¬ı˛À˘ Œ‡À˘±˚˛±h¬ A-ı˛ øÚø}¬Ó¬ (guaranteed) ˘±Àˆ¬ı˛ ¬Ûøı˛˜±Ì ¸ıÀ‰¬À˚˛ Œı˙œ,
Òı˛± ˚±fl¬ J ïŒ‡À˘±˚˛±h¬ B Œ˚ Œfl¬±Ú Œfl¬Ã˙˘ ’ı˘•§Ú fl¬èfl¬ Ú± Œfl¬Ú, Œ‡À˘±˚˛±h¬ A-ı˛ ˘±Àˆ¬ı˛ ¬Ûøı˛˜±Ì
fl¬‡Ú˝◊ J ’À¬Ûé¬± fl¬˜ ˝Àı Ú±ó, Œ¸˝◊ Œfl¬Ã˙˘Àfl¬ Œ‡À˘±˚˛±h¬ A-ı˛ Œ|á¬ Œfl¬Ã˙˘ (best strategy) ı˘±
˝Àıº Œ˚ Œfl¬Ã˙˘ ’ı˘•§Ú fl¬ı˛À˘ Œ‡À˘±˚˛±h¬ B-ı˛ Œ˘±fl¬¸±ÀÚı˛ ¬Ûøı˛˜±Ì ¸ıÀ‰¬À˚˛ fl¬˜ ı˛±‡± ˚±˚˛, Òı˛±˚±fl¬
J ïŒ‡À˘±˚˛±h¬ A-ı˛ Œfl¬±Ú Œfl¬Ã˙˘ ’ı˘•§ÀÚı˛ Z±ı˛± ¤˝◊ Œ˘±fl¬¸±ÀÚı˛ ¬Ûøı˛˜±Ì fl¬‡Ú˝◊ J ¤ı˛ Œ‰¬À˚˛ Œı˙œ
˝Àı Ú±ó, Œ¸˝◊ Œfl¬Ã˙˘Àfl¬ Œ‡À˘±˚˛±h¬ B-ı˛ Œ|á¬ Œfl¬Ã˙˘ (best strategy) ı˘± ˝Àı ¤‡±ÀÚ ˜ÀÚ ı˛±‡±
ı˛fl¬±ı˛ Œ˚ Œ‡À˘±˚˛±h¬ B ’Ú… Œfl¬±Ú Œfl¬Ã˙˘ ’ı˘•§Ú fl¬ı˛À˘, Œ‡À˘±˚˛±h¬ A Œfl¬±Ú Œfl¬Ã˙˘
’ı˘•§ÀÚı˛ Z±ı˛± B-¤ı˛ Œ˘±fl¬¸±ÀÚı˛ ¬Ûøı˛˜±Ì ¤ı˛ Œ‰¬À˚˛ Œı˙œ fl¬Àı˛ øÀÓ¬ ¬Û±Àı˛º
˚ø J = J ï= J Òı˛± ˚±fló ˝˚˛, Ó¬±˝À˘ Œfl¬ [œh¬±ı˛ ˜±Ú (value of the game) ı˘± ˝Àı ¤ı—
89
NSOU
¤Àé¬ÀS Œ‡À˘±˚˛±h¬ A › Œ‡À˘±˚˛±h¬ B ¤ı˛ Œ|á¬ Œfl¬Ã˙˘ (best strategy) Œfl¬ ˚Ô±[À˜ A › B
¤ı˛ Î¬◊M˜ Œfl¬Ã˙˘ (optimal strategy) ı˘± ˝˚˛º
Ó¬±˝À˘ ’±˜ı˛± ı˘ÀÓ¬ ¬Û±øı˛ Œ˚ øıqX¬ Œfl¬Ã˙˘ ’Ú≈¸ı˛ÀÌı˛ Œé¬ÀS Œfl¬±Ú [œh¬±ı˛ ˜±Ú ˝À˘, maximizing
Œ‡À˘±˚˛±h¬ A-ı˛ øÚø}¬Ó¬ (guaranteed) ˘±Àˆ¬ı˛ ¬Ûøı˛˜±Ì ¸ıÀ‰¬À˚˛ Œı˙œ ˝Àı ¤ı— minizing Œ‡À˘±˚˛±h¬
B-ı˛ Œ˘±fl¬¸±ÀÚı˛ ¬Ûøı˛˜±Ì fl¬‡Ú˝◊ ¤ı˛ Œ‰¬À˚˛ Œı˙œ ˝Àı Ú± ˚ø Î¬◊ˆ¬˚˛ Œ‡À˘±˚˛±h¬ Î¬◊M˜ Œfl¬Ã˙˘ optimal
strategies) ’ı˘•§Ú fl¬Àı˛º
¤fl¬øÈ¬ Î¬◊±˝ı˛ÀÌı˛ ¸±˝±À˚… Î¬◊M˜ Œfl¬Ã˙˘ ¤ı— [œh¬±ı˛ ˜±ÀÚı˛ ±ı˛Ì± ¶Û©Ü fl¬ı˛± ˚±fl¬ †
’±˜ı˛± øÚÀ‰¬ı˛ ˜”˘…¸”‰¬fl¬ øıÀı‰¬Ú± fl¬ı˛ıº
B
B1 B2 B3
A1 18 5 6
A A2 9 8 19
A3 –4 7 3
Î¬◊¬ÛÀı˛ı˛ Âfl¬ ŒÔÀfl¬ Œ‡± ˚±ÀBÂ Œ˚ (1, 1) cell-¤ entry-ı˛ ¬Ûøı˛˜±Ì (18) ¸ıÀ‰¬À˚˛ Œı˙œ—¤ı˛ ŒÔÀfl¬
˜ÀÚ ˝ÀÓ¬ ¬Û±Àı˛ Œ˚ maximizing Œ‡À˘±˚˛±h¬ A ˚ø A1 Œfl¬Ã˙˘ ’ı˘•§Ú fl¬Àı˛ Ó¬±˝À˘ Ó¬±ı˛ ˘±ˆ¬ (gain)
¸ıÀ‰¬À˚˛ Œı˙œ (18) ˝ÀÓ¬ ¬Û±Àı˛º øfl¬c√ ¤˝◊ ˘±Àˆ¬ı˛ ¬Ûøı˛˜±Ì øÚø}¬Ó¬ Ú˚˛ fl¬±ı˛Ì ¤Àé¬ÀS Œ‡À˘±˚˛±h¬ B, B2
ı± B3 Œfl¬Ã˙˘ ’ı˘•§Ú fl¬ı˛À˘ A-ı˛ ˘±Àˆ¬ı˛ ¬Ûøı˛˜±Ì fl¬À˜ 5 ı± 6 ˝Àıº ’±ı±ı˛ Œ‡± ˚±ÀBÂ Œ˚ (3, 1)
cell ¤ entry-ı˛ ¬Ûøı˛˜±Ì (–4) ¸ıÀ‰¬À˚˛ fl¬˜—¤ı˛ ŒÔÀfl¬ ˜ÀÚ ˝ÀÓ¬ ¬Û±Àı˛ Œ˚ minumizing Œ‡À˘±˚˛±h¬
B ˚ø B1 Œfl¬Ã˙˘ ’ı˘•§Ú fl¬Àı˛ Ó¬±˝À˘ Ó¬±ı˛ Œ˘±fl¬¸±ÀÚı˛ ¬Ûøı˛˜±Ì ¸ıÀ‰¬À˚˛ fl¬˜ (–4) ˝ÀÓ¬ ¬Û±Àı˛º øfl¬c√
¤˝◊ Œ˘±fl¬¸±ÀÚı˛ ¬Ûøı˛˜±Ì øÚø}¬Ó¬ Ú˚˛ fl¬±ı˛Ì Œ‡À˘±˚˛±h¬ A, Œfl¬Ã˙˘ A1 ı± Œfl¬Ã˙˘ A2 ’ı˘•§Ú fl¬Àı˛ B-
ı˛ Œ˘±fl¬¸±ÀÚı˛ ¬Ûøı˛˜±Ì ı±øh¬À˚˛ 18 ı± 9 fl¬ı˛ÀÓ¬ ¬Û±Àı˛º
’±˜ı˛± ˘é¬… fl¬ı˛øÂ Œ˚ ˚ø Œ‡À˘±˚˛±h¬ A, Œfl¬Ã˙˘ A2 ’ı˘•§Ú fl¬Àı˛ Ó¬±˝À˘ B Œ˚ Œfl¬±Ú Œfl¬Ã˙˘˝◊
’ı˘•§Ú fl¬èfl¬ Ú± Œfl¬Ú A-ı˛ ˘±ˆ¬ fl¬˜¬ÛÀé¬ 8 ¤fl¬fl¬ ˝Àı˝◊ ’Ô«±» A-ı˛ ¤˝◊ ¬Ûøı˛˜±Ì ˘±ˆ¬ ï8 ¤fl¬fl¬ó
øÚø}¬Ó¬º ’±ı˛› Œ‡± ˚±ÀBÂ Œ˚ A ˚ø ’Ú… Œfl¬Ã˙˘ A1 ı± A3 ’ı˘•§Ú fl¬Àı˛ Ó¬±˝À˘ ¤˝◊ øÚø}¬Ó¬ ˘±Àˆ¬ı˛
¬Ûøı˛˜±Ì fl¬À˜ 5 ı± –4 ˝Àıº ¸≈Ó¬ı˛±— Œ‡À˘±˚˛±h¬ A ˚ø A2 Œfl¬Ã˙˘ ’ı˘•§Ú fl¬Àı˛ Ó¬±˝À˘ Ó¬±ı˛ øÚø}¬Ó¬
(guaranteed) ˘±Àˆ¬ı˛ ¬Ûøı˛˜±Ì ¸ıÀ‰¬À˚˛ Œı˙œ ï8 ¤fl¬fl¬ó ˝Àıº
’±ı±ı˛ Œ‡± ˚±ÀBÂ Œ˚ ˚ø Œ‡À˘±˚˛±h¬ B, Œfl¬Ã˙˘ B2 ’ı˘•§Ú fl¬Àı˛ Ó¬±˝À˘ Ó¬±ı˛ Œ˘±fl¬¸±ÀÚı˛ ¬Ûøı˛˜±Ì
fl¬‡Ú˝◊ 8 ¤fl¬fl¬ ¤ı˛ Œı˙œ ˝Àı Ú± ¤ı— ¤˝◊ Œ‡À˘±˚˛±h¬ ˚ø ’Ú… Œfl¬Ã˙˘ B1 ı± B3 ’ı˘•§Ú fl¬Àı˛ Ó¬±˝À˘
Ó¬±ı˛ Œ˘±fl¬¸±ÀÚı˛ ¬Ûøı˛˜±Ì 8 ¤fl¬fl¬ ŒÔÀfl¬ ŒıÀh¬ 18 ¤fl¬fl¬ ı± 10 ¤fl¬fl¬ ˝ÀÓ¬ ¬Û±Àı˛º ¸≈Ó¬ı˛±— ˚ø Œ‡À˘±˚˛±h¬
B, Œfl¬Ã˙˘ B2 ’ı˘•§Ú fl¬Àı˛ Ó¬±˝À˘ Œ¸ Ó¬±ı˛ Œ˘±fl¬¸±ÀÚı˛ ¬Ûøı˛˜±Ì 8 ¤fl¬fl¬ ı˛±‡ÀÓ¬ ¬Û±ı˛Àı ¤ı— ’Ú… Œfl¬±Ú
Œfl¬Ã˙˘ ’Ú≈¸ı˛Ì fl¬Àı˛ ¤ı˛ ŒÔÀfl¬ fl¬˜ Œ˘±fl¬¸±Ú øÚø}¬Ó¬ fl¬ı˛± ˚±Àı Ú±º
90
NSOU
¸≈Ó¬ı˛±—, ¤˝◊ [œh¬±ı˛ Œé¬ÀS Œ‡À˘±˚˛±h¬ A › Œ‡À˘±˚˛±h¬ B ¤ı˛ Î¬◊M˜ Œfl¬Ã˙˘&ø˘ ˝˘ ˚Ô±[À˜
A2 › B2 ¤ı— [œh¬±ı˛ ˜±Ú (value of the game) ˝Àı 8 ¤fl¬fl¬º
˜ôL√ı… † Œfl¬±Ú [œh¬± (game) ¸˜±Ò±Ú fl¬ı˛ÀÓ¬ ı˘À˘ ı≈Á¬ÀÓ¬ ˝Àı Œ˚ Œ‡À˘±˚˛±h¬ A › Œ‡À˘±˚˛±h¬ B ¤ı˛
Î¬◊M˜ Œfl¬Ã˙˘ (optimal strategies) ¤ı— [œh¬±ı˛ ˜±Ú ï˚ø ’øô¶Q ∏ ¶§œfl‘¬Ó¬ ˝˚˛ó øÚÌ«˚˛ fl¬ı˛ÀÓ¬ ˝Àıº ¬Ûı˛ıÓ«¬œ
’Ú≈ÀBÂÀ ’±˜ı˛± Œ‡ı øıqX¬ Œfl¬Ã˙˘ (pure strategy) ’ı˘•§Ú fl¬Àı˛ øfl¬ˆ¬±Àı Î¬◊M˜ Œfl¬Ã˙˘ › [œh¬±ı˛
˜±Ú (value of the game) øÚÌ«˚˛ fl¬ı˛± ˚±˚˛ ¤ı— ’±ı˛› Œ‡ı Œ˚ Œfl¬ı˘˜±S øıqX¬ Œfl¬Ã˙˘ ’ı˘•§Ú
fl¬Àı˛ Œ˚ Œfl¬±Ú [œh¬± ¸˜¸…±ı˛ ¸˜±Ò±Ú fl¬ı˛± ¸y¬ı Ú˚˛º
14.5 ø˜øÚ˜…±' ïı± ˜…±ø'ø˜Úó ÚœøÓ¬ ı± ’Àù´±¬ÛÀı˙Ú øıj≈

(Saddle point)
¬Û”ı«ıÓ«¬œ ’Ú≈ÀBÂÀı˛ ’±À˘±‰¬Ú± ŒÔÀfl¬ Œı±Á¬± Œ·˘ Œ˚ øıqX¬ Œfl¬Ã˙À˘ı˛ ¸±˝±À˚… [œh¬± ¸˜¸…±ı˛ ¸˜±Ò±Ú
fl¬ı˛±ı˛ ’Ô« ˝˘√—√õ∂ÀÓ¬…fl¬ Œ‡À˘±˚˛±Àh¬ı˛ ¤˜Ú Œfl¬Ã˙˘ øÚı«±‰¬Ú fl¬ı˛± ˚±ÀÓ¬ √õ∂øÓ¬¬Ûé¬ Œ‡À˘±˚˛±Àh¬ı˛ fl¬±Â ŒÔÀfl¬
Ó¬±ı˛ øÚø}¬Ó¬ ¬Û±›Ú±ı˛ (guranteed pay off) ¬Ûøı˛˜±Ì ¸ıÀ‰¬À˚˛ Œı˙œ ˝˚˛ Œ˚‡±ÀÚ √õ∂øÓ¬¬ÛÀé¬ı˛ Œfl¬±Ú Œfl¬Ã˙˘
øÚı«±‰¬ÀÚı˛ Z±ı˛± ¤˝◊ ¬Û±›Ú±ı˛ ¬Ûøı˛˜±Ì fl¬˜Àı Ú±º Œfl¬Ã˙˘ øÚı«±‰¬ÀÚı˛ ¤˝◊ ÚœøÓ¬øÈ¬Àfl¬ ø˜øÚ˜…±' ïı± ˜…±ø'ø˜Úó
ÚœøÓ¬ ı˘± ˝˚˛º ¤‡Ú ¤˝◊ ÚœøÓ¬øÈ¬ ¬Ûøı˛©®±ı˛ ˆ¬±Àı øÚÀ‰¬ øıı‘Ó¬ fl¬ı˛± ˝˘
˚ø Œfl¬±Ú Œ‡À˘±˚˛±h¬ Ó¬±ı˛ √õ∂M Œfl¬Ã˙˘&ø˘ı˛ Œé¬ÀS √õ∂ÀÓ¬…fl¬ Œfl¬Ã˙À˘ı˛ ÊÚ… Ó¬±ı˛ ’Ú≈fl”¬À˘ ¸ıÀ‰¬À˚˛
‡±ı˛±¬Û Ù¬˘ (worst outcome) øÚÀ˚˛ ¤fl¬øÈ¬ Ó¬±ø˘fl¬± ΔÓ¬ı˛œ fl¬Àı˛ Ó¬±˝À˘ ¤˝◊ Ó¬±ø˘fl¬±ı˛ Ù¬˘&ø˘ı˛ ˜ÀÒ… Œ˚øÈ¬
Ó¬±ı˛¬ÛÀé¬ ¸ıÀ‰¬À˚˛ ˆ¬±˘ (best of the worst outcomes), Œ¸˝◊ Ù¬˘øÈ¬ı˛ ’Ú≈ı˛+¬Û Œfl¬Ã˙˘øÈ¬Àfl¬ ›˝◊
Œ‡À˘±˚˛±h¬ Œ|á¬ Œfl¬Ã˙˘ ø˝À¸Àı øÚı«±‰¬Ú fl¬ı˛Àıº
¤‡Ú ¤˝◊ ÚœøÓ¬øÈ¬ øÚÀ‰¬ı˛ ˜”˘… ¸”‰¬fl¬ ˜…±øÈ¬™À'ı˛ Œé¬ÀS √õ∂À˚˛±· fl¬ı˛± ˚±fl¬ †
B
B1 B2 B3
A1 2 5 2
A A2 –1 2 –8
A3 –2 3 2
¤‡±ÀÚ maximizing Œ‡À˘±˚˛±h¬ A-ı˛ Œé¬ÀS A1, A2, A3 Œfl¬Ã˙˘&ø˘ı˛ ÊÚ… ¸ıÀ‰¬À˚˛ ‡±ı˛±¬Û Ù¬˘&ø˘
(row minima) ˝À˘ ˚Ô±[À˜ 2, –8, –2º
¤‡Ú Max {2, –8, –2}=2º
¸≈Ó¬ı˛±—, ë˜…±ø'ø˜Ú ÚœøÓ¬ ’Ú≈˚±˚˛œ A-ı˛ A1 Œfl¬Ã˙˘øÈ¬ øÚı«±‰¬Ú fl¬ı˛± Î¬◊ø‰¬Ó¬º
91
NSOU
’±ı±ı˛ minimizing Œ‡À˘±˚˛±h¬ B-ı˛ Œé¬ÀS B1, B2, B3 Œfl¬Ã˙˘&ø˘ı˛ ÊÚ… ¸ıÀ‰¬À˚˛ ‡±ı˛±¬Û
Ù¬˘&ø˘ (column maxima) ˝˘ ˚Ô±[À˜ 2, 5, 2º
¤‡Ú min {2, 5, 2}=2º
¸≈Ó¬ı˛±—, ëø˜øÚ˜…±'í ÚœøÓ¬ ’Ú≈˚±˚˛œ, Œ‡À˘±˚˛±h¬ B-¤ı˛ B1 ı± B3 Œfl¬Ã˙˘ ÚœøÓ¬ øÚı«±‰¬Ú fl¬ı˛± Î¬◊ø‰¬Ó¬º
¸≈Ó¬ı˛±—, ¤Àé¬ÀS [œh¬±ı˛ ˜±Ú ˝Àı 2 ¤ı— øıqX¬ Î¬◊M˜ Œfl¬Ã˙˘ ˝Àı (A1, B1) ı± (A1, B3) Œ˚‡±ÀÚ √õ∂Ô˜
ıg¬Úœı˛ ˜ÀÒ… √õ∂Ô˜øÈ¬ A-ı˛ ¤ı— øZÓ¬œ˚˛øÈ¬ B-ı˛ Î¬◊M˜ Œfl¬Ã˙˘ øÚÀ«˙ fl¬Àı˛º
¤‡Ú ‘row minima’ Œı˛ ı·«±fl¬±ı˛ ‚ı˛ Z±ı˛± ¤ı— ‘column maxima’ Œı˛ ı‘M±fl¬±ı˛ ‚ı˛ Z±ı˛± ıX¬
fl¬ı˛À˘ Î¬◊¬ÛÀı˛ı˛ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™' ŒÔÀfl¬ ’±˜ı˛± øÚÀ‰¬ı˛ Âflƒ¬øÈ¬ ¬Û±˝◊ †
B
B1 B2 B3 row min
A1 2 5 2 2
A2 –1 2 –8 –8
A A3 –2 3 2 –2
column max
2 2 2
¤˝◊ [œh¬± ¸˜¸…±ı˛ Œé¬ÀS—
max (row min)=min (row max)=[œh¬±ı˛ ˜±Ú=2º
˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™À'ı˛ Œ˚ ‚Àı˛ı˛ ïcell-¤ı˛ó ÊÚ… max (row min)=min (row max), Œ¸˝◊ cell øÈ¬Àfl¬
[œh¬±ı˛ ’Àù´±¬ÛÀı˛˙Ú øıj≈ (saddle point) ıÀ˘º
Ó¬±˝À˘ Œ‡± ˚±ÀBÂ Œ˚ Œfl¬±Ú [œh¬±ı˛ ’Àù´±¬ÛÀı˛˙Ú øıj≈ı˛ ’øô¶Q ∏ Ô±fl¬À˘, ¤˝◊ øıj≈ÀÓ¬ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™'øÈ¬ı˛
entry-ı˛ ˜±ÚøÈ¬˝◊ ˝Àı [œh¬±ı˛ ˜±Ú (value of the game)º
Œ˚ Œfl¬±Ú √õ∂M ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™À'ı˛ Œé¬ÀS ’Àù´±¬ÛÀı˛˙Ú øıj≈ı˛ ¸—:± †
Òı˛± ˚±fl¬ Œfl¬±Ú [œh¬± ¸˜¸…±ı˛ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™'øÈ¬ ˝˘ [aij]m×nº
[aij]m×n ˜…±øÈ¬™'øÈ¬ı˛ (p, q) position øÈ¬Àfl¬ ï˚ø ¤ı˛ ’øô¶∏Q Ô±Àfl¬ó ’Àù´±¬ÛÀı˛˙Ú øıj≈ (saddle
point) ı˘± ˝Àıº ˚ø p Ó¬˜ ¸±øı˛ı˛ minimum element ¤ı— q Ó¬˜ ¸±øı˛ı˛ minimum element ¤ı—
q Ó¬˜ ô¶∏Ày¬ı˛ maximum element Î¬◊ˆ¬˚˛˝◊ apq ˝˚˛
’Ô«±» apq £ apj , j=1, 2,..........n
¤ı— apq ³ aiq , i=1, 2,..........m
’Àù´±¬ÛÀı˛˙Ú øıj≈ı˛ ’øô¶∏ÀQı˛ ¸À/ ¸•Ûøfl«¬Ó¬ fl¬À˚˛fl¬øÈ¬ Î¬◊¬Û¬Û±… †
Î¬◊¬Û¬Û±… 1. Œfl¬±Ú [œh¬± ¸˜¸…±ı˛ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™'øÈ¬ [aij]m×n ˝À˘,
ma x m i n aij £ m i n ma x aij
j j j i
√õ∂˜±Ì † ˜ÀÚ fl¬èÚ ma x [ m i n aij ] = a pq

j j
¤ı— m i n [ ma x aij ] = ars

j i
92
NSOU
Ó¬±˝À˘ apq ˝˘ √õ∂M ˜…±øÈ¬™'øÈ¬ı˛ p Ó¬˜ ¸±øı˛ı˛ minimum Î¬◊¬Û±±Ú (element) ¤ı— ars ˝˘ s
Ó¬˜ ô¶∏Ày¬ı˛ maximum elementº ¸≈Ó¬ı˛±— ’±˜ı˛± ¬Û±˝◊—
apq £ aps .......... (1)
ars ³ aps ........... (2)
(1) › (2) ŒÔÀfl¬ ’±˜ı˛± ¬Û±˝◊—
apq £ aps £ ars
\ apq ³ ars
¸≈Ó¬ı˛±— √õ∂˜±øÌÓ¬ ˝˘ Œ˚— mai x [ m ij n aij ] £ m ij n [ m ai x aij ]
Î¬◊¬Û¬Û±… 2. [ aij ]m×n ˜…±øÈ¬™'øÈ¬ Œfl¬±Ú [œh¬±ı˛ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™' ˝À˘, [œh¬±øÈ¬ı˛ ’Àù´±¬ÛÀı˙Ú øıj≈ı˛
’øô¶∏Q Ô±fl¬Àı ˚ø ¤ı— Œfl¬ı˘˜±S ˚ø mai x [ m ij n aij ] = m ij n [ mai x aij ]
√õ∂˜±Ì † ˜ÀÚ fl¬èÚ (p, q) ’ıî±ÚøÈ¬ √õ∂M [œh¬±ı˛ ¤fl¬øÈ¬ ’Àù´±¬ÛÀı˙Ú øıj≈º Ó¬±˝À˘ ’±˜ı˛± ¬Û±˝◊—
apq ³ aiq i=1, 2,.......... m .......... (1)
¤ı— apq £ apj j=1, 2,.......... n ..........(2)
¤‡Ú (1) ŒÔÀfl¬ ı˘± ˚±˚˛ mai x a iq £ a pq ¤ı— (2) ŒÔÀfl¬ ı˘± ˚±˚˛ m ij n a pj ³ a pq
Ó¬±˝À˘ ’±˜ı˛± ¬Û±˝◊ mai x a iq £ a pq £ m ij n a pj
¤‡Ú m ij n m ai x aij £ m ai x aiq ¤ı— m ij n a pj £ m ai x maj x aij
¸≈Ó¬ı˛±— m ij n mai x aij £ m ai x aiq £ m ij n a pg £ mai x m ij n a ji
\ m ij n m ai x aij £ m ai x m ij n aij ............ (3)
¬Û≈Úı˛±˚˛ Î¬◊¬Û¬Û±… 1 ŒÔÀfl¬ ’±˜ı˛± ¬Û±˝◊ñ mai x m ij n aij £ m ij n mai x aij ............ (4)
¤‡Ú (3) › (4) ŒÔÀfl¬ √õ∂˜±øÌÓ¬ ˝˘ñ mai x [ m ij n aij ] = m ij n [ m ai x aij ]
¤‡Ú ˜ÀÚ fl¬èÚ mai x [ m ij n aij ] = m ij n [ m ai x aij ] ............ (5)
Òı˛± ˚±fl¬ m ij n aij ¤ı˛ ˜±Ú ¸ıÀ‰¬À˚˛ Œı˙œ ˝˚˛ ˚‡Ú i = pº
Ó¬±˝À˘ m ij n a pj = mai x [ m ij n aij ] ............ (6)
’±ı±ı˛ Òı˛± ˚±fl¬ mai x aij ¤ı˛ ˜±Ú ¸ıÀ‰¬À˚˛ fl¬˜ ˝˚˛ ˚‡Ú j = qº
Ó¬±˝À˘, mai x aiq = m ij n [ mai x aij ] ............ (7)
93
NSOU
¤‡Ú (5), (6) › (7) ŒÔÀfl¬ ’±˜ı˛± ¬Û±˝◊ñ m ij n a pj = m ai x aiq ............ (8)
’±ı±ı˛ m ij n a pj £ mai x aiq ............ (8a)
¸≈Ó¬ı˛±— (8) ŒÔÀfl¬ ’±˜ı˛± ¬Û±˝◊ñ
ma x aiq £ a pq ˚± ŒÔÀfl¬ ı˘± ˚±˚˛ a a , i = 1, 2,............ m ............ (9)
i pq iq
’±ı±ı˛ mai x aiq ³ a pq ............ (8b)

¸≈Ó¬ı˛±— (8) ŒÔÀfl¬ ’±˜ı˛± ¬Û±˝◊ñ
m i n a pj ³ a pq ˚± ŒÔÀfl¬ ı˘± ˚±˚˛ apq apj, j = 1, 2,............ n ............ (10)
j
¤‡Ú (9) › (10) ŒÔÀfl¬ ’±˜ı˛± ı˘ÀÓ¬ ¬Û±øı˛ Œ˚ (p, q) ’ıî±ÚøÈ¬ [œh¬±øÈ¬ı˛ ¤fl¬øÈ¬ ’Àù´±¬ÛÀı˙Ú øıj≈
˝Àıº
¸≈Ó¬ı˛±—, Î¬◊¬Û¬Û±…øÈ¬ √õ∂˜±øÌÓ¬ ˝˘º
˜ôL√ ı … † (i) ˚ø (p, q) ’ıî±ÚøÈ¬ [aji]m×n ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™' øıø˙©Ü [œh¬±ı˛ ’Àù´±¬ÛÀı˙Ú øıj≈ ˝˚˛
Ó¬±˝À˘ (5), (8), (8a), (8b) ŒÔÀfl¬ ’±˜ı˛± ı˘ÀÓ¬ ¬Û±øı˛ Œ˚ [œh¬±ı˛ ˜±Ú (value of the game) ˝Àı
apq Œ˚‡±ÀÚ a pq = mai x [ m ij n aij ] = m ij n [ mai x aij ] ¤ı— ¤Àé¬ÀS maximizing Œ‡À˘±˚˛±h¬ A
› minimizing Œ‡À˘±˚˛±h¬ B-¤ı˛ Î¬◊M˜ Œfl¬Ã˙˘ (optimal strategies) ˝Àı ˚Ô±[À˜ øıqX¬ Œfl¬Ã˙˘ Ap
› øıqX¬ Œfl¬Ã˙˘ Bqº
(ii) ˚ø [œh¬±øÈ¬ı˛ ’Àù´±¬ÛÀı˙Ú øıj≈ ¬Û±›˚˛± Ú± ˚±˚˛ Ó¬±˝À˘ Œfl¬ı˘˜±S øıqX¬ Œfl¬Ã˙˘ ’ı˘•§Ú
fl¬Àı˛ [œh¬±ı˛ ˜±Ú øÚÌ«˚˛ fl¬ı˛± ˚±Àı Ú±º
14.6 Î¬◊  ±˝ı˛ Ì
1. ÚœÀ‰¬ı˛ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™' øıø˙©Ü [œh¬±øÈ¬ı˛ ¸˜±Ò±Ú fl¬èÚ †

B
B1 B2 B3 B4 B5
A1 11 4 3 10 2
A2 8 7 6 8 9
A
A3 4 6 6 5 10
A4 7 8 4 4 3
94
NSOU
¸˜±Ò±Ú †
B1 B2 B3 B4 B5 row min
A1 11 4 3 10 2 2
A2 8 7 6 8 9 6
A3 4 6 6 5 10 4
A4 7 8 4 4 3 3
Col-man 11 8 6 10 10
¤‡±ÀÚ max (row min) = max {2, 6, 4, 3} = 6
¤ı— min (col max) = min {11, 8, 6, 10, 10} = 6
¸≈Ó¬ı˛±— ¤‡±ÀÚ ¸…— (row min) = min (col. max) = 6
’Ó¬¤ı √õ∂M [œh¬±øÈ¬ı˛ (2, 3) ’ıî±ÚøÈ¬ ¤fl¬øÈ¬ ’Àù´±¬ÛÀı˙Ú øıj≈º Ó¬±˝À˘ [œh¬±øÈ¬ı˛ ˜±Ú 6 ¤ı— øıqX¬
Î¬◊M˜ Œfl¬Ã˙˘ ˝˘ (A2, B3)º
2. Œ‡±Ú Œ˚ øÚÀ‰¬ı˛ [œh¬±øÈ¬ı˛ Œfl¬±Ú ’Àù´±¬ÛÀı˙Ú øıj≈ Ú±˝◊º
B
B1 B2 B3 B4
A1 2 1 2 –1
A2 1 3 1 3
A
A3 3 2 3 –1
A4 –1 3 –1 7
¸˜±Ò±Ú †
B1 B2 B3 B4 row min
A1 2 1 2 –1 –1
A2 1 3 1 3 1
A3 3 2 3 1 –1
A4 –1 3 –1 7 –1
Col-man 3 3 3 7
95
NSOU
¤‡±ÀÚ max (row min) = max {– 1, 1, – 1, – 1} = 1
¤ı— min (col. max) = min {3, 3, 3, 7} = 7
¸≈Ó¬ı˛±—, max (row min) ¹ min (col. max)
’Ó¬¤ı √õ∂M [œh¬±øÈ¬ı˛ Œfl¬±Ú ’Àù´±¬ÛÀı˙Ú øıj≈ Ú±˝◊º
3. ˚ø øÚÀ‰¬ı˛ [œh¬±ı˛ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™À'ı˛ (2, 2) øıj≈ÀÓ¬ ’Àù´±¬ÛÀı˙Ú øıj≈ Ô±Àfl¬ Ó¬±˝À˘ x › y ¤ı˛
¸fl¬˘ ˜±Ú øÚÌ«˚˛ fl¬èÚº ’±ı˛› √õ∂˜±Ì fl¬èÚ Œ˚ x, y ¤ı˛ Œfl¬±Ú ˜±ÀÚı˛ ÊÚ… (2, 3) øıj≈ÀÓ¬ [œh¬±øÈ¬ı˛
’Àù´±¬ÛÀı˙Ú øıj≈ Ô±fl¬ÀÓ¬ ¬Û±Àı˛ Ú±º
B
B1 B2 B3
A1 5 x 9
A A2 y 8 13
A3 9 6 7
¸˜±Ò±Ú † √õ∂Ô˜ ’—˙ † ¤‡±ÀÚ Œ›˚˛± ’±ÀÂ Œ˚ (2, 2) ’ıî±ÚøÈ¬ ¤fl¬øÈ¬ ’Àù´±¬ÛÀı˙Ú øıj≈º ¤‡Ú
(2, 2) ’ıî±ÚÀÚ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™À'ı˛ Î¬◊¬Û±±Ú (element) ˝˘ 8º ¸≈Ó¬ı˛±— ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™À'ı˛ 2 Ó¬˜
¸±øı˛ı˛ minimum Î¬◊¬Û±±Ú 8 ¤ı— 2 Ó¬˜ ô¶∏Ày¬ı˛ maximum Î¬◊¬Û±±Ú 8º Ó¬±˝À˘ ’±˜ı˛± ¬Û±˝◊ y ³ 8 ¤ı—
x £ 8º ’±ı±ı˛ x £ 8 ¤ı— y ³ 8 ˝À˘˝◊ (2, 2) ’ıî±ÚøÈ¬ ¤fl¬øÈ¬ ’Àù´±¬ÛÀı˙Ú øıj≈ ˝Àıº ¸≈Ó¬ı˛±— x
› y ¤ı˛ øÚÀÌ«˚˛ ˜±Ú&ø˘ x £ 8, y ³ 8 ŒÔÀfl¬ ¬Û±›˚˛± ˚±Àıº
øZÓ¬œ˚˛ ’—À˙ † (2, 3) ’ıî±ÀÚ ˜”˘… ¸”‰¬fl¬ ˜…±øÈ¬™'øÈ¬ı˛ element ˝˘ 13 ˚± Ó‘¬Ó¬œ˚˛ ô¶∏Ày¬ı˛ maxi-
mum element øfl¬c√ 13 fl¬‡Ú˝◊ øZÓ¬œ˚˛ ¸±øı˛ı˛ minimum dlement ˝ÀÓ¬ ¬Û±Àı˛ Ú± fl¬±ı˛Ì ¤˝◊ ¸±øı˛ÀÓ¬
8 (8 < 13) ¤fl¬øÈ¬ Î¬◊¬Û±±Ú (element)º ¸≈Ó¬ı˛±— x › y ¤ı˛ Œfl¬±Ú ˜±ÀÚı˛ ÊÚ… (2, 3) øıj≈ÀÓ¬ [œh¬±øÈ¬ı˛
’Àù´±¬ÛÀı˙Ú øıj≈ Ô±fl¬ÀÓ¬ ¬Û±Àı˛ Ú±º
14.7 ¸±ı˛±—˙
√õ∂ÔÀ˜ ≈˝◊ ı…øªı˛ ˙”Ú… Œ˚±·Ù¬˘ øıø˙©Ü [œh¬±ı˛ ˜”˘… ¸”‰¬fl¬ ˜…±øÈ¬™À'ı˛ (pay off matrix) Ò±ı˛Ì± Œ›˚˛±
˝À˚˛ÀÂ ¤ı— ¬ÛÀı˛ √õ∂˜±Ì fl¬ı˛± ˝À˚˛ÀÂ Œ˚ Œfl¬ı˘˜±S øıqX¬ Œfl¬Ã˙˘ (pure strategy) ’ı˘•§Ú fl¬Àı˛ ¤ı˛+¬Û
[œh¬±ı˛ ˜±Ú (value of the game) øÚÌ«˚˛ fl¬ı˛± ˚±Àı ˚ø ¤ı— Œfl¬ı˘˜±S ˚ø [œh¬±ı˛ ’Àù´±¬ÛÀı˙Ú øıj≈
(saddle point) ¬Û±›˚˛± ˚±˚˛º
96
NSOU
14.8 ’Ú≈ ˙ œ˘Úœ
√1. maximin (minimiax) ÚœøÓ¬ √õ∂À˚˛±· fl¬Àı˛ øÚÀ‰¬ı˛ [œh¬±&ø˘ ¸˜±Ò±Ú fl¬èÚ †
(i)
B
B1 B2 B3
A1 6 3 –3
A A2 –2 1 2
A3 5 4 6
(ii)
B
B1 B2 B3 B4
A1 4 2 3 5
A2 –2 –1 4 –3
A
A3 5 2 3 3
A4 4 0 0 1
(iii)
B
B1 B2 B3
A1 7 4 1
A2 4 2 0
A
A3 3 –1 –2
A4 1 5 –3
97
NSOU
2. øÚÀ‰¬ı˛ ˜”˘… ¸”‰¬fl¬ øıø˙©Ü [œh¬±ı˛ Œé¬ÀS √õ∂˜±Ì fl¬èÚ Œ˚ [œh¬±øÈ¬ı˛ Œfl¬±Ú ’Àù´±¬ÛÀı˙Ú øıj≈ Ú±˝◊º
B
B1 B2 B3 B4 B4
A1 3 10 5 9 5
A2 4 5 12 10 6
A
A3 5 6 4 7 13
A4 11 7 8 5 2
3. √õ∂˜±Ì fl¬èÚ Œ˚ x (> 0) ¤ı˛ Œ˚ Œfl¬±Ú ˜±ÀÚı˛ ÊÚ…
B
B1 B2
A1 2 4
A ¤˝◊ [œh¬±øÈ¬ı˛ ˜±Ú 21
A2 –1 x
4. √õ∂˜±Ì fl¬èÚ Œ˚ ˜”˘… ¸”‰¬fl¬ ˜…±øÈ¬™' øıø˙©Ü [œh¬±øÈ¬ı˛ Œfl¬±Ú ’Àù´±¬ÛÀı˙Ú øıj≈ Ô±fl¬ÀÓ¬ ¬Û±Àı˛ Ú±º ˚‡Ú
a < b, a < c, d < b, d < cº
13.10 Î¬◊ M ı˛ ˜ ±˘±

1. (i) (A3, B2); J = 4
(ii) (A1, B2), (A3, B2); J = 2
(iii) (A1, B3); J = 1
98
NSOU
¤fl¬fl¬ 15
¬¤fl¬fl¬ ❑ ø˜| Œfl¬Ã˙˘ (Mixed Strategies) ¸˝ ≈ ˝ ◊
ı…øªı˛ ˙” Ú … Œ˚±·Ù¬˘ øıø˙©Ü [œh¬± ¸˜¸…± (Two-
person Aero-sum game)
·Í¬Ú
√ 15.1 õ∂ô¶∏ ± ıÚ±
√ 15.2 2 × 2 [À˜ı˛ ˜” ˘ … ¸” ‰ ¬fl¬ ˜…±øÈ¬™ ' øıø˙©Ü [œh¬± ¸˜¸…±ı˛ ¸˜±Ò±Úº
√ 15.3 Î¬◊  ±˝ı˛ Ì
√ 15.4 √ õ ∂±Ò±Ú… Ó¬MW (rules for dominance) ı…ı˝±ı˛ fl¬Àı˛ [œh¬± ¸˜¸…±ı˛
¸˜±Ò±Úº
√ 15.5 Î¬◊  ±˝ı˛ Ì
√ 15.6 √ õ ∂Ó¬…±˙± ’À¬Ûé¬fl¬ (expectation function) › fl¬À˚˛ fl ¬øÈ¬ √ õ ∂À˚˛ ± ÊÚœ˚˛
Î¬◊ ¬ Û¬Û±…º
√ 15.7 ¸±ı˛ ± —˙
√ 15.8 ’Ú≈ ˙ œ˘Úœ
√ 15.9 Î¬◊ M ı˛ ˜ ±˘±
15.1 õ∂ô¶∏ ± ıÚ±
¤fl¬fl¬ 14-ŒÓ¬ ’±˜ı˛± ŒÀ‡øÂ Œ˚ Œfl¬ı˘˜±S øıqX¬ Œfl¬Ã˙˘ (pure strategy) ’ı˘•§Ú fl¬Àı˛ Œ˚
Œfl¬±Ú [œh¬± ¸˜¸…±ı˛ ¸˜±Ò±Ú fl¬ı˛± ˚±˚˛ Ú±º 14·3 ’Ú≈ÀBÂÀ ’±˜ı˛± ø˜| Œfl¬Ã˙À˘ı˛ (mixed strategy)
Ò±ı˛Ì± Œ¬ÛÀ˚˛øÂº ¤˝◊ ¤fl¬Àfl¬ √õ∂ÔÀ˜ ’±˜ı˛± Œ‡ı øfl¬ˆ¬±Àı ø˜| Œfl¬Ã˙˘ ’ı˘•§Ú fl¬Àı˛ 2 × 2 [À˜ı˛
˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™' øıø˙©Ü [œh¬±ı˛ ï˚±ı˛ Œfl¬±Ú ’Àù´±¬ÛÀı˙Ú øıj≈ Ú±˝◊ó ¸˜±Ò±Ú fl¬ı˛± ˚±˚˛ ¤ı— ¬ÛÀı˛
Œ‡ı øfl¬ˆ¬±Àı √õ∂±Ò±Ú… Ó¬MW (rules for dominance) √õ∂À˚˛±· fl¬Àı˛, ’ÀÚfl¬ Œé¬ÀS Œ˚ Œfl¬±Ú [À˜ı˛
Œfl¬±Ú [œh¬± ¸˜¸…±ı˛ ¸˜±Ò±Ú 2 × 2 [À˜ı˛ [œh¬± ¸˜¸…±ı˛ ¸˜±Ò±ÀÚı˛ Î¬◊¬Ûı˛ øÚˆ«¬ı˛ fl¬Àı˛º
99
NSOU
15.2 2×2 [À˜ı˛ ˜” ˘ …¸” ‰ ¬fl¬ ˜…±øÈ¬™ ' øıø˙©Ü [œh¬± ¸˜¸…±ı˛
¸˜±Ò±Ú
Òı˛± ˚±fl¬ Œfl¬±Ú 2 × 2 [œh¬±ı˛ ï˚±ı˛ Œfl¬±Ú ’Àù´¬ÛÀı˙Ú øıj≈ Ú±˝◊ó ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™'øÈ¬ ˝˘ñ
B
B1 B2
A1 a b
A:
A2 c d
¤‡Ú ’±˜ı˛± Œ‡ı øfl¬ˆ¬±Àı ø˜| Œfl¬Ã˙˘ ’ı˘•§Ú fl¬Àı˛ [œh¬±øÈ¬ı˛ ˜±Ú ¤ı— Î¬◊M˜ Œfl¬Ã˙˘
(optimal strategies) øÚÌ«˚˛ fl¬ı˛± ˚±˚˛º
Œ‡À˘±˚˛±h¬ A-ø˜| Œfl¬Ã˙˘ ’ı˘•§Ú fl¬ı˛±ı˛ ’Ô« ˝˘ Œ˚ [œh¬±øÈ¬ı˛ Œ˚ Œfl¬±Ú ¸•Û±Ú A1, A2
Œfl¬Ã˙˘&ø˘ı˛ ˜ÀÒ… ¤fl¬øÈ¬ Œfl¬Ã˙˘ Î¬◊ÀV˙…˝œÚˆ¬±Àı (at random) øÚı«±‰¬Ú fl¬ı˛± ¤ı— ø˜| Œfl¬Ã˙˘
øÚÌ«˚˛ fl¬ı˛±ı˛ ’Ô« ˝˘ Œ˚ A1, A2 Œfl¬Ã˙˘&ø˘ı˛ øÚı«±‰¬ÀÚı˛ ¸y¬±ıÚ±, Òı˛± ˚±fl¬ ˚Ô±[À˜ x1, x2, (0 £
x1 £ 1, 0 £ x2 £ 1) ¤ı˛ ˜±Ú øÚÌ«˚˛ fl¬ı˛±º ¤‡Ú Œ˚À˝Ó≈¬ A1, A2 fl¬‡Ú˝◊ ¤fl¬˝◊ ¸À/ øÚı«±‰¬Ú fl¬ı˛±
˝˚˛ Ú± ¤ı— ¤fl¬øÈ¬ Œfl¬Ã˙˘ ’ı˙…˝◊ øÚı«±‰¬Ú fl¬ı˛± ˝Àı ’±˜ı˛± ¬Û±˝◊ x1 + x2 = 1º
Ó¬±˝À˘ A1, A2 Œfl¬Ã˙˘&ø˘ øÚı«±‰¬ÀÚı˛ ¸y¬±ıÚ± ˚Ô±[À˜ Òı˛± ˚±˚˛ x, 1 – x Œ˚‡±ÀÚ 0 £ x1 £ 1º
’Ú≈ı˛+¬Ûˆ¬±Àı Œ‡À˘±˚˛±h¬ B-ı˛ ø˜| Œfl¬Ã˙˘ øÚÌ«˚˛ fl¬ı˛±ı˛ ’Ô« ˝˘ Œ˚ B1, B2 Œfl¬Ã˙˘&ø˘ øÚı«±‰¬ÀÚı˛
¸y¬±ıÚ±, Òı˛± ˚±fl¬ ˚Ô±[À˜ y, 1 – y (0 £ y £ 1) ¤ı˛ ˜±Ú øÚÌ«˚˛ fl¬ı˛±º
√õ∂ÔÀ˜ maximizing Œ‡À˘±˚˛±h¬ A-ı˛ ¸˜¸…±øÈ¬ øıÀı‰¬Ú± fl¬ı˛± ˚±fl¬º
˚ø Œ‡À˘±˚˛±h¬ B, B1 Œfl¬Ã˙˘ ’ı˘•§Ú fl¬Àı˛ Ó¬±˝À˘ A-ı˛ √õ∂Ó¬…±ø˙Ó¬ ˘±ˆ¬ (expected gain) ˝Àı
ax + c (1 – x) = g1 ï˜ÀÚ fl¬èÚó ¤ı— ˚ø Œ‡À˘±˚˛±ı˛ B, B2 Œfl¬Ã˙˘ ’ı˘•§Ú fl¬Àı˛ Ó¬±˝À˘ A-
ı˛ √õ∂Ó¬…±ø˙Ó¬ ˘±ˆ¬ ˝Àı bx + d (1 – x) = g2 ï˜ÀÚ fl¬èÚóº ¤‡Ú ˜ÀÚ fl¬èÚ min {g1, g2) = g'º
Ó¬±À˘ Œ‡± ˚±ÀBÂ Œ˚ minimizing Œ‡À˘±˚˛±h¬ B Œ˚ Œfl¬Ã˙˘˝◊ øÚı«±‰¬Ú fl¬èfl¬ Ú± Œfl¬Ú, A-ı˛
øÚø}¬Ó¬ (guaranteed) √õ∂Ó¬…±ø˙Ó¬ ˘±Àˆ¬ı˛ ¬Ûøı˛˜±Ì ˝Àı g' ˚‡Ú A1 Œfl¬Ã˙˘øÈ¬ x ¸y¬±ıÚ± ¸˝fl¬±Àı˛ A
øÚı«±‰¬Ú fl¬Àı˛º ¤‡Ú A-ı˛ Î¬◊ÀV˙… ˝˘ x1 ¤ı˛ ˜±Ú øÚÌ«˚˛ fl¬ı˛± ˚±ÀÓ¬ g' ¤ı˛ ˜±Ú ¸ıÀ‰¬À˚˛ Œı˙œ ˝˚˛º
¤‡±ÀÚ g1 ³ g', g2 ³ g' ............ (1)
¤ı±ı˛ minimizing Œ‡À˘±˚˛±h¬ B-ı˛ ¸˜¸…±øÈ¬ øıÀı‰¬Ú± fl¬ı˛± ˚±fl¬º
˚ø Œ‡À˘±˚˛±h¬ A, A1 Œfl¬Ã˙˘ ’ı˘•§Ú fl¬Àı˛ Ó¬±˝À˘ B-ı˛ √õ∂Ó¬…±ø˙Ó¬ Œ˘±flƒ¬¸±Ú (expected loss)
˝Àı, ay + b (1 – y) = 11 ï˜ÀÚ fl¬èÚóº
¤ı— ˚ø Œ‡À˘±˚˛±h¬ A, A2 Œfl¬Ã˙˘ ’ı˘•§Ú fl¬Àı˛ Ó¬±˝À˘ B-ı˛ √õ∂Ó¬…±ø˙Ó¬ Œ˘±flƒ¬¸±Ú ˝Àıñcy + d
(1 – y) = l2 ï˜ÀÚ fl¬èÚóº
100
NSOU
¤‡Ú ˜ÀÚ fl¬èÚ max (l1, l2) = l'º
Ó¬±˝À˘ Œ‡± ˚±ÀBÂ Œ˚ maximizing Œ‡À˘±˚˛±h¬ A Œ˚ Œfl¬Ã˙˘˝◊ øÚı«±‰¬Ú fl¬èfl¬ Ú± Œfl¬Ú, B-ı˛
√õ∂Ó¬…±ø˙Ó¬ Œ˘±flƒ¬¸±ÀÚı˛ ¬Ûøı˛˜±Ì fl¬‡Ú˝◊ l' ¤ı˛ Œı˙œ ˝Àı Ú± ˚‡Ú B1 Œfl¬Ã˙˘øÈ¬ y ¸y¬±ıÚ± ¸˝fl¬±Àı˛
B øÚı«±‰¬Ú fl¬Àı˛º ¤‡Ú B-ı˛ Î¬◊ÀV˙… ˝˘ y ¤ı˛ ˜±Ú øÚÌ«˚˛ fl¬ı˛± ˚±ÀÓ¬ l' ¤ı˛ ˜±Ú ¸ıÀ‰¬À˚˛ fl¬˜ ˝˚˛º
¤‡±ÀÚ l1 £ l', l2 £ l' ............ (2)
¤‡Ú (1) › (2) ŒÔÀfl¬ ’±˜ı˛± ¬Û±˝◊ñ
ax + c (1 – x) ³ g', bx + d (1 – x) ³ g'
¤ı— ay + b (1 – y) £ l', cy + d (1 – y) £ l'
’±˜ı˛± ˘é¬… fl¬ı˛øÂ Œ˚ ˚ø x, y (0 £ x £ 1, 0 £ y £ 1) ¤ı˛ ˜±Ú øÚÌ«˚˛ fl¬ı˛± ˚±˚˛ ˚±ÀÓ¬ l1 =
l2 = l' ¤ı— g1 = g2 = g' ˝˚˛ Ó¬±˝À˘ x, y Œı˛ ¤ı˛+¬Û ˜±ÀÚ ÊÚ… (g')mxx = (l')min = J ï˜ÀÚ fl¬èÚó
¤ı— ¤Àé¬ÀS [œh¬±ı˛ ˜±Ú J ˝Àı › x, y ¤ı˛ ˜±Ú ŒÔÀfl¬ Î¬◊ˆ¬˚˛ Œ‡À˘±˚˛±h¬ ¤ı˛ Î¬◊M˜ Œfl¬Ã˙˘ øÚÌ«˚˛
fl¬ı˛± ˚±Àıº
¤‡Ú √õ∂M [œh¬±øÈ¬ı˛ ’Àù´±¬ÛÀı˙Ú øıj≈ Ú± Ô±fl¬±˚˛ a, b, c, d ¤ı˛ ˜±Ú ¤ı˛+¬Û ˝Àı ˚±ÀÓ¬ Œ˚ Œfl¬±Ú
Œé¬ÀS g1 = g2, l1 = l2 ¸˜œfl¬ı˛Ì ≈øÈ¬ x, y ¤ı˛ ÊÚ… (0 £ x £ 1, 0 £ y £ 1) ¸˜±Ò±Ú fl¬ı˛± ˚±Àıº
¸≈Ó¬ı˛±— ø˜| Œfl¬Ã˙˘ ı…ı˝±ı˛ fl¬Àı˛ √õ∂M 2 × 2 [œh¬±øÈ¬ ¸˜±Ò±Ú fl¬ı˛± ˚±Àı ïÎ¬◊±˝ı˛Ì Œ‡≈Úóº
15.3 Î¬◊  ±˝ı˛ Ì
øÚÀ‰¬ı˛ 2 × 2 [œh¬±øÈ¬ ¸˜±Ò±Ú fl¬èÚñ

B
B1 B2
A1 8 5
A:
A2 4 7
¸˜±Ò±Ú † ¤‡±ÀÚ max (row min) = max {5, 4} = 5

¤ı— min (Col. max) = min {8, 7} = 8
¸≈Ó¬ı˛±— max (row min) min ¹ (col. max)º
Ó¬±˝À˘ √õ∂M [œh¬±øÈ¬ı˛ Œfl¬±Ú ’Àù´±¬ÛÀı˙Ú øıj≈ Ú±˝◊º
¸≈Ó¬ı˛±— Œfl¬ı˘˜±S øıqX¬ Œfl¬Ã˙˘ ’ı˘•§Ú fl¬Àı˛ [œh¬±øÈ¬ ¸˜±Ò±Ú fl¬ı˛± ˚±Àı Ú±º
¤‡Ú ø˜| Œfl¬Ã˙˘ ı…ı˝±ı˛ fl¬Àı˛ [œh¬±øÈ¬ ¸˜±Ò±Ú fl¬ı˛± ˚±fl¬º
˜ÀÚ fl¬èÚ Œ‡À˘±˚˛±h¬ A ˚Ô±[À˜ x, 1 – x ¸y¬±ıÚ± øÚÀ˚˛ A1, A2 øÚı«±‰¬Ú fl¬Àı˛ ¤ı— Œ‡À˘±˚˛±h¬
B ˚Ô±[À˜ y, 1 – y ¸y¬±ıÚ± øÚÀ˚˛ B1, B2 øÚı«±‰¬Ú fl¬Àı˛, Œ˚‡±ÀÚ (0 £ x £ 1, 0 £ y £ 1)º
101
NSOU
¤‡Ú Œ‡À˘±˚˛±h¬ A-ı˛ Î¬◊ÀV˙… ˝˘ x ¤ı˛ ˜±Ú ¤˜Ú øÍ¬fl¬ fl¬ı˛± ˚±ÀÓ¬ min {g1, g2} = g' ïÒèÚó
¤ı˛ ˜±Ú ¸ıÀ‰¬À˚˛ Œı˙œ ˝˚˛, Œ˚‡±ÀÚ g1 = 8x + 4 (1 – x) ˝˘ A-ı˛ √õ∂Ó¬…±ø˙Ó¬ ˘±ˆ¬ ˚‡Ú B, B1
Œfl¬Ã˙˘ ·Ë˝Ì fl¬Àı˛ ¤ı— g2 = 5x + 7 (1 – x) ˝˘ A-ı˛ √õ∂Ó¬…±ø˙Ó¬ ˘±ˆ¬ ˚‡Ú B, B2 Œfl¬Ã˙˘ ·Ë˝Ì
fl¬Àı˛º Ó¬±˝À˘ ¤Àé¬ÀS ’±˜ı˛± ¬Û±˝◊ñ
g1 = 8x + 4 (1 – x) ³ g'
g2 = 5x + 7 (1 – x) ³ g'
’Ú≈ı˛+À¬Û Œ‡À˘±˚˛±h¬ B-ı˛ Î¬◊ÀV˙… ŒÔÀfl¬ ’±˜ı˛± ¬Û±˝◊ñ
l1 = 8y + 5 (1 – y) £ l'
l2 = 4y + 7 (1 – y) £ l'
Œ˚‡±ÀÚ y ¤ı˛ ˜±Ú ¤˜Ú øÍ¬fl¬ fl¬ı˛ÀÓ¬ ˝Àı ˚±ÀÓ¬ l' = max {l1, l2} ¤ı˛ ˜±Ú ¸ıÀ‰¬À˚˛ fl¬˜ ˝˚˛º
¤‡Ú g1 = g2, l1 = l2 ŒÔÀfl¬ ’±˜ı˛± ¬Û±˝◊ñ
8x + 4 (1 – x) = 5x + 7 (1 – x),
8y + 5 (1 – y) = 4y + 7 (1 – y),
ı±, 6x = 3, 6y = 2
1 1 1 1
¸≈Ó¬ı˛±—, x = 2 , y = 3 Œ˚‡±ÀÚ 0 < 2 < 1, 0 < 3 < 1 º
1 1
Ó¬±˝À˘ x = 2 , y = 3 ˜±ÀÚı˛ ÊÚ… g' ¸ıÀ‰¬À˚˛ Œı˙œ ˝Àı ¤ı— l' ¸ıÀ‰¬À˚˛ fl¬˜ ˝Àı ¤ı—
1 1 1 1
(g')max = 8 × + 4 × = 5 × + 7 × = 6
2 2 2 2
1 2 1 2
(l')min = 8 × + 5 × = 4 × + 7 × = 6
3 3 3 3
1 1
’Ó¬¤ı x = 2 , y = 3 ˜±ÀÚı˛ ÊÚ… g' ¤ı˛ ˜±Ú ¸ıÀ‰¬À˚˛ Œı˙œ › l' ¤ı˛ ˜±Ú ¸ıÀ‰¬À˚˛ fl¬˜ ¤ı—
(g')max = (l')min = 6º
¸≈Ó¬ı˛±— [œh¬±ı˛ ˜±Ú (value of the game) 6 ¤ı— Î¬◊M˜ Œfl¬Ã˙˘&ø˘ (optimal strategies) ˝˘
FH IK
1 1
A : 2 , 2 ; B : 3, 3
FH IK
1 2
15.4 √ õ ∂±Ò±Ú… Ó¬MW (rules for dominance) ı…ı˝±ı˛ fl¬Àı˛

[œh¬± ¸˜¸…±ı˛ ¸˜±Ò±Ú
[œh¬± ¸˜¸…±˚˛ ˚ø Œfl¬±Ú Œ‡À˘±˚˛±Àh¬ı˛ ï˜ÀÚ fl¬èÚ A) Œé¬ÀS ≈øÈ¬ Œfl¬Ã˙˘, Òı˛± ˚±fl¬ I, II ¬Û±›˚˛±
˚±˚˛ Œ˚‡±ÀÚ ≈øÈ¬ Œfl¬Ã˙À˘ı˛ ˜ÀÒ… ¤fl¬øÈ¬ Œfl¬Ã˙˘, Òı˛± ˚±fl¬ I ¤˜Ú ˝˚˛ Œ˚ I øÚı«±‰¬Ú fl¬ı˛À˘, √õ∂øÓ¬¬Ûé¬
Œ‡À˘±˚˛±h¬ B-ı˛ Œ˚ Œfl¬±Ú Œfl¬Ã˙À˘ı˛ ÊÚ…, Œ‡À˘±˚˛±h¬ A-ı˛ Ù¬˘ Œfl¬Ã˙˘ II ¤ı˛ Œ‰¬À˚˛ ¸ı«± ˆ¬±˘ ı±
102
NSOU
¤fl¬˝◊ ı˛fl¬˜ ˝˚˛ Ó¬±˝À˘ ’±˜ı˛± ı˘ı ëëŒfl¬Ã˙˘ I, Œfl¬Ã˙˘ II ¤ı˛ Ó≈¬˘Ú±˚˛ √õ∂±Ò±Ú… ¬Û±˚˛íí ¤ı— ¤Àé¬ÀS
√õ∂M ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™' ï˜ÀÚ fl¬èÚ C) ŒÔÀfl¬ Œfl¬Ã˙˘ II ¤ı˛ ¸±øı˛ ïı± ô¶∏y¬ó ı± Œ›˚˛± ˚±˚˛º
¤˝◊ˆ¬±Àı ¸±øı˛ ïı± ô¶∏y¬ó ı± øÀ˘ ˚ø ÚÓ≈¬Ú ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™'øÈ¬ C1 ˝˚˛ Ó¬±˝À˘ C1 ¤ı˛ Î¬◊M˜
Œfl¬Ã˙˘&ø˘ (optimal strategies) ŒÔÀfl¬ original matrix C ¤ı˛ Î¬◊M˜ Œfl¬Ã˙˘&ø˘ ¬Û±›˚˛± ˚±Àı
Œ˚‡±ÀÚ ı± Œ›˚˛± Œfl¬Ã˙˘øÈ¬ı˛ ¸y¬±ıÚ± (probability) 0 Òı˛ÀÓ¬ ˝Àıº øÚÀ‰¬ øıı‘Ó¬ Î¬◊¬Û¬Û±…&ø˘
ï√õ∂˜±Ì Â±h¬±ó ŒÔÀfl¬ √õ∂±Ò±Ú… Ó¬ÀMWı˛ øÚ˚˛˜&ø˘ ¶Û©Üˆ¬±Àı Œı±Á¬± ˚±Àıº
Î¬◊¬Û¬Û±… 1 : ˚ø ≈˝◊ ı…øª ˙”Ú… Œ˚±·Ù¬˘ øıø˙©Ü m × n [œh¬±ı˛ ˜”˘… ¸”‰¬fl¬ ˜…±øÈ¬™À'ı˛ i Ó¬˜ ¸±øı˛ı˛
√õ∂ÀÓ¬…fl¬ ¬Û r Ó¬˜ ¸±øı˛ı˛ ’Ú≈ı˛+¬Û ¬ÛÀı˛ Œ‰¬À˚˛ fl¬˜ ı± ¸˜±Ú ˝˚˛ Ó¬±˝À˘ i Ó¬˜ ¸±øı˛ ı± øÀ˘
maximizing Œ‡À˘±˚˛±Àh¬ı˛ Î¬◊M˜ Œfl¬Ã˙˘&ø˘ı˛ (optimal strategies) Œfl¬±Ú ¬Ûøı˛ıÓ«¬Ú ˝Àı Ú±º
[ ¤Àé¬ÀS r Ó¬˜ ¸±øı˛ı˛ [œh¬± Œfl¬Ã˙˘ i Ó¬˜ ¸±øı˛ı˛ [œh¬± Œfl¬Ã˙À˘ı˛ Ó≈¬˘Ú±˚˛ √õ∂±Ò±Ú… ¬Û±˚˛º ]
Î¬◊¬Û¬Û±… 2 : ˚ø Œfl¬±Ú m × n [œh¬±ı˛ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™À'ı˛ j-Ó¬˜ ô¶∏Ày¬ı˛ √õ∂ÀÓ¬…fl¬ ¬Û k-Ó¬˜ ô¶∏Ày¬ı˛
’Ú≈ı˛+¬Û ¬ÛÀı˛ Œ‰¬À˚˛ Œı˙œ ı± ¸˜±Ú ˝˚˛ Ó¬±˝À˘ j-Ó¬˜ ô¶∏y¬ ı± øÀ˘ minimizing Œ‡À˘±˚˛±Àh¬ı˛ Î¬◊M˜
Œfl¬Ã˙˘&ø˘ (optimal strategies) Œfl¬±Ú ¬Ûøı˛ıÓ«¬Ú ˝Àı Ú±º
[ ¤‡±ÀÚ k-Ó¬˜ ô¶∏Ày¬ı˛ [œh¬± Œfl¬Ã˙˘ j-Ó¬˜ ô¶∏Ày¬ı˛ [œh¬± Œfl¬Ã˙À˘ı˛ Ó≈¬˘Ú±˚˛ √õ∂±Ò±Ú… ¬Û±˚˛º]
Î¬◊¬Û¬Û±… 3 : ˚ø m × n [œh¬±ı˛ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™À'ı˛ i Ó¬˜ ¸±øı˛ı˛ √õ∂ÀÓ¬…fl¬ ¬Û ’Ú… ¸±øı˛&ø˘ı˛
Î¬◊M˘ ¸˜ı±À˚˛ı˛ (convex combination) ’Ú≈ı˛+¬Û ¬ÛÀı˛ Œ‰¬À˚˛ £ ï’ôL√Ó¬ ¤fl¬øÈ¬ ¬ÛÀı˛ ÊÚ… <ó ˝˚˛,
Ó¬±˝À˘ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™' ŒÔÀfl¬ i Ó¬˜ ¸±øı˛ ı± øÀ˘ maximizing Œ‡À˘±˚˛±Àh¬ı˛ Î¬◊M˜ Œfl¬Ã˙˘&ø˘ı˛
(optimal strategies) Œfl¬±Ú ¬Ûøı˛ıÓ«¬Ú ˝Àı Ú±º
˚ø j Ó¬˜ ô¶∏Ày¬ı˛ √õ∂ÀÓ¬…fl¬ ¬Û ’Ú… ô¶∏y¬&ø˘ı˛ Î¬◊Mı˛ ¸˜ı±À˚˛ı˛ ’Ú≈ı˛+¬Û ¬ÛÀı˛ Œ‰¬À˚˛ ï’ôL√Ó¬ ¤fl¬øÈ¬
¬ÛÀı˛ ÊÚ… >) ˝˚˛, Ó¬±˝À˘ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™' ŒÔÀfl¬ j-Ó¬˜ ô¶∏y¬ ı± øÀ˘ minimizing Œ‡À˘±˚˛±Àh¬ı˛
Î¬◊M˜ Œfl¬Ã˙˘&ø˘ı˛ Œfl¬±Ú ¬Ûøı˛ıÓ«¬Ú ˝Àı Ú±º
15.5 Î¬◊  ±˝ı˛ Ì
√õ∂±Ò±Ú… Ó¬ÀMWı˛ ı…ı˝±ı˛ fl¬Àı˛ øÚÀ‰¬ı˛ [œh¬± ¸˜¸…±øÈ¬ ¸˜±Ò±Ú fl¬èÚ †

B
B1 B2 B3 B4
A1 1 –1 2 1
A2 2 2 0 1
A
A3 3 –2 1 –2
A4 3 1 –3 2
103
NSOU
¸˜±Ò±Ú † ¤‡±ÀÚ A maximizing Œ‡À˘±˚˛±h¬ ¤ı— B minimizing Œ‡À˘±˚˛±h¬º ’±˜ı˛± ˘é¬…
ı˛ı˛øÂ Œ˚ B1 ô¶∏Ày¬ı˛ √õ∂ÀÓ¬…fl¬ ¬Û B2 ô¶∏Ày¬ı˛ ’Ú≈ı˛+¬Û ¬ÛÀı˛ Œ‰¬À˚˛ Œı˙œ ı± ¸˜±Ú ¤ı— øÓ¬ÚøÈ¬ ¬ÛÀı˛
Œé¬ÀS [B1 ô¶∏Ày¬ı˛ 1, 3, 3 ; B2 ô¶∏Ày¬ı˛ – 1, – 2, 1] ’±˜ı˛± ¬Û±˝◊ 1 > – 1, 3 > – 2, 3 >º
¸≈Ó¬ı˛±— √õ∂±Ò±Ú… Ó¬MW ’Ú≈˚±˚˛œ, √õ∂M ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™' ŒÔÀfl¬ B1 ¤ı˛ ô¶∏y¬øÈ¬ ı± Œ›˚˛± ˚±˚˛º ¤‡Ú
ı˛+¬Û±ôL√øı˛Ó¬ ˜…±øÈ¬™'øÈ¬ ˝˘ñ
B2 B3 B4
A1 –1 2 1
A2 2 0 1
A3 –2 1 –2
A4 1 –3 2
1
’±ı±ı˛ Œ‡± ˚±ÀBÂ Œ˚ 2 (A1+A2) [ A1 ¸±øı˛ › A2 ¸±øı˛ı˛ ¤fl¬øÈ¬ Î¬◊Mı˛ ¸˜ı±˚˛ ] ¤ı˛ ¬Û&ø˘
1 1
˝˘ 2 , 1, 1 ¤ı— 2 > –2, 1=1, 1> –2 Œ˚‡±ÀÚ A3 ¸±øı˛ı˛ ’Ú≈ı˛+¬Û ¬Û&ø˘ ˝˘ –2, 1, –2º
¸≈Ó¬ı˛±— √õ∂±Ò±Ú… Ó¬MW ’Ú≈˚±˚˛œ A3 ¤ı˛ ¸±øı˛øÈ¬ ı± Œ›˚˛± ˚±˚˛ ¤ı— ı˛+¬Û±ôL√øı˛Ó¬ ˜…±øÈ¬™'øÈ¬ ˝˚˛—
B2 B3 B4
A1 –1 2 1
A2 2 0 1
A4 1 –3 2
1 1
¤‡Ú 2 (B2+B3) ¤ı˛ ¬Û&ø˘ ˝˘ 2 , 1, –1 ¤ı— B4 ô¶∏Ày¬ı˛ ’Ú≈ı˛+¬Û ¬Û&ø˘ ˝˘ 1, 1, 2
Œ˚‡±ÀÚ 1> 21 , 1=1, 2>–1º
Ó¬±˝À˘ √õ∂±Ò±Ú… Ó¬ÀMWı˛ øÚ˚˛˜ ’Ú≈˚±˚˛œ B4 ¤ı˛ ô¶∏y¬ ı± Œ›˚˛± ˚±˚˛ ¤ı— ı˛+¬Û±ôL√øı˛Ó¬ ˜…±øÈ¬™'øÈ¬ ˝˚˛—
B2 B3
A1 –1 2
A2 2 0
A3 1 –3
1 3
¤˝◊ ˜…±øÈ¬™'øÈ¬ı˛ Œé¬ÀS ’±˜ı˛± ˘é¬… fl¬ı˛øÂ Œ˚ 4 A1+ 4 A2 [ A1, A2 ¤ı˛ ¤fl¬øÈ¬ Î¬◊M˘ ¸˜ı±˚˛ ]
5 1 5 1
¤ı˛ ¬Û&ø˘ ˝˘ 4 , 2 ¤ı— A4 ¸±øı˛ı˛ ’Ú≈ı˛+¬Û ¬Û&ø˘ ˝˘ 1, –3 Œ˚‡±ÀÚ 4 >1, 2 >–3º
104
NSOU
¸≈Ó¬ı˛±— √õ∂±Ò±Ú… Ó¬MW ’Ú≈˚±˚˛œ A4-ı˛ ¸±øı˛ ı± Œ›˚˛± ˚±˚˛º Ó¬±˝À˘ ı˛+¬Û±ôL√øı˛Ó¬ ˜…±øÈ¬™'øÈ¬ ˝˘—
B2 B3
A1 –1 2
˚± ¤fl¬øÈ¬ 2×2 [À˜ı˛ ˜…±øÈ¬™'º
A2 2 0
B2 B3
A1 –1 2
˜…±øÈ¬™'øÈ¬ı˛ Œé¬ÀS
A2 2 0
max (row min)=max {–1, 0}=0

¤ı— min (row max)=min {2, 2}=2
Œ˚‡±ÀÚ 0 ¹ 2.
¸≈Ó¬ı˛±— ˜…±øÈ¬™'øÈ¬ı˛ Œfl¬±Ú ’Àù´±¬ÛÀı˙Ú øıj≈ Ú±˝◊º
¤‡Ú ø˜| Œfl¬Ã˙˘ ’ı˘•§Ú fl¬ı˛À˘, Î¬◊M˜ Œfl¬Ã˙À˘ı˛ ÊÚ… ’±˜ı˛± ¬Û±˝◊—
– 1.x + 2 (1 – x) = 2x + 0. (1 – x)..........(1)
– 1.y + 2 (1 – y) = 2y + 0. (1 – y)..........(2)
Œ˚‡±ÀÚ maximizing Œ‡À˘±˚˛±h¬ A1, A2 Œfl¬Ã˙˘&ø˘ ˚Ô±[À˜ x, 1–x (0 £ x £ 1) ¸y¬±ıÚ±
øÚÀ˚˛ øÚı«±‰¬Ú fl¬Àı˛ ¤ı— minimizing Œ‡À˘±˚˛±h¬ B2, B3 Œfl¬Ã˙˘&ø˘ ˚Ô±[À˜ y, 1–y (0 £ y £
1) ¸y¬±ıÚ± øÚÀ˚˛ øÚı«±‰¬Ú fl¬Àı˛º
¤‡Ú (1) › (2) ¸˜±Ò±Ú fl¬Àı˛ ’±˜ı˛± ¬Û±˝◊ x = 25 , y = 25 º
2 3 2 3
¸≈Ó¬ı˛±— A1, A2-ı˛ ¸y¬±ıÚ± 5 , 5 º ¤ı— B2, B3-ı˛ ¸y¬±ıÚ± 5 , 5 º
2 3 4
[œh¬±ı˛ ˜±Ú ˝˘ -1× 5 + 2 × 5 = 5 º
¸≈Ó¬ı˛±— √õ∂M [œh¬±øÈ¬ı˛ Î¬◊M˜ Œfl¬Ã˙˘&ø˘ (optimal strategies) ˝˘ †
FH 2 3 IK
A : , , 0, 0 ; B : 0, , , 0 FH 2 3 IK
5 5 5 5
¤ı— [œh¬±ı˛ ˜±Ú (value of the game) 45 º
15.6 √ √õ ∂Ó¬…±˙± ’À¬Ûé¬fl¬ (expectation function) ¤ı—

fl¬À˚˛ fl ¬øÈ¬ √ õ ∂À˚˛ ± ÊÚœ˚˛ Î¬◊ ¬ Û¬Û±…
Òı˛± ˚±fl¬ m×n [œh¬±ı˛ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™'øÈ¬ [aij]m×n , Œ˚‡±ÀÚ [œh¬±øÈ¬ı˛ √õ∂ÀÓ¬…fl¬ ¸•Û±ÀÚ
maximizing Œ‡À˘±˚˛±h¬ A Ó¬±ı˛ √õ∂M Œfl¬Ã˙˘&ø˘ A1, A2..........Am ŒÔÀfl¬ ¤fl¬øÈ¬ Œfl¬Ã˙˘ øÚı«±‰¬Ú
105
NSOU
fl¬Àı˛ ¤ı— minimizing Œ‡À˘±˚˛±h¬ B Ó¬±ı˛ √õ∂M Œfl¬Ã˙˘&ø˘ B1, B2.............Bn ŒÔÀfl¬ ¤fl¬øÈ¬
Œfl¬Ã˙˘ øÚı«±‰¬Ú fl¬Àı˛º
ø˜| Œfl¬Ã˙˘ ’ı˘•§ÀÚı˛ Œé¬ÀS ˜ÀÚ fl¬èÚ Œ‡À˘±˚˛±h¬ A Ó¬±ı˛ √õ∂M Œfl¬Ã˙˘&ø˘ A1, A2..........Am
˚Ô±[À˜ x1, x2..........xm ¸y¬±ıÚ± øÚÀ˚˛ ¤ı— Œ‡À˘±˚˛±h¬ B Ó¬±ı˛ √õ∂M Œfl¬Ã˙˘&ø˘ B1, B2..........Bn
˚Ô±[À˜ y1, y2,..........yn ¸y¬±ıÚ± øÚÀ˚˛ øÚı«±‰¬Ú fl¬Àı˛ Œ˚‡±ÀÚ x1+x2+..........+..........+xm=1,
y1+y2+....................–yn=1 ¤ı— xi ³ 0, yj ³ 0 (i=1, 2,..........m; j=1, 2,..........n)
B
y1 y2 y3 ...................................... yn
x1 a11 a12 a13 ...................................... a1n
x2 a21 a22 a23 ...................................... a2n
A x3 a31 a32 a33 ...................................... a3n

.............................
.....................................................................................................
.....................................................................................................
xm am1 am1 am3 ...................................... amn
¤‡±ÀÚ aij ˝˘ Œ‡À˘±˚˛±h¬ A-ı˛ ¬Û±›Ú± (pay off) ˚‡Ú Œ‡À˘±˚˛±h¬ A ¤ı— B ˚Ô±[À˜ øıqX¬ Œfl¬Ã˙˘
Ai, Bj øÚı«±‰¬Ú fl¬Àı˛º Ó¬±˝À˘ Œ‡À˘±˚˛±h¬ B ˚‡Ú øıqX¬ Œfl¬Ã˙˘ Bj øÚı«±‰¬Ú fl¬Àı˛, Œ‡À˘±˚˛±h¬ A-ı˛
m
√õ∂Ó¬…±ø˙Ó¬ ¬Û±›Ú± (expected pay off) ˝Àı åa

i=1
ij
xi ˚‡Ú A ø˜| Œfl¬Ã˙˘ X=(x1, x2..........xm)
’ı˘•§Ú fl¬Àı˛º Ó¬±˝À˘ Œ‡À˘±˚˛±h¬ B ø˜| Œfl¬Ã˙˘ Y=(y1, y2..........yn) ’ı˘•§Ú fl¬ı˛À˘, A-ı˛ √õ∂Ó¬…±ø˙Ó¬
¬Û±›Ú±Àfl¬ A-ı˛ √õ∂Ó¬…±˙± ’À¬Ûé¬fl¬ (pay off function) ıÀ˘ ¤ı— ˝◊˝±Àfl¬ E (X, Y) Z±ı˛± √õ∂fl¬±˙ fl¬ı˛± ˝˚˛º
m n
Ó¬±˝À˘ ’±˜ı˛± ¬Û±˝◊ E (X, Y) = å åj=1

aij xi yj
i=1
m n
¤‡Ú ÒèÚ m axi x m yji n å å

j=1
aij xi yj = J
i=1
106
NSOU
m n
¤ı— m yji n maxi x å åi=1 j=1

aij xi yj = J
[ ¤‡±ÀÚ J ¤ı— J ¤ı˛ ’øô¶∏Q ¶§œfl¬±ı˛ fl¬ı˛± ˝À˚˛ÀÂº ]

’±˜ı˛± ˘é¬… fl¬ı˛øÂ Œ˚—
LM RSå a x , å a x ,........... å a x UVOP

J = m a x min
m m m
N T
xi
i =1
i1 i
WQ
i =1
i2 i
j =1
in i
L R UO
¤ı— J = m i n Mmax Så a y , å a y ,........... å a y VP
n n n
N T
yj
j =1
1j
WQj
j =1
2j j
j =1
mj i
¤‡Ú ø˜| Œfl¬Ã˙À˘ı˛ ¸±˝±À˚… [œh¬± ¸˜¸…± ¸˜±Ò±ÀÚı˛ Œé¬ÀS, maximizing Œ‡À˘±˚˛±h¬ A-¤ı˛ ˘é¬…
˝˘ x1, x2,......xm ¤ı˛ ˜±Ú øÍ¬fl¬ fl¬ı˛± ˚±ÀÓ¬ øÚø}Ó √õ∂Ó¬…ø˙Ó¬ ˘Àˆ¬ı˛ (minimum expected gain)
¬Ûøı˛˜±Ì ¸ıÀ‰¬À˚˛ Œı˙œ ˝˚˛ ¤ı— ’±˜ı˛± ˘é¬… fl¬ı˛øÂ Œ˚ ¸ıÀ‰¬À˚˛ Œı˙œ ¤˝◊ øÚø}¬Ó¬ ˘±Àˆ¬ı˛ ¬Ûøı˛˜±Ì Jº
Minimizing Œ‡À˘±˚˛±h¬ B-ı˛ ˘é¬… ˝˘ y1, y2,......yn ¤ı˛ ˜±Ú øÍ¬fl¬ fl¬ı˛± ˚±ÀÓ¬ y1, y2,..........yn ¤ı˛ Œ˚
Œfl¬±Ú √õ∂M ˜±ÀÚı˛ ÊÚ… Ó¬±ı˛ ¸ıÀ‰¬À˚˛ Œı˙œ √õ∂Ó¬…±ø˙Ó¬ Œ˘±fl¬¸±ÀÚı˛ (expected loss) ¬Ûøı˛˜±Ì ¸ıÀ‰¬À˚˛
º º º º
fl¬˜ ˝˚˛ ¤ı— ’±˜ı˛± ˘é¬… fl¬ı˛øÂ Œ˚ ¤˝◊ ¬Ûøı˛˜±ÌøÈ¬ ˝˘ J º ¤‡Ú ˚ø X = ( x1 , x2 ,.......... xm ) ,
º º º º
Y = ( y 1 , y2 ,.......... yn ) , , ø˜| Œfl¬Ã˙À˘ı˛ ÊÚ… J = J ï= J ÒèÚó ˝˚˛ Ó¬±˝À˘ J ˝Àı [œh¬±ı˛ ˜±Ú
(value of the game) ¤ı— (X, Y) ¤fl¬ÀÊ±h¬± Î¬◊M˜ [œh¬± Œfl¬Ã˙˘ (optimal strategies) ˝Àıº
[ ¤‡±ÀÚ ˜ÀÚ ı˛±‡± ı˛fl¬±ı˛ Œ˚ X= (x1, x2,......xm ) ø˜| Œfl¬Ã˙˘øÈ¬ øıqX¬ Œfl¬Ã˙˘ Ai ˝Àı ˚ø
xi=1, x1=x2=......=xi–1=xj+1=......xm=0 ˝˚˛ ¤ı— Y=(y1, y2,......yn) ø˜| Œfl¬Ã˙˘øÈ¬ øıqX¬ Œfl¬Ã˙˘
Bj ˝Àı ˚ø yi=1, y1=y2......yj–1=yj+1=......=yn=0 ˝˚˛º ]
¤fl¬fl¬ 16-ı˛ ’Ú≈ÀBÂ 16.3-ŒÓ¬ ’±˜ı˛± Œ‡ı Œ˚ ø˜| Œfl¬Ã˙˘ ’ı˘•§Ú fl¬ı˛À˘ Œ˚ Œfl¬±Ú ëë≈˝◊
ı…øªı˛ ˙”Ú… Œ˚±·Ù¬˘ øıø˙©Üíí [œh¬±ı˛ Œé¬ÀS [œh¬±ı˛ ˜±Ú ¤ı— Î¬◊M˜ Œfl¬Ã˙˘ øÚÌ«˚˛ fl¬ı˛± ˚±˚˛º
fl¬À˚˛fl¬øÈ¬ √õ∂À˚˛±ÊÚœ˚˛ Î¬◊¬Û¬Û±… †
Î¬◊¬Û¬Û±… 1 : ˚ø J ˜±Ú øıø˙©Ü Œfl¬±Ú [œh¬±ı˛ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™À'ı˛ √õ∂ÀÓ¬…fl¬ ¬ÛÀı˛ ¸À/ ¤fl¬øÈ¬ øÚø«©Ü
¸—‡…± P Œ˚±· fl¬ı˛± ˝˚˛ Ó¬±˝À˘ Î¬◊M˜ [œh¬± Œfl¬Ã˙˘&ø˘ı˛ (optimal strategies) Œfl¬±Ú ¬Ûøı˛ıÓ«¬Ú ˝Àı
Ú±, øfl¬c√ ı˛+¬Û±ôL√øı˛Ó¬ [œh¬±ı˛ ˜±Ú ˝Àı J+Pº
√õ∂˜±Ì † ˜ÀÚ fl¬èÚ ˜±Ú øıø˙©Ü √õ∂M [œh¬±ı˛ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™'øÈ¬ [ aij ]m×nº ¤‡Ú ¤˝◊ ˜…±øÈ¬™'øÈ¬ı˛
√õ∂ÀÓ¬…fl¬ ¬ÛÀı˛ ¸À/ ¤fl¬øÈ¬ øÚø«©Ü ¸—‡…± P Œ˚±· fl¬ı˛À˘ ı˛+¬Û±ôL√øı˛Ó¬ ˜…±øÈ¬™'øÈ¬ ˝˚˛ [ aij+P ]m×nº ˚ø
107
NSOU
√õ∂M [œh¬±ı˛ ¤ı— √ı˛+¬Û±ôL√øı˛Ó¬ [œh¬±ı˛ √õ∂Ó¬…±˙± ’À¬Ûé¬fl¬ ˚Ô±[À˜ E (X, Y) ¤ı— E ¢ (X, Y) ˝˚˛
Ó¬±˝À˘ ’±˜ı˛± Û±˝◊—
m n m n
E (X, Y)= å å aij xi yj, E ¢ (X, Y) = å å (aij+P) xi yj Œ˚‡±ÀÚ

i =1 j =1 i =1 j =1
X=(x1, x2, ...........xm), Y=(y1, y2..........yn)

m n
¤ı— å xi = å yi = 1
i =1 j =1
o o
¤‡Ú ˚ø √õ∂M [œh¬±ı˛ ¤fl¬ÀÊ±h¬± Î¬◊M˜ [œh¬± Œfl¬Ã˙˘ ( X, Y) ˝˚˛ Ó¬±˝À˘—
m n
å åa
o o
J=E ( X, Y) = m axi x m yji n ij xi yjº
i =1 j =1
m n
¤‡Ú E ¢ ( X, Y) = å åi =1 j =1
(aij+P) xi yj
m n m n
= å åa
i =1 j =1
ij xi yj+P å å
i =1 j =1
xi yj
=E (X, Y)+ P (x1+x2+..........+xm) (y1+y2+..........+yn)

=E (X, Y)+P.1.1
=E (X, Y)+P
¸≈Ó¬ı˛±— ’±˜ı˛± ¬Û±˝◊, E' (X, Y)=E (X, Y) + P .......... (1)
P ¤fl¬øÈ¬ øÚø«©Ü ¸—‡…± ˝›˚˛±˚˛, (1) ŒÔÀfl¬ ’±˜ı˛± ¬Û±˝◊ñ
o o
m a x m i n E ¢ ( X , Y ) = m a x m i n E ( X, Y ) + P = E ( X, Y) + P = J + P
xi yj xi yj
FH o
Ó¬±˝À˘ ’±˜ı˛± ¬Û±˝◊— E ¢ X, Y = E X, Y + P = J + P......(2)
o
IK FH o o
IK
o o
¤‡Ú ï2ó ŒÔÀfl¬ ı˘± ˚±˚˛ Œ˚ ı˛+¬Û±ôL√øı˛Ó¬ [œh¬±ı˛ Œé¬ÀS› ( X, Y) ¤fl¬ÀÊ±h¬± Î¬◊M˜ Œfl¬Ã˙˘ ˝Àı
¤ı— ¤˝◊ [œh¬±ı˛ ˜±Ú ˝Àı J+Pº ¸≈Ó¬ı˛±— Î¬◊¬Û¬Û±…øÈ¬ √õ∂˜±øÌÓ¬ ˝˘º
Î¬◊¬Û¬Û±… 2 † ˚ø Œfl¬±Ú [œh¬±ı˛ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™'øÈ¬ ¤fl¬øÈ¬ øı√õ∂øÓ¬¸˜ ˜…±øÈ¬™' (skew symmetric
matrix) ˝˚˛ Ó¬±˝À˘ [œh¬±ı˛ ˜±Ú (value of the game) ˙”Ú… ˝Àıº
√õ∂˜±Ì † √õ∂M [œh¬±ı˛ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™'øÈ¬ aij m´ n
˝À˘, maximizing Œ‡À˘±˚˛±Àh¬ı˛ √õ∂Ó¬…±˙±
m n
’À¬Ûé¬fl¬ ˝Àı E (X, Y)= å åa ij xi, yj ,Œ˚‡±ÀÚ X=(x1, x2......xm), Y=(y1, y2,.....yn)
i =1 j =1
˚Ô±[À˜ maximizing Œ‡À˘±˚˛±h¬ A › minimizing Œ‡À˘±˚˛±h¬ B ¤ı˛ ø˜| Œfl¬Ã˙˘º
108
NSOU
¤‡±ÀÚ aij m´ n
√ ¤fl¬øÈ¬ øı√õ∂øÓ¬¸˜ ˜…±øÈ¬™'º ¸≈Ó¬ı˛±— m=n ¤ı— aij= –aij (i=1, 2, ..........n; j=1,
2,.......n)º
n n
Ó¬±˝À˘ ¤‡±ÀÚ X=(x , x ........x ) ; Y=(y , y ,........y ) ¤ı— E (X, Y) = å å a

1 2 n 1 2 n
ij xi yj
i =1 j =1
o o
¤‡Ú ( X, Y) ¤fl¬ÀÊ±h¬± Î¬◊M˜ Œfl¬Ã˙˘ ˝À˘ ¤ı— [œh¬±ı˛ ˜±Ú J ˝À˘,
o o
J =E ( X, Y) = max x m iy n E (X,Y)º Ó¬±˝À˘ ’±˜ı˛± ¬Û±˝◊—
o o
J = m iy n E ( X, Y) ..........(1)
o o
¤‡Ú (1) ŒÔÀfl¬ ’±˜ı˛± ¬Û±˝◊ E ( X, Y) ³ J ˚± minimizing Œ‡À˘±˚˛±h¬ B ¤ı˛ Œ˚ Œfl¬±Ú ø˜|
Œfl¬Ã˙˘ Y=(y1, y2........yn) ¤ı˛ ÊÚ… ¸Ó¬…º Ó¬±˝À˘ Y = xo = ( xo 1 , xo 2 ,.......... xo n ) ¤ı˛ ÊÚ… ’±˜ı˛±
o o
¬Û±˝◊ E ( X, Y) ³ J..........(2)
n n
å åa
o o o o
øfl¬c ( X, Y) = ij xi x j
i =1 j =1
n n
= åå
i =1 j =1
aij – xo i xo j ï\ ¤‡±ÀÚ a = – a )
ij ji
o o o o
\ E ( X, X) = – E ( X, X)
o o
ı± 2E ( X, X) = 0
o o
¸≈Ó¬ı˛±— E ( X, X) = 0º Ó¬±˝À˘ (2) ŒÔÀfl¬ ’±˜ı˛± ¬Û±˝◊ J £ 0 ............ (3)
o
’±ı±ı˛ J = minY
man
X
E(X, Y) = man X
E ( X, Y)
¸≈Ó¬ı˛±— maximizing Œ‡À˘±˚˛±h¬ A-ı˛ Œ˚ Œfl¬±Ú ø˜| Œfl¬Ã˙˘ X = (x1, x2............xn) ¤ı˛ ÊÚ…
o
’±˜ı˛± ¬Û±˝◊ E ( X, Y) £ J
o o o o
Ó¬±˝À˘ X, Y = ( y 1 , y 2 ,.......... y n ) Òı˛À˘
o o
’±˜ı˛± ¬Û±˝◊ E (Y, Y) £ J ............ (4)
n n
åå
o o o o
’±ı±ı˛ E (Y, Y) = aij y i , y j
i =1 j =1
109
NSOU
n n
åå
o o o o
=– aij y i , y j = – E (Y, Y)
i =1 j =1
o o
\ 2E (Y, Y) = 0
o o
¸≈Ó¬ı˛±— E (Y, Y) = 0
Ó¬±˝À˘ (4) ŒÔÀfl¬ ’±˜ı˛± ¬Û±˝◊ J ³ 0 ............ (5)
¤‡Ú (3) › (5) ŒÔÀfl¬ ’±˜ı˛± ¬Û±˝◊ J ³ 0º
¸≈Ó¬ı˛±— Î¬◊¬Û¬Û±…øÈ¬ √õ∂˜±øÌÓ¬ ˝˘º
15.7 ¸±ı˛ ± —˙
√õ∂ÔÀ˜ ’±˜ı˛± ŒÀ‡øÂ øfl¬ˆ¬±Àı ø˜| Œfl¬Ã˙˘ ’ı˘•§Ú fl¬Àı˛ 2 × 2 [œh¬±ı˛ ï˚±ı˛ ’Àù´±¬ÛÀı˙Ú øıj≈
Ú±˝◊ó ¸˜±Ò±Ú fl¬ı˛± ˚±˚˛º ¤ı˛ ¬Ûı˛ ’±˜ı˛± ŒÀ‡øÂ øfl¬ˆ¬±Àı √õ∂±Ò±Ú… Ó¬ÀMWı˛ (rules of dominance)
¸±˝±À˚… ’ÀÚfl¬ Œé¬ÀS Œfl¬±Ú [œh¬±ı˛ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™'Àfl¬ 2 × 2 [À˜ı˛ ˜…±øÈ¬™À' ı˛+¬Û±ôL√ı˛ fl¬ı˛± ˚±˚˛º
¬Ûøı˛À˙À¯∏ √õ∂Ó¬…±˙± ’À¬Ûé¬Àfl¬ı˛ (expectation function) ¸—:± øÀ˚˛ ≈øÈ¬ &èQ¬Û”Ì« Î¬◊¬Û¬Û±À…ı˛ √õ∂˜±Ì
Œ›˚˛± ˝À˚˛ÀÂº
15.8 ’Ú≈ ˙ œ˘Úœ

1. øÚÀ‰¬ı˛ 2 × 2 [œh¬±&ø˘ ¸˜±Ò±Ú fl¬èÚ †
(i) B1 B2
A1 10 5
A2 5 10
I II
(ii) I 5 –4
A:
II –4 –1
I II
(iii)
I 2 12
II 8 3
110
NSOU
2. √õ∂±Ò±Ú… Ó¬ÀMWı˛ ¸±˝±À˚… øÚÀ‰¬ı˛ 4 × 5 [œh¬±øÈ¬ ¸˜±Ò±Ú fl¬èÚ †
B1 B2 B3 B4 B5
A1 10 5 5 20 4
A2 11 15 10 17 25
A3 7 12 8 9 8
A4 5 13 9 10 5
3. øÚÀ‰¬ı˛ √õ∂ÀÓ¬…fl¬øÈ¬ [œh¬±Àfl¬ 2 × 2 [À˜ı˛ ˜”˘…¸”‰¬fl¬ øıø˙©Ü [œh¬±˚˛ ı˛+¬Û±ôL√ı˛ fl¬èÚ †

(i)
7 7 6 3 2
9 8 9 3 5
10 6 7 10 11
(ii) 2 3 1
2
3 2 0
2
1 1 1
2
4. 3 (ii) ¤ı˛ [œh¬±øÈ¬ ¸˜±Ò±Ú fl¬èÚº
5. Œfl¬±Ú [œh¬±ı˛ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™'øÈ¬ B
B1 B2
A1 0 2
A
A2 1 1
1
E (X, Y) = 1 – 2x (y – ), Œ˚‡±ÀÚ X = (x, 1 – x), Y = (y, 1 – y) ˚Ô±[À˜ Œ‡À˘±˚˛±h¬
2
A › Œ‡À˘±˚˛±h¬ B ¤ı˛ ø˜|Àfl¬Ã˙˘º
¤ı˛ ŒÔÀfl¬ [œh¬±ı˛ ˜±Ú øÚÌ«˚˛ fl¬èÚ ¤ı— Œ‡±Ú Œ˚ Œ‡À˘±˚˛±h¬ A-ı˛ Î¬◊M˜ Œfl¬Ã˙˘ ¤fl¬øÈ¬ øıqX¬
Œfl¬Ã˙˘ ¤ı— ’¸—‡… ø˜| Œfl¬Ã˙˘ B-ı˛ Î¬◊M˜ Œfl¬Ã˙˘ ˝Àıº
[¸—Àfl¬Ó¬ † E (X, Y) = 0·x·y + 2·x (1 – y) + 1·(1 – x)·y + 1·(1 – x) (1 – y)
= 2x – 2xy + y – xy + 1 + xy – x – y
= 1 + x – 2xy
1
= 1 – 2x (y – )
2
111
NSOU
1
¤‡±ÀÚ y ¤ı˛ Œ˚ Œfl¬±Ú øÚø« © Ü ˜±ÀÚı˛ ÊÚ… E (X, Y) £ 1, ˚‡Ú 2 £ y £ 1
¤ı— E (X, Y) ³ 1 ˚‡Ú 0 £ y £ 21 º
1
¸≈Ó¬ı˛±— 0max
£ x £ 1 E (X, Y) = 1 ˚‡Ú
2
£y£1
¤ı— max E (X, Y) > 1 ˚‡Ú 0 £ y < 1 .

0 £ x £1
2
\ min max E ( X, Y) = 1 ¤ı—

0 £ y < 21 0 £ x £1
min max E ( X, Y) = 1
1
£ y £1 0 £ x £1
2
¸≈Ó¬ı˛±— 0max
£ y £1
max
0 £ x £ 1 E ( X, Y ) =1
1
’±˜ı˛± ˘é¬… fl¬ı˛øÂ Œ˚ x = 0 ˝À˘ ¤ı— y ¤ı˛ Œ˚ Œfl¬±Ú ˜±ÀÚı˛ ÊÚ… Œ˚‡±ÀÚ 2 £ y £ 1, E
(X, Y) = 1 ˝˚˛º ]
6. øÚÀ‰¬ı˛ √õ∂ÀÓ¬…fl¬ 2 × 2 [œh¬±ı˛ √õ∂Ó¬…±˙± ’À¬Ûé¬fl¬ øÚÌ«˚˛ fl¬èÚ ¤ı— ¤ı˛ ¸±˝±À˚… [œh¬±ı˛ ˜±Ú ›
Î¬◊M˜ Œfl¬Ã˙˘ Œıı˛ fl¬èÚ † B
(i)
1 7
A
6 2
(ii) B
1 3
A
4 2
7. ˚ø Œfl¬±Ú 3 × 3 [œh¬±ı˛ ˜”˘… ¸”‰¬fl¬ ˜…±øÈ¬™'øÈ¬ (maximizing Œ‡À˘±˚˛±Àh¬ı˛ó ˝˚˛º
d c c
a f e
b d c Œ˚‡±ÀÚ, 0 < a < b < c < d < e < f
¤ı— (x1, x2, x3) › (y1, y2, y3) ˚Ô±[À˜ maximizing Œ‡À˘±˚˛±h¬ › minimizing Œ‡À˘±˚˛±Àh¬ı˛
Î¬◊M˜ Œfl¬Ã˙˘ ˝˚˛, Ó¬±˝À˘ Œ‡±Ú x3 = y2 = 0 ¤ı— [œh¬±ı˛ ˜±Ú J ˝À˘ √õ∂˜±Ì fl¬èÚ c < J < dº
112
NSOU
15.9 Î¬◊ M ı˛ ˜±˘±
1. (i)
FH 1 , 1IK ; FH 1 , 1IK ; J = 15
2 2 2 2 2
(ii)
FH 1 , 3IK ; FH 1 , 3IK ; J = 7
4 4 4 4 4
(iii)
FH 1 , 2IK ; FH 3 , 2IK ; J = 6
3 3 5 5
2. øıqX¬ Œfl¬Ã˙˘ (A2, B3) ; J = 10
LM 83 103 OP
3. (i)
N Q
(ii) M 1
L 2 21 O
MN 2 1 PPQ
4.
FH 1 , 0, 3IK ; FH 1 , 0, 3IK ; J = 7
4 4 4 4 8
5. J = 1
6. (i)
FH 1 , 1IK ; FH 1 , 3IK ; J = 5
2 2 4 4 2
(ii)
FH 2 , 3IK ; FH 1 , 1IK ; J = 4
5 5 2 2
113
NSOU
¤fl¬fl¬ 16
¬¤fl¬fl¬ ❑ [œh¬± ¸˜¸…±Àfl¬ L.P.P ø˝¸±Àı ¸˜±Ò±Ú
·Í¬Ú
√ 16.1 õ∂ô¶∏ ± ıÚ±
√ 16.2 [œh¬± ¸˜¸…±Àfl¬ Δı˛ ø ‡fl¬ Œ√ õ ∂±·Ë ± ˜øıøÒ ¸˜¸…±˚˛ ı˛ + ¬ Û±ôL√ ı ˛
√ 16.3 ≈ ˝ ◊ ı…øªı˛ ˙” Ú … Œ˚±·Ù¬˘ øıø˙©Ü [œh¬± ¸˜¸…± ¸—[±ôL√ Œ˜Ã˘ Î¬◊ ¬ Û¬Û±…
(Fundamental theorem on two-person zero-sum game)
√ 16.4 Î¬◊  ±˝ı˛ Ì
√ 16.5 ¸±ı˛ ± —˙
√ 16.6 ’Ú≈ ˙ œ˘Úœ
√ 16.7 Î¬◊ M ı˛ ˜ ±˘±
16.1 õ∂ô¶∏ ± ıÚ±
¤fl¬fl¬ 14-ŒÓ¬ ’±˜ı˛± ŒÀ‡øÂ Œ˚ Œfl¬±Ú [œh¬±ı˛ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™À'ı˛ ’Àù´±¬ÛÀı˙Ú øıj≈ Ô±fl¬À˘,
[œh¬±øÈ¬ øıqX¬ Œfl¬Ã˙˘ ’ı˘•§Ú fl¬Àı˛ ¸˜±Ò±Ú fl¬ı˛± ˚±˚˛º ¤fl¬fl¬ 15-ŒÓ¬ ’±˜ı˛± ˘é¬… fl¬Àı˛øÂ Œ˚ ’ÀÚfl¬
Œé¬ÀS √õ∂±Ò±Ú… Ó¬ÀMWı˛ ¸±˝±À˚… Œfl¬±Ú [œh¬±ı˛ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™'Àfl¬ 2 × 2 [À˜ı˛ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™À'
ı˛+¬Û±ôL√ı˛ fl¬Àı˛ ø˜| Œfl¬Ã˙˘ ’ı˘•§Ú fl¬Àı˛ ¸˜±Ò±Ú fl¬ı˛± ˚±˚˛º ¤˝◊ ¤fl¬Àfl¬ ’±˜ı˛± Œ‡±ı Œ˚ √õ∂ÀÓ¬…fl¬
[œh¬± ¸˜¸…±Àfl¬ Δı˛ø‡fl¬ Œ√õ∂±·Ë±˜øıøÒ ¸˜¸…±˚˛ (L.P.P.) ı˛+¬Û±ôL√ı˛ fl¬Àı˛ ¸˜±Ò±Ú fl¬ı˛± ˚±˚˛ ’Ô«±» ≈˝◊
ı…øªı˛ ˙”Ú… Œ˚±·Ù¬˘ øıø˙©Ü Œ˚ Œfl¬±Ú [œh¬±ı˛ Œé¬ÀS [œh¬±ı˛ ˜±Ú ¤ı— Î¬◊M˜ Œfl¬Ã˙˘ øÚÌ«˚˛ fl¬ı˛± ¸y¬ıº
16.2 [œh¬± ¸˜¸…±Àfl¬ Δı˛ ø ‡fl¬ Œ√ õ ∂±·Ë ± ˜øıøÒ ¸˜¸…±˚˛ ı˛ + ¬ Û±ôL√ ı ˛

[Reduction of a two-person zero-sum game
to L.P.P]
˜ÀÚ fl¬èÚ J ˜±Ú øıø˙©Ü m × n [œh¬±ı˛ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™'øÈ¬ ˝˘ [aji]m × nº
¤‡±ÀÚ ’±˜ı˛± ÒÀı˛ øÚÀÓ¬ ¬Û±øı˛ Œ˚ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™À'ı˛ √õ∂ÀÓ¬…fl¬ ¬Û aji > 0 (i = 1, 2, .........m ;
114
NSOU
j = 1, 2,............n) fl¬±ı˛Ì Ó¬± Ú± ˝À˘ √õ∂ÀÓ¬…fl¬ ¬ÛÀı˛ ¸À/ Î¬◊¬Û˚≈ª (appropriate) ÒÚ±Rfl¬ ¸—‡…±
P Œ˚±· fl¬Àı˛ √õ∂ÀÓ¬…fl¬ ¬ÛÀfl¬ ÒÚ±Rfl¬ fl¬ı˛± ˚±˚˛ ¤ı— ’±˜ı˛± ˚±øÚ ¤ı˛ Ù¬À˘ ı˛+¬Û±ôL√øı˛Ó¬ [œh¬±ı˛ ˜±Ú
˝Àı J + Pº øfl¬c√ Î¬◊M˜ Œfl¬Ã˙À˘ı˛ Œfl¬±Ú ¬Ûøı˛ıÓ«¬Ú ˝Àı Ú±º ¤‡Ú ˜ÀÚ fl¬èÚ maximizing
Œ‡À˘±˚˛±h¬ A › minimizing Œ‡À˘±˚˛±h¬ B ˚Ô±[À˜ ø˜|Àfl¬Ã˙˘ (x1, x2............xm) › (y1,.............yn)
’ı˘•§Ú fl¬Àı˛º Ó¬±˝À˘ Œ‡À˘±˚˛±h¬ A, A1, A2............Am √õ∂M Œfl¬Ã˙˘&ø˘Àfl¬ ˚Ô±[À˜ x1,
x2,............xm ¸y¬±ıÚ± øÚÀ˚˛ ¤ı— Œ‡À˘±˚˛±h¬ B Ó¬±ı˛ √õ∂M B1, B2,.........Bn Œfl¬Ã˙˘&ø˘Àfl¬ ˚Ô±[À˜
y 1, y 2............y n ¸y¬±ıÚ± øÚÀ˚˛ Î¬◊ À V˙…˝œÚˆ¬±Àı (at random) øÚı« ± ‰¬Ú fl¬Àı˛ , Œ˚‡±ÀÚ
m n
å xi = å y j = 1 ¤ı— xi ³ 0, yi > 0 (i = 1, 2, ............ m ; j = 1, 2, .........n)º

i =1 j =1
y1 y2 ............................................... yn
B1 B2 ............................................... Bn
x1 A1 a11 a12 ............................................... a1n

x2 A2 a21 a22 ............................................... a2n
.............................
.............................
..............................................................................................
..............................................................................................
..............................................................................................
xm Am am1 am2 ............................................... amn
Œ‡À˘±˚˛±h¬ A-ı˛ ¸˜¸…±

˚ø Œ‡À˘±˚˛±h¬ B Œfl¬Ã˙˘ B1 øÚı«±‰¬Ú fl¬Àı˛ Ó¬±˝À˘ ø˜| Œfl¬Ã˙˘ (x1, x2, ............xm) ¤ı˛ ÊÚ…
Œ‡À˘±˚˛±h¬ A-ı˛ √õ∂Ó¬…±ø˙Ó¬ ˘±ˆ¬Àfl¬ (expected gain) g1 Z±ı˛± √õ∂fl¬±˙ fl¬ı˛À˘ ’±˜ı˛± ¬Û±˝◊,
g1 = a11 x1 + a21 x2 + ............ + aml xm
’Ú≈ı˛+À¬Û ’±˜ı˛± ¬Û±˝◊,
g2 = a12 x1 + a22 x2 + ............ + am2 xm
g3 = a13 x1 + a23 x2 + ............ + am3 xm
............................................................
gn = a1n x1 + a2n x2 + ............ + amn xn
Œ˚‡±ÀÚ A-ı˛ √õ∂Ó¬…±ø˙Ó¬ ˘±ˆ¬ g2, g3, ............ gn ˚‡Ú Œ‡À˘±˚˛±h¬ B ˚Ô±[À˜ Œfl¬Ã˙˘ B2,
B3.........Bn øÚı«±‰¬Ú fl¬Àı˛º
˜ÀÚ fl¬èÚ min {g1, g2, ............ gn} = g'............ (1)
m
¤‡±ÀÚ g' > 0 fl¬±ı˛Ì aij > 0, i, j ¤ı˛ ¸fl¬˘ ˜±ÀÚı˛ ÊÚ… ¤ı— åx
i =1
i = 1 , xi ³ 0 (i = 1, 2, ........m)º
115
NSOU
Ó¬±˝À˘ ø˜| Œfl¬Ã˙˘ (x1, x2............xm) ¤ı˛ ÊÚ… A-ı˛ √õ∂Ó¬…±ø˙Ó¬ ˘±Àˆ¬ı˛ ¬Ûøı˛˜±Ì fl¬˜¬ÛÀé¬ g'
˝Àıº ¤‡Ú Œ‡À˘±˚˛±h¬ A-ı˛ Î¬◊ÀV˙… ˝˘ x1, x2............xm ¤ı˛ ˜±Ú øÚÌ«˚˛ fl¬ı˛± ˚±ÀÓ¬ g' ¤ı˛ ˜±Ú
1
¸ıÀ‰¬À˚˛ Œıø˙ ˝˚˛ ’Ô«±» g ¢ ¤ı˛ ˜±Ú ¸ıÀ‰¬À˚˛ fl¬˜ ˝˚˛ (\ g' > 0)º
(1) ŒÔÀfl¬ ’±˜ı˛± ˘ø‡ÀÓ¬ ¬Û±øı˛,
g1 ³ g', g2 ³ g', ............ gn ³ g'
g g g
ı±, g1¢ ³ 1, g2¢ ³ 1 ............ gn¢ ³ 1 (··· g' > 0)
Ó¬±˝À˘ ’±˜ı˛± ¬Û±˝◊,
x1 x x
a11 + a21 2 +............+ am1 m ³ 1 ,
g¢ g¢ g¢
x x x
a12 1 + a22 2 +............+ am2 m ³ 1 ,
g¢ g¢ g¢
..............................................................
..............................................................
x x x
a1n 1 + a2 n 2 +............+ amn m ³ 1 ,
g¢ g¢ g¢
x x x
¤ı— g1¢ = X1, g2¢ = X2, ............ gm¢ = Xm
Òı˛À˘ ’±˜ı˛± ¬Û±˝◊,
aji X1 + a2j X2 + ............ + amj Xm ³ 1, g = 1, 2,.............n
1 x + x +............+ xm
’±ı±ı˛, g ¢ = 1 2 g¢ = X1 + X2 + ............ + Xm
Œ˚‡±ÀÚ, X1 ³ 0, X2 ³ 0, ............ Xm ³ 0.
Ó¬±˝À˘ Œ‡À˘±˚˛±h¬ A-ı˛ ¸˜¸…±Àfl¬ øÚÀ‰¬ı˛ L.P.P. ø˝¸±Àı Œ˘‡± ˚±˚˛ †
1
’ı˜ g ¢ = x1 + x2 + ............ + xm ,
˙Ó«¬¸±À¬ÛÀé¬,
a11 X1 + a21 X2 + ............ + am1 Xm ³ 1,
a12 X2 + a22 X2 + ............ + am2 Xm 1,
..............................................................
..............................................................
a1n Xn + a2n X2 + ............ + amn Xm ³ 1,
X1, X2 ............ Xm ³ 0
116
NSOU
Œ‡À˘±˚˛±h¬ B-ı˛ ¸˜¸…±
˜ÀÚ fl¬èÚ max {l1, l2............lm} = l'............(2),
Œ˚‡±ÀÚ ø˜| Œfl¬Ã˙˘ (y1, y2,............yn) ¤ı˛ ÊÚ… Œ‡À˘±˚˛±h¬ B-ı˛ √õ∂Ó¬…±ø˙Ó¬ Œ˘±fl¬¸±Ú (ex-
pected loss) ˝˘ l1, l2,............lm ˚‡Ú Œ‡À˘±˚˛±h¬ A ˚Ô±[À˜ A1, A2, ............ Am øÚı«±‰¬Ú fl¬Àı˛º
Ó¬±˝À˘ li = ai1 y1 + ai2 y2 + ............+ ain yn (i = 1, 2,............m)º
¤‡Ú (2) ŒÔÀfl¬ ’±˜ı˛± ø˘‡ÀÓ¬ ¬Û±øı˛ l1 £ l', l2 £ l',............lm £ l' ¤ı— l' > 0 ˝›˚˛±˚˛ ’±˜ı˛±
li
¬Û±˝◊, £ 1 , (i = 1, 2,............m)º
l¢
Œ‡À˘±˚˛±h¬ B-ı˛ Î¬◊ÀV˙… ˝˘ y1, y2,............yn ¤ı˛ ˜±Ú øÚÌ«˚˛ fl¬ı˛± ˚±ÀÓ¬ l' ¤ı˛ ˜±Ú ¸ıÀ‰¬À˚˛ fl¬˜
1
˝˚˛ ’Ô«±» l ¢ ¤ı˛ ¸ıÀ‰¬À˚˛ Œı˙œ ˝˚˛ (··· l' > 0)º
li
¤‡Ú £ 1, (i = 1, 2,............m)º ŒÔÀfl¬ ’±˜ı˛± ¬Û±˝◊,
l¢
y1 y y
ai1 + ai 2 2 + ............+ ain n £ 1
l¢ l¢ l¢
y1 y y
¤ı— = Y1 , 2 = Y2 ,............ n = Yn Òı˛À˘ ’±˜ı˛± ¬Û±˝◊
l¢ l¢ l¢
ai1 Y1 + ai2 Y2 + ............ + ain Yn £ 1 (i = 1, 2, ............ m)º
y + y +............+ yn
’±ı±ı˛ 1 = 1 2 = Y1 + Y2 + ............ + Yn,
l¢ l¢
Œ˚‡±ÀÚ Y1 ³ 0, Y2 ³ 0, ............ Yn ³ 0º
Ó¬±˝À˘ Œ‡À˘±˚˛±h¬ B-ı˛ ¸˜¸…±Àfl¬ øÚÀ‰¬ı˛ L.P.P. ø˝¸±Àı Œ˘‡± ˚±˚˛ †
1
‰¬ı˛˜ l ¢ = Y1 + Y2 + Y2 + ............ + Yn,
˙Ó«¬¸±À¬ÛÀé¬,
a11 Y1 + a12 Y2 + ............ + a1 Yn £ 1,
a21 Y1 + a22 Y2 + ............ + a2n Yn £ 1,
..............................................................
..............................................................
am1 Y1 + am2 Y2 + ............ + amn Yn £ 1,
Y1 ³ 0, Y2 ³ 0, ............ Yn ³ 0
117
NSOU
’±˜ı˛± ˘é¬… fl¬ı˛øÂ Œ˚ B-ı˛ ¸˜¸…±øÈ¬ (L.P.P. ø˝¸±Àıó A-ı˛ ¸˜¸…±ı˛ (L.P.P. ø˝¸±Àıó ΔZÓ¬
(Dual) ¸˜¸…± ¤ı— A-ı˛ ¸˜¸…±øÈ¬ B-ı˛ ¸˜¸…±ı˛ ΔZÓ¬ ¸˜¸…±º
LMå å a
m n
OP
N Q
¤‡Ú (l')’ı˜ = min max ji xi y j
xi y j i =1 j =1
LMå å a
m n
O
x y P
¤ı— (g')‰¬ı˛˜ = max
y
min
x
j i
N
i =1 j =1
ji i
Qj
¬Ûı˛ıÓ¬œ« ’Ú≈ÀBÂ ’±˜ı˛± √õ∂˜±Ì fl¬ı˛ı Œ˚ (l')’ı˜ = (g')‰¬ı˛˜ = J ïÒèÚó ı± [œh¬±ı˛ ˜±Ú (Value of
the game)º
Ó¬±˝À˘ Œ‡± Œ·˘ Œ˚ Œfl¬±Ú [œh¬± ¸˜¸…±Àfl¬ L.P.P-ŒÓ¬ ı˛+¬Û±ôL√ı˛ fl¬Àı˛ ¸˜±Ò±Ú fl¬ı˛± ˚±˚˛º
16.3 ≈ ˝ ◊ ı…øªı˛ ˙” Ú … Œ˚±·Ù¬˘ øıø˙©Ü [œh¬± ¸˜¸…± ¸—[±ôL√

Œ˜Ã˘ Î¬◊ ¬ Û¬Û±… (Fundamental theorem on two-
person zero sum game)
[œh¬± ¸˜¸…± ¸—[±ôL√ Œ˜Ã˘ Î¬◊¬Û¬Û±À…ı˛ øıı‘øÓ¬ –
ø˜| Œfl¬Ã˙˘ ’ı˘•§Ú fl¬ı˛À˘ Œ˚ Œfl¬±Ú ëë≈˝◊ ı…øªı˛ ˙”Ú… Œ˚±·Ù¬˘ øıø˙©Üíí [œh¬±ı˛ ˜±Ú (value
of the game) ¤ı— Î¬◊M˜ Œfl¬Ã˙˘ (optimal strategies) ¬Û±›˚˛± ˚±Àıº
√ õ ∂˜±Ì – ˜ÀÚ fl¬èÚ √õ∂M [œh¬±ı˛ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™'øÈ¬ [aji]m × n Œ˚‡±ÀÚ ’±˜ı˛± ÒÀı˛ øÚÀÓ¬ ¬Û±øı˛ Œ˚
˜…±øÈ¬™'øÈ¬ı˛ √õ∂ÀÓ¬…fl¬øÈ¬ ¬Û aij > 0 [ 16·2 ’Ú≈ÀBÂÀ ¤ı˛ ı…±‡…± Œ›˚˛± ˝À˚˛ÀÂ ]º
˜ÀÚ fl¬èÚ maximizing Œ‡À˘±˚˛±h¬ A-ı˛ ø˜| Œfl¬Ã˙˘ (x1, x2............xm) ¤ı— minimizing
Œ‡À˘±˚˛±h¬ B-ı˛ ¤fl¬øÈ¬ ø˜| Œfl¬Ã˙˘ (y1, y2,............yn) ’Ô«±» Œ‡À˘±˚˛±h¬ A Ó¬±ı˛ √õ∂M Œfl¬Ã˙˘&ø˘
A1, A2,............Am Œfl¬ ˚Ô±[À˜ x1, x2, ............ xm ¸y¬±ıÚ± øÚÀ˚˛ ¤ı— Œ‡À˘±˚˛±h¬ B Ó¬±ı˛ √õ∂M
Œfl¬Ã˙˘&ø˘ B1, B2,............Bn Œfl¬ ˚Ô±[À˜ y1, y2,............yn ¸y¬±ıÚ± øÚÀ˚˛ Î¬◊ÀV˙…˝œÚ ˆ¬±Àı (at
random) øÚı«±‰¬Ú fl¬Àı˛, Œ˚‡±ÀÚñ
m n
åx = åy
i =1
i
j =1
j = 1 ¤ı— xi > 0, yj > 0 (i = 1, 2,......... ; j = 1, 2, .............n)º
Ó¬±˝À˘ 16·2 ’Ú≈ÀBÂÀ ŒÀ‡øÂ Œ˚ [œh¬± ¸˜¸…±Àfl¬ øÚÀ‰¬ı˛ ≈øÈ¬ L.P.P. ø˝¸±Àı Œ˘‡± ˚±˚˛ †
Œ‡À˘±˚˛±h¬ A-ı˛ ¸˜¸…±
’ı˜ 1 = X1 + X2 + ............ + Xm ,
g¢
118
NSOU
˙Ó«¬¸±À¬ÛÀé¬,
a11 X1 + a21 X2 + ............ + am1 Xm ³ 1,
a21 X1 + a22 X2 + ............ + am2 Xm ³ 1,
..............................................................
..............................................................
a1n X1 + a2n X2 + ............ + amn Xm ³ 1,
xi
X1, X2 ............ Xm ³ 0 Œ˚‡±ÀÚ Xi = g ¢ (i = 1, 2, ............m)º
Œ‡À˘±˚˛±h¬ B-ı˛ ¸˜¸…±

1
‰¬ı˛˜ l ¢ = Y1 + Y2 + ............ + Yn,
˙Ó«¬±¸±À¬Ûé¬,
a11 Y1 + a12 Y2 + ............ + a1n Yn £ 1,
a21 Y1 + a22 Y2 + ............ + a2n Yn £ 1,
..............................................................
..............................................................
am1 Y1 + am2 Y2 + ............ + amn Yn £ 1,
yj
Y1, Y2, ............ Yn ³ 0, Œ˚‡±ÀÚ Yi = (i = 1, 2, ............n)º
l¢
¤‡±ÀÚ ’±˜ı˛± ˘é¬… fl¬ı˛øÂ Œ˚ ¤˝◊ ≈øÈ¬ ¸˜¸…±ı˛ (L.P.P ø˝¸±Àıó Œ˚ Œfl¬±ÚøÈ¬ ’Ú…øÈ¬ı˛ ΔZÓ¬… ¸˜¸…±
¤‡Ú ’±˜ı˛± Œ‡±ı Œ˚ A-ı˛ ¸˜¸…±øÈ¬ı˛ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú (feasible solution) ’±ÀÂº
1
ÒèÚ a = min{a , a ,............ a } , Œ˚‡±ÀÚ min{a11, a12,............a1n} > 0, Œ˚À˝Ó≈¬ ¤‡±ÀÚ
11 12 1n
a11, a12, ............ a1n > 0º

a a a a a
Ó¬±˝À˘ a > 0 ¤ı— a11 ³ a11 = 1, a12 ³ a12 = 1, ............ a1n ³ 1
11 12
¸≈Ó¬ı˛±— X1 = a, X2 = 0, ............ Xm = 0
A-ı˛ ¸˜¸…±ı˛ ¸˜ô¶∏ ˙Ó«¬&ø˘ ˜±øÚ˚˛± ‰¬À˘º
Ó¬±˝À˘ ¤˝◊ ¸˜¸…±øÈ¬ı˛ (a, 0,............0) ¤fl¬øÈ¬ fl¬±˚«fl¬ı˛ ¸˜±Ò±Ú ˝Àıº ’±ı±ı˛ ’±˜ı˛± ˘é¬… fl¬ı˛øÂ
Œ˚ ¤˝◊ ¸˜¸…±øÈ¬ı˛ øı¯∏˚˛±Rfl¬ ’À¬Ûé¬fl¬ Œ˚ Œfl¬±Ú fl¬±˚«fl¬ı˛ ¸˜±Ò±ÀÚı˛ ÊÚ… X1 + X2 + ............ Xm
³ 0 ¤ı— Ó¬±˝À˘ ’ı˜ ˜±Ú øÚÌ«˚˛ ¸—[±ôL√ L.P.P øÈ¬ı˛ øı¯∏˚˛±Rfl¬ ’À¬Ûé¬Àfl¬ı˛ ˜±Ú ’ı±Ò (un-
bounded) ˝ÀÓ¬ ¬Û±Àı˛ Ú±º Ó¬±˝À˘ A-ı˛ ¸˜¸…±øÈ¬ı˛ (L.P.P ø˝¸±Àıó ¸¸œ˜ ‰¬ı˛˜ ¸˜±Ò±Ú (finite
119
NSOU
optimal solution) Ô±fl¬Àıº ¤‡Ú ΔZÓ¬Ó¬±ı˛ Œ˜Ã˘ Î¬◊¬Û¬Û±… (Fundamental Theorem on. Du-
ality) ŒÔÀfl¬ ’±˜ı˛± Ê±øÚ ëë˚ø ˜≈‡… ¸˜¸…± ı± ΔZÓ¬ ¸˜¸…± Œ˚ Œfl¬±ÚøÈ¬ı˛ ¸¸˜œ ‰¬ı˛˜ ¸˜±Ò±Ú ¬Û±›˚˛±
˚±˚˛ Ó¬±˝À˘ ’Ú…øÈ¬ı˛› ¸¸œ˜ ‰¬ı˛˜ ¸˜±Ò±Ú ¬Û±›˚˛± ˚±Àı ¤ı— ≈øÈ¬ ¸˜¸…±ı˛ øı¯∏˚˛±Rfl¬ ’À¬Ûé¬Àfl¬ı˛
optimal ˜±Ú&ø˘ ¤fl¬˝◊ ˝Àıºíí
F 1I FH 1 IK
H K
¸≈Ó¬ı˛±— B-ı˛ ¸˜¸…±øÈ¬› ¸¸œ˜ ‰¬ı˛˜ ¸˜±Ò±Ú ¬Û±›˚˛± ˚±Àı ¤ı— g ¢ ’ı˜ = l ¢ ‰¬ı˛˜
’Ô«±» (g')‰¬ı˛˜ = (l')’ı˜º
Ó¬±˝À˘ [œh¬±ı˛ ˜±Ú ¬Û±›˚˛± ˚±Àı › [œh¬±ı˛ ˜±Ú ˝˘ (g')‰¬ı˛˜ [ ı± (l')’ı˜ ] ¤ı— ≈øÈ¬ ¸˜¸…±ı˛ ‰¬ı˛˜
¸˜±Ò±Ú (optimal solutions) ŒÔÀfl¬ [œh¬±ı˛ Î¬◊M˜ Œfl¬Ã˙˘&ø˘ (optimal strategies) ¬Û±›˚˛± ˚±Àıº
\ Î¬◊¬Û¬Û±…øÈ¬ √õ∂˜±øÌÓ¬ ˝˘º
˜ôL√ ı … – ˚ø √õ∂M [œh¬±ı˛ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™À'ı˛ √õ∂ÀÓ¬…fl¬ ¬ÛÀı˛ ¸À/ Œfl¬±Ú ¸—‡…± P Œ˚±· fl¬Àı˛
[œh¬± ¸˜¸…±Àfl¬ L.P.P-ŒÓ¬ ı˛+¬Û±ôL√ı˛ fl¬ı˛± ˝˚˛ Ó¬±˝À˘ √õ∂M [œh¬±ı˛ ˜±Ú ˝Àı (g')‰¬ı˛˜ – P ı± (l')’ı˜ –
Pº øfl¬c√ Î¬◊M˜ Œfl¬Ã˙˘&ø˘ı˛ Œfl¬±Ú ¬Ûøı˛ıÓ«¬Ú ˝Àı Ú±º
16.4 Î¬◊  ±˝ı˛ Ì
1. ¤fl¬øÈ¬ [œh¬± ¸˜¸…±ı˛ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™' øÚÀ‰¬ Œ›˚˛± ˝˘º [œh¬± ¸˜¸…±øÈ¬Àfl¬ Δı˛ø‡fl¬ Œ√õ∂±·Ë±˜øıøÒ
¸˜¸…± ø˝¸±Àı ı˛+¬Û±ôL√ı˛ fl¬Àı˛ ¸˜±Ò±Ú fl¬èÚº
Œ‡À˘±˚˛±h¬ B
B1 B2 B3
A1 1 –1 3
Œ‡À˘±˚˛±h¬ A A2 3 5 –3
A3 6 2 –2
¸˜±Ò±Ú – ¤‡±ÀÚ √õ∂M ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™À'ı˛ √õ∂ÀÓ¬…fl¬ ¬ÛÀı˛ ¸À/ 4 Œ˚±· fl¬ı˛À˘ ï˚±ÀÓ¬ √õ∂ÀÓ¬…fl¬
¬Û > 0 ˝˚˛ó ı˛+¬Û±ôL√øı˛Ó¬ ˜…±øÈ¬™'øÈ¬ ˝˚˛ñ
B1 B2 B3
A1 5 3 7
A2 7 9 1
A3 10 6 2
120
NSOU
˜ÀÚ fl¬èÚ Œ‡À˘±˚˛±h¬ A ø˜| Œfl¬Ã˙˘ (x1, x2, x3) ¤ı— Œ‡À˘±˚˛±h¬ B ø˜| Œfl¬Ã˙˘ (y1, y2, y3)
’ı˘•§Ú fl¬Àı˛ Œ˚‡±ÀÚ x1 + x2 + x3 = 1, y1 + y2 + y3 = 1 › xi ³ 0, yi ³ 0 (i = 1, 2, 3; j
= 1, 2, 3)º
Ó¬±˝À˘ Œ‡À˘±˚˛±h¬ A-ı˛ ¸˜¸…±øÈ¬ (L.P.P. ø˝¸±Àıó ˝Àıñ
1
’ı˜ g ¢ = X1 + X 2 + X 3 ,
˙Ó«¬¸±À¬ÛÀé¬,
5X1 + 7X2 + 10X3 ³ 1
3X1 + 9X2 + 6X3 ³ 1
7X1 + X2 + 2X3 ³ 1,
X1 ³ 0, X2 ³ 0, X3 ³ 0
¤ı— Œ‡À˘±˚˛±h¬ B-ı˛ ¸˜¸…±øÈ¬ (L.P.P ø˝¸±Àıó ˝Àıñ
1
‰¬ı˛˜ l ¢ = Y1 + Y2 + Y3 ,
˙Ó«¬¸±À¬ÛÀé¬,
5Y1 + 7Y2 + 7Y3 £ 1
7Y1 + 9Y2 + Y3 £ 1
10Y1 + 6Y2 + 2Y3 ³ 1,
Y1 ³ 0, Y2 ³ 0, Y3 ³ 0
x y
¤‡±ÀÚ Xi = gi¢ (i = 1, 2, 3) ¤ı— Yi = i ( j = 1, 2, 3)
l¢
¤‡Ú B-ı˛ ¸˜¸…±øÈ¬ ï˚± ‰¬ı˛˜ ˜±Ú øÚÌ«˚˛ ¸—[±ôL√ ¤fl¬øÈ¬ L.P.P.) Simplex algorithm Àı˛ ¸±˝±À˚…
¸˜±Ò±Ú fl¬ı˛± ˚±fl¬ †
Y4, Y5, Y6 ¤˝◊ slack ‰¬˘&ø˘ı˛ ¸±˝±À˚… B-ı˛ ¸˜¸…±øÈ¬ øÚÀ‰¬ı˛ ’±fl¬±Àı˛ Œ˘‡± ˚±˚˛ –
1
‰¬ı˛˜ l ¢ = Y1 + Y2 + Y3 + Y4 + Y5 + Y6,
˙Ó«¬¸±À¬ÛÀé¬,
5Y1 + 3Y2 + 7Y3 + Y4 = 1
7Y1 + 9Y2 + Y3 + Y5 = 1
10Y1 + 6Y2 + Y3 + Y5 = 1
Yj ³ 0, (j = 1, 2, 3, 4, 5, 6)
121
NSOU
Simplex Table—I
RS1 , 1 1 UV
1
min
T3 ,
9 6
=
W
9
Simplex Table—II
R| 2 1 U|
1
min S 3 , 9,
V|
3 = 1
|T 203 1
9
4
3 W
10
122
NSOU
Simplex Table—III
¤‡±ÀÚ j-¤ı˛ ¸fl¬˘ ˜±ÀÚı˛ ÊÚ… zj – cj ³ 0º

¸≈Ó¬ı˛±— Simplex Table III ŒÔÀfl¬ ΔZÓ¬ ¸˜¸…± ¤ı— ˜≈‡… ¸˜¸…±ı˛ ‰¬ı˛˜ ¸˜±Ò±Ú (optimal
solution) ¬Û±›˚˛± ˚±Àıº
1 1
¤‡±ÀÚ B-ı˛ ¸˜¸…±ı˛ Œé¬ÀS Y1 = 0, Y2 = 10 , Y3 = 10 , ŒÔÀfl¬ B-ı˛ Î¬◊M˜ Œfl¬Ã˙˘ ¬Û±›˚˛±
1 1
˚±Àı, Œ˚‡±ÀÚ Y1 + Y2 + Y3 = 5 ˚± l ¢ ¤ı˛ ‰¬ı˛˜ ˜±Ú (maximium value)º
¸≈Ó¬ı˛±— l' -¤ı˛ ’ı˜ ˜±Ú = 5 ˚± ı˛+¬Û±ôL√øı˛Ó¬ [œh¬±ı˛ ˜±Ú (value of the transformed game)º
¸≈Ó¬ı˛±— ¤‡±ÀÚ √õ∂M [œh¬±ı˛ ˜±Ú ˝Àı 5 – 4 = 1º
1 1
¤‡Ú B-¤ı˛ ‰¬ı˛˜ Œfl¬Ã˙À˘ı˛ ÊÚ… y1 = 5Y1 = 0, y2 = 5Y2 = 2 , y3 = 5Y3 = 2 º
2
’±ı±ı˛ Simplex Table III-¤ı˛ zj – cj ¸±øı˛ ŒÔÀfl¬ ’±˜ı˛± ı˘ÀÓ¬ ¬Û±øı˛ Œ˚ X1 = 15 , X2 =
1
, X = 0 ŒÔÀfl¬ A-ı˛ ‰¬ı˛˜ Œfl¬Ã˙˘ ¬Û±›˚˛± ˚±Àıº ¸≈Ó¬ı˛±— A-ı˛ ‰¬ı˛˜ Œfl¬Ã˙À˘ı˛ ÊÚ… x1 = 5X1
15 3
2 5 1
= , x = 5X2 = = , x = 0º
3 2 15 3 3
Ó¬±˝À˘ √õ∂M [œh¬±øÈ¬ı˛ ˜±Ú (J) = 1 ¤ı— Œ‡À˘±˚˛±h¬ A › Œ‡À˘±˚˛±h¬ B-¤ı˛ Î¬◊M˜ Œfl¬Ã˙˘
FH
2 1 IK 1 1FH
˚Ô±[À˜ 3 , 3 , 0 ¤ı— 0, 2 , 2 IK
123
NSOU
16.5 ¸±ı˛ ± —˙
¤˝◊ ¤fl¬Àfl¬ ’±˜ı˛± √õ∂˜±Ì fl¬Àı˛øÂ ëëŒ˚ Œfl¬±Ú [œh¬±ı˛ ˜±Ú ¤ı— Î¬◊M˜ Œfl¬Ã˙˘ ¬Û±›˚˛± ˚±Àı ïø˜|
Œfl¬Ã˙˘ ı…ı˝±ı˛ fl¬ı˛À˘óíí ¤ı— Œ˚ Œfl¬±Ú [œh¬±ı˛ ¸˜¸…±Àfl¬ Δı˛ø‡fl¬ Œ√õ∂±·Ë±˜øıøÒ ¸˜¸…±˚˛ ı˛+¬Û±ôL√ı˛
fl¬Àı˛ ¸˜±Ò±Ú fl¬ı˛± ˚±˚˛º
16.6 ’Ú≈ ˙ œ˘Úœ
1. øÚÀ‰¬ı˛ ˜”˘…¸”‰¬fl¬ ˜…±øÈ¬™' øıø˙©Ü √õ∂ÀÓ¬…fl¬ [œh¬±ı˛ ¸˜¸…±Àfl¬ Δı˛ø‡fl¬ Œ√õ∂±·Ë±˜øıøÒ ¸˜¸…±˚˛ (L.P.P.)
ı˛+¬Û±ôL√ı˛ fl¬èÚ –
(i) B
B1 B2 B3
A1 10 2 5
A A2 1 7 4
A3 6 3 9
(ii) B
B1 B2 B3
A1 2 –2 3
A
A2 –3 5 –1
(iii)
B1 B2
A1 2 4
A2 6 1
2. øÚÀ‰¬ı˛ √õ∂ÀÓ¬…fl¬øÈ¬ [œh¬± ¸˜¸…±Àfl¬ Δı˛ø‡fl¬ Œ√õ∂±·Ë±˜øıøÒ ¸˜¸…±˚˛ ı˛+¬Û±ôL√ı˛ fl¬Àı˛ ¸˜±Ò±Ú fl¬èÚ –
(a) B
B1 B2 B3
A1 2 –2 3
A
A2 –3 5 –1
124
NSOU
(b) B
B1 B2
A1 4 –1
A A2 0 7
A3 5 5
(c) B
B1 B2 B3
A1 1 –1 –1
A A2 –1 –1 3
A3 –1 2 –1
(d) Œ‡À˘±˚˛±h¬ B
B1 B2 B3
A1 10 2 5
Œ‡À˘±˚˛±h¬ A A2 1 7 4
A3 6 3 9
16.7 Î¬◊ M ı˛ ˜ ±˘±

1. (i) B-¤ı˛ ¸˜¸…±
1
‰¬ı˛˜ = Y1 + Y2 + Y3,
l¢
Œ˚‡±ÀÚ 10Y1 + 2Y2 + 5Y3 £ 1
Y1 + 7Y2 + 4Y3 £ 1
6Y1 + 3Y2 + 9Y3 £ 1,
Y1 ³ 0, Y2 ³ 0, Y3 ³ 0 ¤ı— yi = l' Yi (i = 1, 2, 3)
A-ı˛ ¸˜¸…±
1
’ı˜ g ¢ = X1 + X2 + X3,
125
NSOU
Œ˚‡±ÀÚ 10X1 + X2 + 6X3 ³ 1
2X1 + 7X2 + 3X3 ³ 1
5X1 + 4X2 + 9X3 ³ 1,
X1, X2, X3 ³ 0 ¤ı— xi = g' Xi (i = 1, 2, 3)
(ii) √õ∂M ˜…±øÈ¬™À'ı˛ √õ∂ÀÓ¬…fl¬ ¬ÛÀı˛ ¸À/ 4 Œ˚±· fl¬ı˛À˘ B-¤ı˛ ¸˜¸…±øÈ¬ ˝˚˛ñ
1
‰¬ı˛˜ = Y1 + Y2 + Y3,
l¢
Œ˚‡±ÀÚ 6Y1 + 2Y2 + 7Y3 £ 1
Y1 + 9Y2 + 3Y3 £ 1
Y1, Y2, Y3 ³ 0 ¤ı— yi = l' Yi (i = 1, 2, 3)
(iii) B-ı˛ ¸˜¸…±
1
‰¬ı˛˜ = Y1 + Y2,
l¢
Œ˚‡±ÀÚ 2Y1 + 4Y2 £ 1
6Y1 + Y2 £ 1
Y1, Y2, Y3 ³ 0 ¤ı— yi = l' Yi (i = 1, 2)
B-ı˛ ¸˜¸…±
1
’ı˜ g ¢ = X1 + X2
Œ˚‡±ÀÚ 2X1 + 6X2 ³ 1
4X1 + X2 ³ 1
X1 ³ 0, X2 ³ 0 ¤ı— xi = g' Xi (i = 1, 2)
2. (a) AFH 7 , 5 IK ; BFH 2 , 1 , 0IK ; J = 1

12 12 3 3 3
(b) 3
F 2 5I
A øıqX¬ Œfl¬Ã˙˘ A ; BH , K ; J = -1
7 7
(c) AFH 6 , 3 , 4 IK ; BFH 6 , 4 , 3 IK ; J = - 1

13 13 13 13 13 13 13
AF ,
H , IK ; BFH , , IK ; J = -
3 13 1 7 5 1 67
(d) 8 24 12 24 9 72 24
126
NSOU
¸˝±˚˛fl¬ ·Ë]±ıø˘
1. I. G. Chakravorty and P R. Ghosh.
— Linear programming and game theory [Moulik Library]
2. Linear Programming (Methods and Applications)
— Saul I. Gass [McGraw Hill Kogakusha, Ltd.J
3. Linear Programming.
— G. Hadley /A ddison-Wesley Publishing Company]
4. Operations Research
— Kauri Swamp, PK. Gupta, Man Mohan [Sultan Chand and Sons]
5. Linear Programming and Theory of Games. —P M. Karak.
[ABS Publishing House]
127
NSOU

EMT 14 BL 2 PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

EMT 14 BL 2 PDF

Uploaded by

Copyright:

Available Formats

¤ﬂ¬ﬂ¬ 10

¬¤fl¬fl¬ ❑ Δı˛ ø ‡fl¬ Œ√ õ ∂±·Ë ± ˜øıøÒ ¸˜¸…±˚˛ ΔZÓ¬Ó¬± (Duality

10.1 õ∂ô¶∏ ± ıÚ±

am1 x1 + am2 x2 + ............ + amn xn  bm’

a1n v1 + a2n v2 + ............ + amn vm  cn

¤ı˛ ’Ô« x1 ³ 0, x2 ³ 0,............. xn ³ 0

¤ı— LMv OP  LM00OP

’Ô«±» ’ı˜ w = 4v1 + 6v2 + 5v3 – v4,

Œ˚‡±ÀÚ -2v1 - 2v1 + 3v3 ³ -1 U|

Œ˚‡±ÀÚ 2v1 + 2v2 - 3v2 , £ 1 U|

˙Ó«¬¸±À¬ÛÀé¬ 3v1 + 3v2 £ 1, UV

v1 £ 0, v2 ø‰¬˝ê ¸±À¬ÛÀé¬ ’ı±Ò ‰¬˘º

˙Ó«¬¸±À¬ÛÀé¬ v1 ' - v1 '' + 2v2 - 3v3 ³ 7, U|

¤‡Ú v1 ' - v1 '' = v1 ø˘‡À˘ (2) Ú— ¸˜¸…±øÈ¬Àﬂ¬ Œ˘‡± ˚±˚˛,

˙Ó«¬¸±À¬Ûé¬ v1 + 2v2 - 3v3 ³ 7 U|

√õ∂fl¬±˙ fl¬ı˛À˘, ï1ó Ú— ¸˜¸…±øÈ¬Àfl¬ ¤‡Ú Œ˘‡± ˚±˚˛º

¤ı— [ y1 j , y2 j , ................. ymj ]

10.5 ΔZÓ¬Ó¬±¬ Simplex ¤ı— ¬ÛX¬øÓ

Œ˚‡±ÀÚ (z) ’ı˜ = 28 81

10.8 ’Ú≈ ˙ œ˘Úœ

10.8 Î¬◊ M ı˛ ˜ ±˘±

7. x1 = 4, x2 = 7 , x3 = 0 ¤ı— (z)‰¬ı˛˜ = 161 ,

11.1 õ∂ô¶∏ ± ıÚ±

¸˜œﬂ¬ı˛Ì&ø˘ ø¸X¬ (satisfied) ˝˚˛º

O2 c21 c22 c2n a2

Om cm1 cm2 cmn aü

¸˜¸…±øÈ¬Àﬂ¬ L.P.P ø˝¸±Àı ø˘‡À˘ ’±˜ı˛± ¬Û±˝◊,

11.2 ¬Ûøı˛ı˝Ì ¸˜¸…±ı˛ øıÀ˙¯∏ ﬂ¬À˚˛ﬂ¬øÈ¬ Δıø˙©Ü…

xij ³ 0 (i = 1, 2 .......... m; j = 1, 2, .......... n)

¤‡Ú ï1ó Ú— ˙Ó«¬&ø˘ (constraints) ŒÔÀﬂ¬ ’±˜ı˛± ¬Û±˝◊

å MNå x PQ = å b ................. (4)

¤‡Ú ï3ó › ï4ó ŒÔÀﬂ¬ ’±˜ı˛± ¬Û±˝◊

xij  0 (i = 1, 2, .......... m; j = 1, 2, ......... n).

¸≈Ó¬ı˛±— i, j ¤ı˛ ¸ﬂ¬˘ ˜±ÀÚı˛ ÊÚ… ’±˜ı˛± ¬Û±˝◊

11.4 Loop ¤ı˛ Ò±ı˛ Ì ± ¤ı— ¬Ûøı˛ ı ˝Ì ¸˜¸…±ı˛ ¸˜±Ò±ÀÚ ¤ı˛

11.5 Î¬◊  ±˝ı˛ Ì

øÚÀ‰¬ı˛ ¬Ûøı˛ı˝Ì ¸˜¸…±øÈ¬ øıÀı‰¬Ú± ﬂ¬ı˛± ˚±ﬂ¬ †

¤‡±ÀÚ m = 3, n = 4 ¸≈Ó¬ı˛±— Œ˜Ã˘ ‰¬À˘ı˛ ¸—‡…± ¸ı«±øÒﬂ¬ 4 + 3 – 1 = 6 ˝Àıº Ó¬±˝À˘ ¤˝◊

1. øÚÀ‰¬ı˛ √õ∂ÀÓ¬…ﬂ¬ ¬Ûøı˛ı˝Ì ¸˜¸…±Àﬂ¬ L.P.P ø˝¸±Àı ø˘‡≈Ú †

1. (i) ’ı˜ z = 2x11 + x12 + 3x21 + 4x22,

12.1 õ∂ô¶∏ ± ıÚ±

12.2 ¸˜Ó¬±¬Û” Ì « ¬Ûøı˛ ı ˝Ú ¸˜¸…±ı˛ √ õ ∂±ı˛ ø y¬fl¬ Œ˜Ã˘ fl¬±˚« fl ¬ı˛

¸˜±Ò±Ú † ¤‡±ÀÚ, 3ai = 30 + 50 + 20 = 100

¸˜±Ò±Ú † ¤‡±ÀÚ, 3ai = 30 + 40 + 53 = 123

12.4 Î¬◊  ±˝ı˛ Ì

¸˜±Ò±Ú † √õ∂M ¸˜¸…±øÈ¬ ¸˜Ó¬±¬Û”Ì« (balanced) ﬂ¬±ı˛Ì 3ai = 3bj = 30º

¤‡±ÀÚ m + n – 1 = 3 + 4 – 1 = 6 Î¬◊¬ÛÀı˛ı˛ ÂÀﬂ¬ 6øÈ¬ occupied cell ’±ÀÂ ¤ı— ’±˜ı˛±

Œ‡± ˚±ÀBÂ D14 = – 1 < 0

12.5 ’¸˜Ó¬±¬Û” Ì « ¬Ûøı˛ ı ˝Ì ¸˜¸…± (Unbalanced Trans-

quirements) ¬Ûøı˛˜±Ì ¸˜±Ú Ú± ˝˚˛ ’Ô«±» ˚ø åa ¹ åb

titious Î¬◊»¸î˘ ï˚ø å a < åb

¬Ûøı˛˜±Ì Òı˛ÀÓ¬ ˝Àı åa - åb

12.7 ’Ú≈ ˙ œ˘Úœ

3. øÚÀ‰¬ı˛ ¬Ûøı˛ı˝Ì ¸˜¸…±&ø˘ ¸˜±Ò±Ú ﬂ¬èÚ †

12.8 Î¬◊ M ı˛ ˜ ±˘±

13.1 õ∂ô¶∏ ± ıÚ±

13.2 ’±Àı˛ ± ¬Û ¸˜¸…±ı˛ ·±øÌøÓ¬ﬂ¬ ı˛ + ¬ Û (Mathematical for-

’±˜ı˛± ˘é¬… ﬂ¬ı˛øÂ Œ˚ Œ˜±È¬ cost-¤ı˛ ˜±Ú z-Œﬂ¬ Œ˘‡± ˚±˚˛

13.3 ’±Àı˛ ± ¬Û ¸˜¸…±ı˛ ¸˜±Ò±Ú

2,.....m) øÚÌ«˚˛ ﬂ¬ı˛± ˚±˚˛ ˚±ÀÓ¬ å åc

[ ˆ¬±˘ ﬂ¬Àı˛ Œı±Á¬±ı˛ ÊÚ… 13.5 ¤ı˛ Î¬◊±˝ı˛Ì&ø˘ Œ‡≈Ú ]

13.5 Î¬◊  ±˝ı˛ Ì

\ ’±Àı˛±¬Û ¸˜¸…±øÈ¬ı˛ ¸˜±Ò±Ú ˝˘ † A ® I, B ® III, C ® II, D ® IV

am1 x1 + am2 x2 + ............ + amn xn bm’

a1n v1 + a2n v2 + ............ + amn vm cn

¤ı— LMv OP LM00OP

xij 0 (i = 1, 2, .......... m; j = 1, 2, ......... n).