Linearno Programiranje

{\rtf \ansi\ansicpg1252\deff0\viewkind1\margt750\margb620
{\fonttbl{\f11\fswiss\fcharset0 Arial Narrow;}{\f10\fswiss\fcharset0 Arial;}

{\f12\fswiss\fcharset0 Franklin Gothic;}{\f12\fswiss\fcharset0 Verdana;}
{\f20\froman\fcharset0 Times New Roman;}{\f21\froman\fcharset0 Garamond;}
{\f22\froman\fcharset0 Palatino Linotype;}{\f30\fmodern\fcharset0 Courier New;}
{\f31\fmodern\fcharset0 Lucida Console;}{\f40\ftech\fcharset2 Symbol;}
{\f50\fscript\fcharset0 Minion;}{\f60 Haettenschweiler;}}
\pgwsxn11900\pghsxn16840
{\phpg\posx0\pvpg\posy0\absw11900\absh16840 \overlay
{\*\shppict {\pict\jpegblip\picw595 \pich842
\picwgoal11900 \pichgoal16840
\picscalex100 \picscaley100
ffd8ffe000104a46494600010100000100010000ffdb004300010101010101010101010101010101010
10101010101010101010101010101010101010101010101010101010101010101010101010101010101
010101010101ffdb0043010101010101010101010101010101010101010101010101010101010101010
1010101010101010101010101010101010101010101010101010101010101010101ffc0001108034a02
5303012200021101031101ffc4001f00000105010101010101000000000000000001020304050607080
90a0bffc400b5100002010303020403050504040000017d010203000411051221314106135161072271
14328191a1082342b1c11552d1f02433627282090a161718191a25262728292a3435363738393a43444
5464748494a535455565758595a636465666768696a737475767778797a838485868788898a92939495
969798999aa2a3a4a5a6a7a8a9aab2b3b4b5b6b7b8b9bac2c3c4c5c6c7c8c9cad2d3d4d5d6d7d8d9dae
1e2e3e4e5e6e7e8e9eaf1f2f3f4f5f6f7f8f9faffc4001f010003010101010101010101000000000000
0102030405060708090a0bffc400b511000201020404030407050404000102770001020311040521310
61241510761711322328108144291a1b1c109233352f0156272d10a162434e125f11718191a26272829
2a35363738393a434445464748494a535455565758595a636465666768696a737475767778797a82838
485868788898a92939495969798999aa2a3a4a5a6a7a8a9aab2b3b4b5b6b7b8b9bac2c3c4c5c6c7c8c9
cad2d3d4d5d6d7d8d9dae2e3e4e5e6e7e8e9eaf2f3f4f5f6f7f8f9faffda000c03010002110311003f0
0fefe28a28a0028a28a0028a28a0028a28a0028a28a0028a28a0028a28a0028a28a0028a28a0028a28a
0028a28a0028a28a0028a28a0028a28a0028a28a0028a28a0028a28a0028a28a0028a28a0028a28a002
8a28a0028a28a0028a28a0028a28a0028a28a0028a28a0028a28a0028a28a0028a28a0028a28a0028a2
a28a0028a28a0028a28a0028a28a0028a28a0028a28a0028a28a0028a28a0028a28a0028a28a0028a28
28a28a0028a28a0028a28a0028a28a0028a28a0028a28a0028a28a0028a28a0028a28a0028a28a0028a
0028a28a0028a28a0028a28a0028a28a0028a28
a0028a28a0028a28a0028a28a0028a28a0028a28a0028a28a0028a28a00ffd9
}}\par}
{\colortbl;\red0\green0\blue0;\red0\green0\blue64;\red0\green0\blue128;\red0\green0
\blue192;\red0\green0\blue255;\red0\green64\blue0;\red0\green64\blue64;\red0\green6
4\blue128;\red0\green64\blue192;\red0\green64\blue255;\red0\green128\blue0;\red0\gr
een128\blue64;\red0\green128\blue128;\red0\green128\blue192;\red0\green128\blue255;
\red0\green192\blue0;\red0\green192\blue64;\red0\green192\blue128;\red0\green192\bl
ue192;\red0\green192\blue255;\red0\green255\blue0;\red0\green255\blue64;\red0\green
255\blue128;\red0\green255\blue192;\red0\green255\blue255;\red64\green0\blue0;\red6
4\green0\blue64;\red64\green0\blue128;\red64\green0\blue192;\red64\green0\blue255;\
red64\green64\blue0;\red64\green64\blue64;\red64\green64\blue128;\red64\green64\blu
e192;\red64\green64\blue255;\red64\green128\blue0;\red64\green128\blue64;\red64\gre
en128\blue128;\red64\green128\blue192;\red64\green128\blue255;\red64\green192\blue0
;\red64\green192\blue64;\red64\green192\blue128;\red64\green192\blue192;\red64\gree
n192\blue255;\red64\green255\blue0;\red64\green255\blue64;\red64\green255\blue128;\
red64\green255\blue192;\red64\green255\blue255;\red128\green0\blue0;\red128\green0\
blue64;\red128\green0\blue128;\red128\green0\blue192;\red128\green0\blue255;\red128
\green64\blue0;\red128\green64\blue64;\red128\green64\blue128;\red128\green64\blue1
92;\red128\green64\blue255;\red128\green128\blue0;\red128\green128\blue64;\red128\g
reen128\blue128;\red128\green128\blue192;\red128\green128\blue255;\red128\green192\
blue0;\red128\green192\blue64;\red128\green192\blue128;\red128\green192\blue192;\re
d128\green192\blue255;\red128\green255\blue0;\red128\green255\blue64;\red128\green2
55\blue128;\red128\green255\blue192;\red128\green255\blue255;\red192\green0\blue0;\
red192\green0\blue64;\red192\green0\blue128;\red192\green0\blue192;\red192\green0\b
lue255;\red192\green64\blue0;\red192\green64\blue64;\red192\green64\blue128;\red192
\green64\blue192;\red192\green64\blue255;\red192\green128\blue0;\red192\green128\bl
ue64;\red192\green128\blue128;\red192\green128\blue192;\red192\green128\blue255;\re
d192\green192\blue0;\red192\green192\blue64;\red192\green192\blue128;\red192\green1
92\blue192;\red192\green192\blue255;\red192\green255\blue0;\red192\green255\blue64;
\red192\green255\blue128;\red192\green255\blue192;\red192\green255\blue255;\red255\
green0\blue0;\red255\green0\blue64;\red255\green0\blue128;\red255\green0\blue192;\r
ed255\green0\blue255;\red255\green64\blue0;\red255\green64\blue64;\red255\green64\b
lue128;\red255\green64\blue192;\red255\green64\blue255;\red255\green128\blue0;\red2
55\green128\blue64;\red255\green128\blue128;\red255\green128\blue192;\red255\green1
28\blue255;\red255\green192\blue0;\red255\green192\blue64;\red255\green192\blue128;
\red255\green192\blue192;\red255\green192\blue255;\red255\green255\blue0;\red255\gr
een255\blue64;\red255\green255\blue128;\red255\green255\blue192;\red255\green255\bl
ue255;}
{\phpg\posx1156\pvpg\posy2357\absw7756\absh2451 \f10 \fs44 \cf0 \f10 \fs44 \cf0
Glava 2
\par}{\phpg\posx1156\pvpg\posy2357\absw7756\absh2451 \sl-498 \par\f10 \fs44 \cf0
LINEARNO PROGRAMIRANJE
{\fs31 2.1}{\fs31 Op{\f63 \u353\'3f}ti}{\fs31 zadatak}{\fs31 linearnog}{\fs31
programiranja }\par
}
Op{\f63 \u353\'3f}ti zadatak linaearnog programiranja glasi: Na{\f63 \u263\'3f}i
ono nenegativno re{\f63 \u353\'3f}enje{\i \f50 X}{\f20 =}{\f20 (}{\i \f50 x}
{\dn006 \f20 \fs14 1}{\i \f50 ,x}{\dn006 \f20 \fs14 2}{\i \f50 ,...,x}
{\i\dn006 \f50 \fs14 n}{\f20 )(}{\i \f50 x}{\i\dn006 \f50 \fs14 i}{\f40
{\field{\*\fldinst SYMBOL 179 \\f Symbol }} }
\par}{\phpg\posx1156\pvpg\posy5337\absw10456\absh9383 \sl-253 \f10 \fs21 \cf0 {\f20
0}{\i \f50 ,i}{\f20 =}{\f20 1}{\i \f50 ,}{\f20 2}{\i \f50 ,...,n}{\f20 )}
sistema linearnih jedna{\f63 \u269\'3f}ina (ograni{\f63 \u269\'3f}enja):
\par}{\phpg\posx1156\pvpg\posy5337\absw10456\absh9383 \sl-275 \par\f10 \fs21
\cf0 \fi3047 {\i \f50 a}{\i \f50 x}{\f20 +}{\i \f50 a}{\i \f50 x}{\f20
+}{\f40 ��}{\f20 +}{\i \f50 a}{\i \f50 x}{\f40 {\field{\*\fldinst SYMBOL
163 \\f Symbol }}}{\i \f50 b}{\dn006 \f20 \fs14 1 }
\par}{\phpg\posx1156\pvpg\posy5337\absw10456\absh9383 \sl-288 \f10 \fs21 \cf0
\fi3047 {\i \f50 a}{\i \f50 x}{\f20 +}{\i \f50 a}{\i \f50 x}{\f20 +}
{\f40 ��}{\f20 +}{\i \f50 a}{\i \f50 x}{\f40 {\field{\*\fldinst SYMBOL
163 \\f Symbol }}}{\i \f50 b}{\dn006 \f20 \fs14 2 }
\fi3281 ... . .. .{\i \f50 ..} ...
\fi3047 {\i \f50 a }{\i\dn006 \f50 \fs14 m}{\dn006 \f20 \fs14 1}{\i \f50 x}{\dn006
\f20 \fs14 1}{\f20 +}{\i \f50 a }{\i\dn006 \f50 \fs14 m}{\dn006 \f20 \fs14 2}
{\i \f50 x}{\dn006 \f20 \fs14 2}{\f20 +}{\f40 ��}{\f20 +}{\i \f50 a}{\i \f50
x}{\f40 {\field{\*\fldinst SYMBOL 163 \\f Symbol }}}{\i \f50 b}{\i\dn006
\f50 \fs14 m }
\par}{\phpg\posx1156\pvpg\posy5337\absw10456\absh9383 \sl-419 \f10 \fs21 \cf0 za
koje funkcija cilja (linearna funkcija promenljivih{\i \f50 x}{\dn006 \f20 \fs14
1}{\i \f50 ,x}{\dn006 \f20 \fs14 2}{\i \f50 ,...,x}{\i\dn006 \f50 \fs14 n}):
\cf0 \fi2341 {\i \f50 F}{\f20 =}{\i \f50 F}{\f20 (}{\i \f50 x}{\dn006 \f20
\fs14 1}{\i \f50 ,x}{\dn006 \f20 \fs14 2}{\i \f50 ,...,x}{\i\dn006 \f50 \fs14 n}
{\f20 )}{\f20 =}{\i \f50 c}{\dn006 \f20 \fs14 1}{\i \f50 x}{\dn006 \f20 \fs14
1}{\f20 +}{\i \f50 c}{\dn006 \f20 \fs14 2}{\i \f50 x}{\dn006 \f20 \fs14 2}{\f20
+}{\i \f50 ...}{\f20 +}{\i \f50 c}{\i \f50 x }
dosto{\f63 \u382\'3f}e maksimalnu (minimalnu) vrednost.
\fi351 Svako nenegativno re{\f63 \u353\'3f}enje sistema nejedna{\f63 \u269\'3f}ina
nazivamo dopustivim re{\f63 \u353\'3f}enjem.
\fi351 Sa{\i \f50 D} ozna{\f63 \u269\'3f}avamo skup svih dopustivih re{\f63
\u353\'3f}enja zadatka.
Teorema 2.1.1 Dati kriterijum optimizacije mo{\f63 \u382\'3f}e da se zameni
suprotnim, pri {\f63 \u269\'3f}emu ta za-
\par}{\phpg\posx1156\pvpg\posy5337\absw10456\absh9383 \sl-288 \f10 \fs21 \cf0 mena
ne uti{\f63 \u269\'3f}e na optimalno re{\f63 \u353\'3f}enje, tj. ako je za{\i \f50
X}{\up006 \f20 \fs14 0}{\f40 {\field{\*\fldinst SYMBOL 206 \\f Symbol }}}{\i \f50
D} ispunjeno
\cf0 \fi3797 {\i \f50 F}{\f20 (}{\i \f50 X}{\up006 \f20 \fs14 0}{\f20 )}{\f20 =}
{\f20 max}{\i \f50 F}{\f20 (}{\i \f50 X}{\f20 ) }
\fi4799 {\i \f50 \fs14 X}{\f40 \fs14 {\field{\*\fldinst SYMBOL 206 \\f Symbol }}}
{\i \f50 \fs14 D }
onda je
\fi3579 {\f40 {\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\i \f50 F}{\f20 (}{\i
\f50 X}{\up006 \f20 \fs14 0}{\f20 )}{\f20 =}{\f20 min}{\f20 [}{\f40
{\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\i \f50 F}{\f20 (}{\i \f50 X}
{\f20 )] }
\fi4754 {\i \f50 \fs14 X}{\f40 \fs14 {\field{\*\fldinst SYMBOL 206 \\f Symbol }}}
{\i \f50 \fs14 D }
\cf0 \fi351 Za zadatak linearnog programiranja ka{\f63 \u382\'3f}emo da je dat u
kanoni{\f63 \u269\'3f}kom obliku ako je sistem
ograni{\f63 \u269\'3f}enja dat u obliku jednakosti.
\fi351 Prevo{\f63 \u273\'3f}enje sistema nejedna{\f63 \u269\'3f}ina u sistem
JEDNA{\f63 \u268\'3f}INA.
\fi351 Matri{\f63 \u269\'3f}na reprezenatacija problema.
Teorema 2.1.2 Skup dopustivih re{\f63 \u353\'3f}enja zadatka linearnog
programiranja je konveksan skup.
\par}{\phpg\posx1156\pvpg\posy5337\absw10456\absh9383 \sl-288 \f10 \fs21 \cf0 Takav
skup u{\i \f50 R}{\i\up006 \f50 \fs14 n} naziva se konveksni polijedar.
Teorema 2.1.3 Ako je oblast dopustivih re{\f63 \u353\'3f}enja{\i \f50 D} zadatka
linearnog programiranja ograni{\f63 \u269\'3f}ena,
\par}{\phpg\posx1156\pvpg\posy5337\absw10456\absh9383 \sl-288 \f10 \fs21 \cf0 tada
se maksimum i minimum funkcije cilja dobija u jednoj ekstremnoj ta{\f63
\u269\'3f}ki na granici obalsti
{\i \f50 D}.
\cf0 \fi4760 1 \par
}
{\phpg\posx4326\pvpg\posy6246\absw1233\absh150 \f20 \fs14 \cf0 \f20 \fs14 \cf0 11
1 12 2 \par
}
1{\i \f50 n}{\i \f50 n }\par
}
1 \par
}
2 \par
}
2{\i \f50 n}{\i \f50 n }\par
}
{\phpg\posx6660\pvpg\posy7212\absw498\absh150 \i \f50 \fs14 \cf0 \i \f50 \fs14 \cf0
mn n \par
}
n n \par
}
\sect\sectd\pard\plain
ffd8ffe000104a46494600010100000100010000ffdb004300010101010101010101010101010101010
10101010101010101010101010101010101010101010101010101010101010101010101010101010101
010101010101ffdb0043010101010101010101010101010101010101010101010101010101010101010
1010101010101010101010101010101010101010101010101010101010101010101ffc0001108034a02
5303012200021101031101ffc4001f00000105010101010101000000000000000001020304050607080
90a0bffc400b5100002010303020403050504040000017d010203000411051221314106135161072271
14328191a1082342b1c11552d1f02433627282090a161718191a25262728292a3435363738393a43444
5464748494a535455565758595a636465666768696a737475767778797a838485868788898a92939495
0102030405060708090a0bffc400b511000201020404030407050404000102770001020311040521310
61241510761711322328108144291a1b1c109233352f0156272d10a162434e125f11718191a26272829
2a35363738393a434445464748494a535455565758595a636465666768696a737475767778797a82838
0028a28a0028a28a0028a28a0028a28a0028a28
}}\par}{\phpg\posx1156\pvpg\posy345\absw165\absh225 \f10 \fs21 \cf0 \f10 \fs21 \cf0
2 \par
}
{\phpg\posx1507\pvpg\posy345\absw9286\absh1317 \f10 \fs21 \cf0 \fi4551 \f10
\fs21 \cf0 GLAVA 2. LINEARNO PROGRAMIRANJE
Zadatak 1. Dat je zadatak linearnog programiranja u op{\f63 \u353\'3f}tem obliku:
Maksimizirati:{\i \f50 F}{\f20 =}{\f20 2}{\i \f50 x}{\dn006 \f20 \fs14 1}
{\f20 +}{\f20 5}{\i \f50 x}{\dn006 \f20 \fs14 2 }
\par}{\phpg\posx1507\pvpg\posy345\absw9286\absh1317 \sl-252 \f10 \fs21 \cf0 pod
ograni{\f63 \u269\'3f}enjima \par
}
x{\i0\dn006 \f20 \fs14 1}{\i0 \f20 +}{\i0 \f20 4}x{\i0\dn006 \f20 \fs14 2 }
\par}{\phpg\posx5487\pvpg\posy2069\absw881\absh776 \sl-289 \i \f50 \fs21 \cf0
{\i0 \f20 2}x{\i0\dn006 \f20 \fs14 1}{\i0 \f20 +} x{\i0\dn006 \f20 \fs14 2 }
\fi117 x{\i0\dn006 \f20 \fs14 1}{\i0 \f20 +} x{\i0\dn006 \f20 \fs14 2 }\par
}
{\field{\*\fldinst SYMBOL 163 \\f Symbol }}{\f20 24 }
{\field{\*\fldinst SYMBOL 163 \\f Symbol }}{\f20 9 }\par
}
{\phpg\posx1156\pvpg\posy2936\absw10307\absh3981 \i \f50 \fs21 \cf0 \fi3760 \i \f50
\fs21 \cf0 x{\i0\dn006 \f20 \fs14 1}{\i0 \f40 {\field{\*\fldinst SYMBOL 179 \\f
Symbol }}}{\i0 \f20 0},x{\i0\dn006 \f20 \fs14 2}{\i0 \f40 {\field{\*\fldinst
SYMBOL 179 \\f Symbol }}}{\i0 \f20 0 }
\par}{\phpg\posx1156\pvpg\posy2936\absw10307\absh3981 \sl-329 \par\i \f50 \fs21
\cf0 {\i0 \f10 \fs31 2.2}{\i0 \f10 \fs31 Konveksni}{\i0 \f10 \fs31 skupovi }
\cf0 {\i0 \f10 \fs31 2.3}{\i0 \f10 \fs31 Geometrijsko}{\i0 \f10 \fs31
re{\f63 \u353\'3f}enje}{\i0 \f10 \fs31 zadatka}{\i0 \f10 \fs31 LP}{\i0 \f10 \fs31
(slu{\f63 \u269\'3f}aj}{\fs31 n}{\i0 \f20 \fs31 =}{\i0 \f20 \fs31 2}{\i0 \f10
\fs31 ) }
\cf0 {\i0 \f10 Geometrijska}{\i0 \f10 metoda,}{\i0 \f10 za}{\i0 \f10 razliku}
{\i0 \f10 od}{\i0 \f10 algebarske}{\i0 \f10 (simpleks)}{\i0 \f10 metode}
{\i0 \f10 ima}{\i0 \f10 ograni{\f63 \u269\'3f}enu}{\i0 \f10 primenu. }
{\i0 \f10 Ona}{\i0 \f10 mo{\f63 \u382\'3f}e}{\i0 \f10 da}{\i0 \f10 se}{\i0 \f10
iskoristi}{\i0 \f10 u}{\i0 \f10 slu{\f63 \u269\'3f}aju}{\i0 \f10 dve}{\i0 \f10
ili}{\i0 \f10 tri}{\i0 \f10 promenljive.}{\i0 \f10 Ova}{\i0 \f10 metoda}
{\i0 \f10 se}{\i0 \f10 mo{\f63 \u382\'3f}e}{\i0 \f10 primeniti}{\i0 \f10 i}{\i0
\f10 u }
{\i0 \f10 slu{\f63 \u269\'3f}aju}{\i0 \f10 ako}{\i0 \f10 je} n{\i0 \f40
{\field{\*\fldinst SYMBOL 45 \\f Symbol }}} m{\i0 \f20 =}{\i0 \f20 2}{\i0 \f10 ,}
{\i0 \f10 gde}{\i0 \f10 je} n{\i0 \f10 broj}{\i0 \f10 promenljivih,}{\i0 \f10
a} m{\i0 \f10 broj}{\i0 \f10 jedna{\f63 \u269\'3f}ina. }
\cf0 \fi351 {\i0 \f10 Zadatak}{\i0 \f10 1. }
\fi351 {\i0 \f10 Prona{\f63 \u263\'3f}i}{\i0 \f10 maksimalnu}{\i0 \f10 vrednost}
{\i0 \f10 funkcije}{\i0 \f10 kriterijuma: }
\cf0 \fi3712 Z{\i0 \f20 (}x{\i0\dn006 \f20 \fs14 1},x{\i0\dn006 \f20 \fs14 2}
{\i0 \f20 )}{\i0 \f20 =}{\i0 \f20 2}x{\i0\dn006 \f20 \fs14 1}{\i0 \f20 +}
{\i0 \f20 3}x{\i0 \f20 \fs14 2 }
{\i0 \f10 uz}{\i0 \f10 ograni{\f63 \u269\'3f}enja: }\par
}
{\phpg\posx4916\pvpg\posy7377\absw1453\absh1056 \i \f50 \fs21 \cf0 \fi571 \i
\f50 \fs21 \cf0 x{\i0\dn006 \f20 \fs14 1}{\i0 \f20 +}{\i0 \f20 2}x{\i0\dn006 \f20
\fs14 2 }
\fi502 {\i0 \f40 {\field{\*\fldinst SYMBOL 45 \\f Symbol }}}x{\i0\dn006 \f20 \fs14
1}{\i0 \f20 +} x{\i0\dn006 \f20 \fs14 2 }
\fi571 {\i0 \f20 3}x{\i0\dn006 \f20 \fs14 1}{\i0 \f20 +} x{\i0\dn006 \f20 \fs14 2
}
x{\i0\dn006 \f20 \fs14 1}{\i0 \f40 {\field{\*\fldinst SYMBOL 179 \\f Symbol }}}
{\i0 \f20 0},x{\i0\dn006 \f20 \fs14 2}{\i0 \f40 {\field{\*\fldinst SYMBOL
179 \\f Symbol }}}{\i0 \f20 0 }\par
}
}
\fs21 \cf0 Zadatak 2.
\par}{\phpg\posx1156\pvpg\posy8817\absw5917\absh1314 \sl-288 \f10 \fs21 \cf0 \fi351
Prona{\f63 \u263\'3f}i maksimalnu vrednost funkcije kriterijuma:
\fi3710 {\i \f50 Z}{\f20 (}{\i \f50 x}{\dn006 \f20 \fs14 1}{\i \f50 ,x}{\dn006
\f20 \fs14 2}{\f20 )}{\f20 =}{\f20 3}{\i \f50 x}{\dn006 \f20 \fs14 1}{\f40
{\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\f20 2}{\i \f50 x}{\f20 \fs14 2 }
\par}{\phpg\posx1156\pvpg\posy8817\absw5917\absh1314 \sl-424 \f10 \fs21 \cf0 uz
ograni{\f63 \u269\'3f}enja: \par
}
\fs21 \cf0 2{\i \f50 x}{\dn006 \fs14 1} +{\i \f50 x}{\dn006 \fs14 2 }
\fi385 {\f40 {\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\i \f50 x}{\dn006 \fs14
1} + 3{\i \f50 x}{\dn006 \fs14 2 }
\fi502 {\f40 {\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\i \f50 x}{\dn006 \fs14
1} +{\i \f50 x}{\dn006 \fs14 2 }
\fi688 {\i \f50 x}{\dn006 \fs14 1} +{\i \f50 x}{\dn006 \fs14 2 }
{\i \f50 x}{\dn006 \fs14 1}{\f40 {\field{\*\fldinst SYMBOL 179 \\f Symbol }}}
0{\i \f50 ,x}{\dn006 \fs14 2}{\f40 {\field{\*\fldinst SYMBOL 179 \\f Symbol }}} 0
\par
}
}
\fs21 \cf0 Zadatak 3.
\fi351 Prona{\f63 \u263\'3f}i minimalnu vrednost funkcije kriterijuma:
\cf0 \fi3829 {\i \f50 Z}{\f20 (}{\i \f50 x}{\dn006 \f20 \fs14 1}{\i \f50 ,x}
{\dn006 \f20 \fs14 2}{\f20 )}{\f20 =}{\i \f50 x}{\dn006 \f20 \fs14 1}{\f20 +}
{\i \f50 x}{\f20 \fs14 2 }
}
\fs21 \cf0 2{\i \f50 x}{\dn006 \fs14 1} +{\i \f50 x}{\dn006 \fs14 2 }
\fi185 2{\i \f50 x}{\dn006 \fs14 1} +{\i \f50 x}{\dn006 \fs14 2 }
{\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\i \f50 x}{\dn006 \fs14 1} + 3{\i \f50
x}{\dn006 \fs14 2 }
\fi819 {\i \f50 x}{\dn006 \fs14 1 }
\fi819 {\i \f50 x}{\dn006 \fs14 2 }
\fi819 {\i \f50 x}{\dn006 \fs14 2 }\par
}
}
ffd8ffe000104a46494600010100000100010000ffdb004300010101010101010101010101010101010
10101010101010101010101010101010101010101010101010101010101010101010101010101010101
010101010101ffdb0043010101010101010101010101010101010101010101010101010101010101010
1010101010101010101010101010101010101010101010101010101010101010101ffc0001108034a02
5303012200021101031101ffc4001f00000105010101010101000000000000000001020304050607080
90a0bffc400b5100002010303020403050504040000017d010203000411051221314106135161072271
14328191a1082342b1c11552d1f02433627282090a161718191a25262728292a3435363738393a43444
5464748494a535455565758595a636465666768696a737475767778797a838485868788898a92939495
0102030405060708090a0bffc400b511000201020404030407050404000102770001020311040521310
61241510761711322328108144291a1b1c109233352f0156272d10a162434e125f11718191a26272829
2a35363738393a434445464748494a535455565758595a636465666768696a737475767778797a82838
0028a28a0028a28a0028a28a0028a28a0028a28
}}\par}{\phpg\posx1156\pvpg\posy345\absw7172\absh797 \f10 \fs21 \cf0 \f10 \fs21
\cf0 2.3. GEOMETRIJSKO RE{\f63 \u352\'3f}ENJE ZADATKA LP (SLU{\f63
\u268\'3f}AJ{\i \f50 N}{\f20 =}{\f20 2})
\fi351 Zadatak 4. \par
}
\par
}
\fs21 \cf0 Jedna fabrika proizvodi grejalice i usisiva{\f63 \u269\'3f}e. Za
proizvodnju jedne grejalice potrebno je 2
\par}{\phpg\posx1156\pvpg\posy1269\absw10304\absh3671 \sl-288 \f10 \fs21 \cf0 sata
rada za proizvodnju delova i 1 sat rada za sklapanje i proveru. Za proizvodnju
usisiva{\f63 \u269\'3f}a
potreban je 1 sat rada za proizvodnju delova i 2 sata za sklapanje i proveru. Deo
fabrike gde se
proizvode ovi aparati mo{\f63 \u382\'3f}e da radi najvi{\f63 \u353\'3f}e 8 sati
dnevno, dok deo fabrike za sklapanje i proveru
mo{\f63 \u382\'3f}e da radi najvi{\f63 \u353\'3f}e 10 sati dnevno. Ako je zarada
od prodaje za svaku grejalicu 30 din. i za
\par}{\phpg\posx1156\pvpg\posy1269\absw10304\absh3671 \sl-288 \f10 \fs21 \cf0 svaki
usisiva{\f63 \u269\'3f} 50 din koliko grejalica i usisiva{\f63 \u269\'3f}a treba
proizvoditi da bi zarada bila maksimalna?
\cf0 \fi351 Zadatak 5. (Post-optimalna analiza)
\fi351 Firma proizvodi dve vrste boja: za unutra{\f63 \u353\'3f}nje (U) i za
spolja{\f63 \u353\'3f}nje (S) radove. Proizvedene
koli{\f63 \u269\'3f}ine boja firma isporu{\f63 \u269\'3f}uje trgovini na veliko. Za
proizvodnju ovih boja koriste se sirovine{\i \f50 A }
i{\i \f50 B}. Maksimalno mogu{\f63 \u263\'3f}e dnevne zalihe sirovina{\i \f50 A}
i{\i \f50 B} iznose respektivno 6 i 8 tona. Utro{\f63 \u353\'3f}ak
sirovina{\i \f50 A} i{\i \f50 B} u tonama za proizvodnju jedne tone svake od boja
iznosi:
\cf0 \fi470 Sirovine Utro{\f63 \u353\'3f}ak sirovina u t. Maksimalne zalihe
\fi1529 boja S boja U \par
}
{\phpg\posx1627\pvpg\posy5394\absw201\absh493 \f10 \fs21 \cf0 \f10 \fs21 \cf0 A
\par}{\phpg\posx1627\pvpg\posy5394\absw201\absh493 \sl-296 \f10 \fs21 \cf0 B \par
}
\par}{\phpg\posx2685\pvpg\posy5394\absw165\absh493 \sl-296 \f10 \fs21 \cf0 2 \par
}
}
}
\fs21 \cf0 Analiza tr{\f63 \u382\'3f}i{\f63 \u353\'3f}ta u du{\f63 \u382\'3f}em
periodu pokazuje da dnevna potra{\f63 \u382\'3f}nja boje{\i \f50 U} nikada ne
prema{\f63 \u353\'3f}uje
potra{\f63 \u382\'3f}nju boje{\i \f50 S} vi{\f63 \u353\'3f}e od jedne tone.
Tako{\f63 \u273\'3f}e je uo{\f63 \u269\'3f}eno da dnevna potra{\f63 \u382\'3f}nja
boje{\i \f50 U} nikada ne
prelazi 2 tone dnevno.
\fi351 Cene jedne tone boja jednake su: 3 hiljade dinara za jednu tonu boje{\i
\f50 S} i 2 hiljade dinara
\par}{\phpg\posx1156\pvpg\posy6153\absw10551\absh7580 \sl-288 \f10 \fs21 \cf0 za
jednu tonu boje{\i \f50 U}. Koje koli{\f63 \u269\'3f}ine boja (u tonama) treba
da proizvede firma, tako da se
realizacijom proizvodnje ostvari maksimalna zarada?
\cf0 \fi351 Re{\f63 \u353\'3f}enje:
\cf0 \fi351 Prvi zadatak analize osteljivosti: uticaj promena koli{\f63
\u269\'3f}ine sirovina na optimalno re{\f63 \u353\'3f}enje.
\fi351 1) Za koliko mogu da se uve{\f63 \u263\'3f}aju zalihe sirovina{\i \f50 A}
ili{\i \f50 B} da bi se pobolj{\f63 \u353\'3f}alo optimalno re{\f63
\u353\'3f}enje?
\fi351 2) Za koliko mogu da se smanje zalihe neke sirovine a da se
zadr{\f63 \u382\'3f}i dobijeno optimalno
re{\f63 \u353\'3f}enje?
\cf0 \fi351 - Aktivna i neaktivna ograni{\f63 \u269\'3f}enja. Prava koja
predstavlja aktivno ograni{\f63 \u269\'3f}enje prolazi kroz
optimalnu ta{\f63 \u269\'3f}ku. Prava koja ne prolazi kroz optimalnu ta{\f63
\u269\'3f}ku predstavlja neaktivno ograni{\f63 \u269\'3f}enje.
\par}{\phpg\posx1156\pvpg\posy6153\absw10551\absh7580 \sl-288 \f10 \fs21 \cf0 Ako
je neko ograni{\f63 \u269\'3f}enje aktivno, onda je logi{\f63 \u269\'3f}no da se
taj resurs proglasi i deficitarnnim, jer se
\par}{\phpg\posx1156\pvpg\posy6153\absw10551\absh7580 \sl-288 \f10 \fs21 \cf0 u
potpunosti koristi u proizvodnji. Resurs kome odgovara neaktivno ograni{\f63
\u269\'3f}enje je nedeficitarni
resurs, jer se po realizaciji proizvodnje ne utro{\f63 \u353\'3f}e sve njegove
zalihe.
\fi351 Pri analizi osetljivosti modela u odnosu na promene desnih strana
ograni{\f63 \u269\'3f}enja odra{\f63 \u273\'3f}ujemo:
\fi351 - Grani{\f63 \u269\'3f}no dopustivo uve{\f63 \u263\'3f}anje zaliha
deficitarnog resursa, koje {\f63 \u263\'3f}e omogu{\f63 \u263\'3f}iti
pobolj{\f63 \u353\'3f}anje
optimalnog re{\f63 \u353\'3f}enja
\fi351 - Grani{\f63 \u269\'3f}no dopustivo smanjenje zaliha nedeficitarnog resursa,
koje ne{\f63 \u263\'3f}e izmeniti optimalnu
vrednost funkcije cilja.
\cf0 \fi351 Drugi zadatak analize osetljivosti: Koji je resurs najpogodnije
uve{\f63 \u263\'3f}ati?
\cf0 \fi351 Dopuna resursa zahteva dodatno ulaganje novca, pa je prirodno
postaviti pitanje: Kom
resursu dati prednost u ulaganju dodatnih sredstava?
\fi351 Uvodimo karakteristiku zna{\f63 \u269\'3f}ajnosti svake dodatne jedinice
deficitarnog resursa. Ozna{\f63 \u269\'3f}imo
\par}{\phpg\posx1156\pvpg\posy6153\absw10551\absh7580 \sl-324 \f10 \fs21 \cf0 sa{\i
\f50 y }{\i\dn006 \f50 \fs14 i} tu karakteristiku za resurs{\i \f50 i}: \par
}
{\phpg\posx3277\pvpg\posy14823\absw165\absh225 \i \f50 \fs21 \cf0 \i \f50 \fs21
\cf0 y \par
}
\cf0 i{\i0 \f20 \fs21 = }\par
}
\fs21 \cf0 maksimalni prira{\f63 \u353\'3f}taj optimalne vrednosti{\i \f50 Z }
maksimalno dopustivi prira{\f63 \u353\'3f}taj obima resursa{\i \f50 i }\par
}
ffd8ffe000104a46494600010100000100010000ffdb004300010101010101010101010101010101010
10101010101010101010101010101010101010101010101010101010101010101010101010101010101
010101010101ffdb0043010101010101010101010101010101010101010101010101010101010101010
1010101010101010101010101010101010101010101010101010101010101010101ffc0001108034a02
5303012200021101031101ffc4001f00000105010101010101000000000000000001020304050607080
90a0bffc400b5100002010303020403050504040000017d010203000411051221314106135161072271
14328191a1082342b1c11552d1f02433627282090a161718191a25262728292a3435363738393a43444
5464748494a535455565758595a636465666768696a737475767778797a838485868788898a92939495
0102030405060708090a0bffc400b511000201020404030407050404000102770001020311040521310
61241510761711322328108144291a1b1c109233352f0156272d10a162434e125f11718191a26272829
2a35363738393a434445464748494a535455565758595a636465666768696a737475767778797a82838
0028a28a0028a28a0028a28a0028a28a0028a28
4 \par
}
{\phpg\posx1507\pvpg\posy345\absw9874\absh797 \f10 \fs21 \cf0 \fi4551 \f10 \fs21
\cf0 GLAVA 2. LINEARNO PROGRAMIRANJE
Tre{\f63 \u263\'3f}i zadatak analize osetljivosti: U kojim granicama je dopustiva
promena koeficijenata \par
}
funkcije cilja?
\cf0 \fi351 - Za koliko se mo{\f63 \u382\'3f}e umanjiti ili uve{\f63 \u263\'3f}ati
svaki od koeficijenata, a da ne do{\f63 \u273\'3f}e do promene
optimalnog re{\f63 \u353\'3f}enja?
\fi351 - Kako promeniti neki od koeficijenata funkcije cilja da nedeficitarni
resurs postane defici-
\par}{\phpg\posx1156\pvpg\posy1269\absw10392\absh2922 \sl-289 \f10 \fs21 \cf0 tarni
i obratno, da deficitarni postane nedeficitarni?
\cf0 \fi351 Zadatak 6. (Beskona{\f63 \u269\'3f}no mnogo re{\f63 \u353\'3f}enja)
\fi351 Prona{\f63 \u263\'3f}i maksimalnu vrednost funkcije kriterijuma:
\cf0 \fi3712 {\i \f50 Z}{\f20 (}{\i \f50 x}{\dn006 \f20 \fs14 1}{\i \f50 ,x}
{\dn006 \f20 \fs14 2}{\f20 )}{\f20 =}{\f20 2}{\i \f50 x}{\dn006 \f20 \fs14 1}
{\f20 +}{\f20 4}{\i \f50 x}{\f20 \fs14 2 }
}
x{\i0\dn006 \f20 \fs14 1}{\i0 \f20 +}{\i0 \f20 2}x{\i0\dn006 \f20 \fs14 2 }
}
}
\f50 \fs21 \cf0 x{\i0\dn006 \f20 \fs14 1}{\i0 \f40 {\field{\*\fldinst SYMBOL
179 \\f Symbol }}}{\i0 \f20 0},x{\i0\dn006 \f20 \fs14 2}{\i0 \f40
{\field{\*\fldinst SYMBOL 179 \\f Symbol }}}{\i0 \f20 0 }
\par}{\phpg\posx1156\pvpg\posy5112\absw5856\absh1792 \sl-266 \par\i \f50 \fs21 \cf0
\fi351 {\i0 \f10 Zadatak}{\i0 \f10 7.}{\i0 \f10 (Neograni{\f63 \u269\'3f}ena}
{\i0 \f10 funkcija}{\i0 \f10 cilja) }
\fi351 {\i0 \f10 Prona{\f63 \u263\'3f}i}{\i0 \f10 maksimalnu}{\i0 \f10 vrednost}
{\i0 \f10 funkcije}{\i0 \f10 kriterijuma: }
\fi3771 Z{\i0 \f20 (}x{\i0\dn006 \f20 \fs14 1},x{\i0\dn006 \f20 \fs14 2}{\i0
\f20 )}{\i0 \f20 =}{\i0 \f20 2}x{\i0\dn006 \f20 \fs14 1}{\i0 \f20 +} x{\i0 \f20
\fs14 2 }
{\i0 \f10 uz}{\i0 \f10 ograni{\f63 \u269\'3f}enja: }\par
}
\cf0 2{\i \f50 x}{\dn006 \fs14 1}{\f40 {\field{\*\fldinst SYMBOL 45 \\f
Symbol }}}{\i \f50 x}{\dn006 \fs14 2 }
{\i \f50 x}{\dn006 \fs14 1}{\f40 {\field{\*\fldinst SYMBOL 163 \\f Symbol }}} 4
\par}{\phpg\posx4975\pvpg\posy7121\absw1449\absh796 \sl-288 \f20 \fs21 \cf0 {\i
\f50 x}{\dn006 \fs14 1}{\f40 {\field{\*\fldinst SYMBOL 179 \\f Symbol }}} 0{\i
\f50 ,x}{\dn006 \fs14 2}{\f40 {\field{\*\fldinst SYMBOL 179 \\f Symbol }}} 0 \par
}
}
2.4 Geometrijsko re{\f63 \u353\'3f}enje zadatka LP (slu{\f63 \u269\'3f}aj{\i
\f50 n}{\f40 {\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\i \f50 m}{\f20 =}
{\f20 2})
{\fs21 Zadatak}{\fs21 LP}{\fs21 se}{\fs21 mo{\f63 \u382\'3f}e}{\fs21 grafi{\f63
\u269\'3f}ki}{\fs21 re{\f63 \u353\'3f}iti}{\fs21 i}{\fs21 u}{\fs21 slu{\f63
\u269\'3f}aju}{\fs21 kada}{\fs21 je}{\fs21 broj}{\fs21 promenljivih}{\fs21 za}
{\fs21 dva}{\fs21 ve{\f63 \u263\'3f}i}{\fs21 od}{\fs21 broja }
{\fs21 nezavisnih}{\fs21 linearnih}{\fs21 ograni{\f63 \u269\'3f}enja.}{\fs21
Tada}{\fs21 se}{\fs21 dve}{\fs21 od}{\i \f50 \fs21 n}{\fs21 promenljivih}
{\fs21 mogu}{\fs21 izabrati}{\fs21 kao}{\fs21 nezavisne }
{\fs21 (slobodne)}{\fs21 promenljive,}{\fs21 a}{\fs21 preostalih}{\i \f50 \fs21
m}{\fs21 mogu}{\fs21 se}{\fs21 uzeti}{\fs21 za}{\fs21 zavisne}{\fs21
promenljive}{\fs21 i}{\fs21 izraziti}{\fs21 pomo{\f63 \u263\'3f}u }
{\fs21 nezavisnih}{\fs21 promenljivih. }
\fi351 {\fs21 Neka}{\fs21 je}{\fs21 zadatak}{\fs21 LP}{\fs21 dat}{\fs21 u}
{\fs21 kanoni{\f63 \u269\'3f}kom}{\fs21 obliku: }\par
}
Maksimizirati{\i \f50 F}{\f20 = }
\par}{\phpg\posx1507\pvpg\posy10569\absw2102\absh485 \sl-288 \f10 \fs21 \cf0 Pod
ograni{\f63 \u269\'3f}enjima \par
}
P{\i\dn006 \f50 \fs14 n }
{\i \f50 \fs14 j}{\f20 \fs14 =1 }\par
}
\cf0 c x
\fi100 {\fs14 j}{\fs14 j }
\fi380 {\i0 \f10 \fs17 X }
\fi377 {\fs14 j}{\i0 \f20 \fs14 =1 }\par
}
\cf0 n \par
}
\cf0 a x{\i0 \f20 =} b{\dn006 \fs14 i}, \par
}
\fs14 \cf0 ij j
{\fs21 x}{\dn006 j}{\i0 \f40 \fs21 {\field{\*\fldinst SYMBOL 179 \\f Symbol }}}
{\i0 \f20 \fs21 0}{\fs21 , }\par
}
\cf0 i{\i0 \f20 = }\par
}
2,{\i \f50 ,}{\i \f50 ...,m }\par
}
\cf0 j{\i0 \f20 = }\par
}
2,{\i \f50 ,}{\i \f50 ...,n }\par
}
\fs21 \cf0 Kada je zadatak LP dat u op{\f63 \u353\'3f}tem obliku, najpre ga treba
transformisati na kanoni{\f63 \u269\'3f}ki oblik.
\fi351 Ako su{\i \f50 x}{\dn006 \f20 \fs14 1} i{\i \f50 x}{\dn006 \f20 \fs14 2}
izabrane za nezavisne primenljive, onda se iz sistema jedna{\f63 \u269\'3f}ina
promenljive
{\i \f50 x}{\dn006 \f20 \fs14 3}{\i \f50 ,x}{\dn006 \f20 \fs14 4}{\i \f50 ,...,x}
{\i\dn006 \f50 \fs14 n} mogu izraziti pomo{\f63 \u263\'3f}u{\i \f50 x}{\dn006
\f20 \fs14 1} i{\i \f50 x}{\f20 \fs14 2} na slede{\f63 \u263\'3f}i na{\f63
\u269\'3f}in: \par
}
\fs21 \cf0 x{\i0\dn006 \f20 \fs14 3 }
\fi72 x{\i0\dn006 \f20 \fs14 4 }
x{\dn006 \fs14 n }\par
}
\fs21 \cf0 ={\i \f50 {\field{\*\fldinst SYMBOL 97 \\f Symbol }}}{\i \f50 x} +
{\i \f50 {\field{\*\fldinst SYMBOL 97 \\f Symbol }}}{\i \f50 x} +{\i \f50
{\field{\*\fldinst SYMBOL 98 \\f Symbol }}}{\dn006 \fs14 3 }
={\i \f50 {\field{\*\fldinst SYMBOL 97 \\f Symbol }}}{\i \f50 x} +{\i \f50
{\field{\*\fldinst SYMBOL 97 \\f Symbol }}}{\i \f50 x} +{\i \f50
{\field{\*\fldinst SYMBOL 98 \\f Symbol }}}{\dn006 \fs14 4 }
\fi1903 {\i \f50 ... }
={\i \f50 {\field{\*\fldinst SYMBOL 97 \\f Symbol }} }{\i\dn006 \f50 \fs14 n}
{\dn006 \fs14 1}{\i \f50 x}{\dn006 \fs14 1} +{\i \f50 {\field{\*\fldinst SYMBOL
97 \\f Symbol }}}{\i\dn006 \f50 \fs14 n}{\fs14 2}{\i \f50 x}{\fs14 2} +{\i \f50
{\field{\*\fldinst SYMBOL 98 \\f Symbol }}}{\i \f50 \fs14 n }\par
}
1 32 2 \par
}
1 42 2 \par
}
ffd8ffe000104a46494600010100000100010000ffdb004300010101010101010101010101010101010
10101010101010101010101010101010101010101010101010101010101010101010101010101010101
010101010101ffdb0043010101010101010101010101010101010101010101010101010101010101010
1010101010101010101010101010101010101010101010101010101010101010101ffc0001108034a02
5303012200021101031101ffc4001f00000105010101010101000000000000000001020304050607080
90a0bffc400b5100002010303020403050504040000017d010203000411051221314106135161072271
14328191a1082342b1c11552d1f02433627282090a161718191a25262728292a3435363738393a43444
5464748494a535455565758595a636465666768696a737475767778797a838485868788898a92939495
0102030405060708090a0bffc400b511000201020404030407050404000102770001020311040521310
61241510761711322328108144291a1b1c109233352f0156272d10a162434e125f11718191a26272829
2a35363738393a434445464748494a535455565758595a636465666768696a737475767778797a82838
0028a28a0028a28a0028a28a0028a28a0028a28
\cf0 2.5. ALGEBARSKA SIMPLEKS METODA ZA RE{\f63 \u352\'3f}AVANJE ZADATKA LP \par
}
\par
}
\fs21 \cf0 Veli{\f63 \u269\'3f}ine{\i \f50 x}{\dn006 \f20 \fs14 1} i{\i \f50 x}
{\dn006 \f20 \fs14 2} odmeravamo u koordinatnom sistemu{\i \f50 Ox}{\dn006
\f20 \fs14 1}{\i \f50 x}{\dn006 \f20 \fs14 2} i, o{\f63 \u269\'3f}igledno, zbog
uslova{\i \f50 x}{\f20 \fs14 1}{\f40 {\field{\*\fldinst SYMBOL 179 \\f
Symbol }}}{\f20 0},
\f50 x}{\dn006 \f20 \fs14 2}{\f40 {\field{\*\fldinst SYMBOL 179 \\f Symbol }}}
{\f20 0}, parovi vrednosti{\f20 (}{\i \f50 x}{\dn006 \f20 \fs14 1}{\i \f50 ,x}
{\dn006 \f20 \fs14 2}{\f20 )} se prikazuju ta{\f63 \u269\'3f}kama u prvom
kvadrantu tog koordinatnog
sistema. Uslovi nenegativnosti drugih promenjivih odre{\f63 \u273\'3f}uju oblast
dopustivih re{\f63 \u353\'3f}enja u prvom
kvadrantu. Nejedna{\f63 \u269\'3f}ina, na primer{\i \f50 x}{\dn006 \f20 \fs14 3}
{\f40 {\field{\*\fldinst SYMBOL 179 \\f Symbol }}}{\f20 0} odre{\f63
\u273\'3f}uje dopustivu poluravan sa jedne strane prave
\f50 {\field{\*\fldinst SYMBOL 97 \\f Symbol }}}{\i \f50 x}{\f20 +}{\i \f50
{\field{\*\fldinst SYMBOL 97 \\f Symbol }}}{\i \f50 x}{\f20 +}{\i \f50
{\field{\*\fldinst SYMBOL 98 \\f Symbol }}}{\dn006 \f20 \fs14 3}{\f20 =}{\f20
0}. Deo ravni{\i \f50 Ox}{\i \f50 x} koji istovremeno pripada svim
poluravnima{\i \f50 x}{\f40 {\field{\*\fldinst SYMBOL 179 \\f Symbol }}}{\f20
0 }
(}{\i \f50 i}{\f20 =}{\f20 1}{\i \f50 ,}{\f20 2}{\i \f50 ,...,n}{\f20 )}
predstavlja oblast dopustivih re{\f63 \u353\'3f}enja{\i \f50 D}.
\fi351 Zadatak 1. Re{\f63 \u353\'3f}iti geometrijskom metodom zadatak:
\fi351 Minimizirati{\i \f50 F}{\f20 =}{\i \f50 x}{\dn006 \f20 \fs14 1}{\f40
{\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\i \f50 x}{\dn006 \f20 \fs14 2}{\f20
+}{\f20 2}{\i \f50 x}{\dn006 \f20 \fs14 3}{\f40 {\field{\*\fldinst SYMBOL 45 \\f
Symbol }}}{\i \f50 x}{\dn006 \f20 \fs14 4}{\f40 {\field{\*\fldinst SYMBOL 45 \\f
Symbol }}}{\f20 3}{\i \f50 x}{\f20 \fs14 5}{\f20 +}{\i \f50 x}{\f20 \fs14 6}
{\f40 {\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\f20 2}{\i \f50 x}{\f20 \fs14 7
}
pod ograni{\f63 \u269\'3f}enjima: \par
}
1 32 2 \par
}
{\phpg\posx5151\pvpg\posy2239\absw91\absh150 \f20 \fs14 \cf0 \f20 \fs14 \cf0 1 \par
}
{\phpg\posx5379\pvpg\posy2239\absw91\absh150 \f20 \fs14 \cf0 \f20 \fs14 \cf0 2 \par
}
i \par
}
\f50 \fs21 \cf0 x{\i0\dn006 \f20 \fs14 1}{\i0 \f40 {\field{\*\fldinst SYMBOL
45 \\f Symbol }}} x{\i0\dn006 \f20 \fs14 2}{\i0 \f20 +} x{\i0\dn006 \f20 \fs14
3 }
\fi230 {\i0 \f20 2}x{\i0\dn006 \f20 \fs14 1}{\i0 \f40 {\field{\*\fldinst SYMBOL
45 \\f Symbol }}} x{\i0\dn006 \f20 \fs14 2}{\i0 \f40 {\field{\*\fldinst SYMBOL 45
\\f Symbol }}} x{\i0\dn006 \f20 \fs14 3}{\i0 \f40 {\field{\*\fldinst SYMBOL
45 \\f Symbol }}} x{\i0\dn006 \f20 \fs14 4 }
\fi871 x{\i0\dn006 \f20 \fs14 1}{\i0 \f20 +} x{\i0\dn006 \f20 \fs14 2}{\i0 \f40
{\field{\*\fldinst SYMBOL 45 \\f Symbol }}} x{\i0\dn006 \f20 \fs14 5 }
\fi1390 x{\i0\dn006 \f20 \fs14 2}{\i0 \f20 +} x{\i0\dn006 \f20 \fs14 6 }
{\i0 \f20 2}x{\i0\dn006 \f20 \fs14 1}{\i0 \f40 {\field{\*\fldinst SYMBOL 45 \\f
Symbol }}}{\i0 \f20 2}x{\i0\dn006 \f20 \fs14 2}{\i0 \f40 {\field{\*\fldinst
SYMBOL 45 \\f Symbol }}} x{\i0\dn006 \f20 \fs14 6}{\i0 \f20 +}{\i0 \f20
2}x{\i0\dn006 \f20 \fs14 7 }\par
}
{\phpg\posx6100\pvpg\posy4037\absw562\absh1266 \f20 \fs21 \cf0 \f20 \fs21 \cf0 = 4
\par}{\phpg\posx6100\pvpg\posy4037\absw562\absh1266 \sl-289 \f20 \fs21 \cf0 ={\f40
{\field{\*\fldinst SYMBOL 45 \\f Symbol }}}5
\par}{\phpg\posx6100\pvpg\posy4037\absw562\absh1266 \sl-288 \f20 \fs21 \cf0 = 5
\par
}
x{\dn006 \fs14 i}{\i0 \f40 {\field{\*\fldinst SYMBOL 179 \\f Symbol }}}{\i0
\f20 0}, \par
}
i{\i0 \f20 = }\par
}
{\phpg\posx7203\pvpg\posy5482\absw980\absh225 \f20 \fs21 \cf0 \f20 \fs21 \cf0 1 2,
{\i \f50 ,}{\i \f50 ...,} 7 \par
}
Zadatak 2. Re{\f63 \u353\'3f}iti geometrijskom metodom zadatak:
Minimizirati{\i \f50 F}{\f20 =}{\f40 {\field{\*\fldinst SYMBOL 45 \\f
Symbol }}}{\i \f50 x}{\dn006 \f20 \fs14 5 }
ograni{\f63 \u269\'3f}enjima: \par
}
\fs21 \cf0 x{\i0\dn006 \f20 \fs14 1}{\i0 \f20 +} x{\i0\dn006 \f20 \fs14 2 }
\fi398 x{\i0\dn006 \f20 \fs14 2}{\i0 \f40 {\field{\*\fldinst SYMBOL 45 \\f Symbol
}}}{\i0 \f20 2}x{\i0\dn006 \f20 \fs14 3 }
x{\i0\dn006 \f20 \fs14 4}{\i0 \f20 +} x{\i0\dn006 \f20 \fs14 5 }\par
}
\par}{\phpg\posx5664\pvpg\posy7077\absw562\absh745 \sl-288 \f20 \fs21 \cf0 = 1 \par
}
\f20 0}, \par
}
i{\i0 \f20 = }\par
}
{\phpg\posx6768\pvpg\posy7944\absw980\absh225 \f20 \fs21 \cf0 \f20 \fs21 \cf0 1 2,
{\i \f50 ,}{\i \f50 ...,} 5 \par
}
Zadatak 3. Re{\f63 \u353\'3f}iti geometrijskom metodom zadatak:
Maksimizirati{\i \f50 F}{\f20 =}{\f20 2}{\i \f50 x}{\dn006 \f20 \fs14 1}{\f20
+}{\f20 5}{\i \f50 x}{\dn006 \f20 \fs14 2 }
ograni{\f63 \u269\'3f}enjima: \par
}
\cf0 x{\i0\dn006 \f20 \fs14 1}{\i0 \f20 +}{\i0 \f20 4}x{\i0\dn006 \f20 \fs14 2}
{\i0 \f20 +} x{\i0\dn006 \f20 \fs14 3 }
\par}{\phpg\posx4145\pvpg\posy9429\absw1366\absh796 \sl-288 \i \f50 \fs21 \cf0 {\i0
\f20 3}x{\i0\dn006 \f20 \fs14 1}{\i0 \f20 +} x{\i0\dn006 \f20 \fs14 2}{\i0 \f20
+} x{\i0\dn006 \f20 \fs14 4 }
\fi117 x{\i0\dn006 \f20 \fs14 1}{\i0 \f20 +} x{\i0\dn006 \f20 \fs14 2}{\i0 \f20
+} x{\i0\dn006 \f20 \fs14 5 }\par
}
\par}{\phpg\posx5721\pvpg\posy9429\absw545\absh745 \sl-288 \f20 \fs21 \cf0 = 9 \par
}
\cf0 x{\dn006 \fs14 i}{\i0 \f40 {\field{\*\fldinst SYMBOL 179 \\f Symbol }}}
{\i0 \f20 0}, \par
}
\cf0 i{\i0 \f20 = }\par
}
2,{\i \f50 ,}{\i \f50 ...,} 5 \par
}
2.5 Algebarska simpleks metoda za re{\f63 \u353\'3f}avanje zadatka LP
{\fs21 Neka}{\fs21 u}{\fs21 kanini{\f63 \u269\'3f}nom}{\fs21 obliku}{\fs21
zadatka}{\fs21 LP}{\fs21 imamo}{\i \f50 \fs21 n}{\fs21 promenljivih}{\fs21 i}
{\i \f50 \fs21 m}{\fs21 me{\f63 \u273\'3f}usobno}{\fs21 linearno}{\fs21
nezavisnih }
{\fs21 ograni{\f63 \u269\'3f}enja}{\f20 \fs21 (}{\i \f50 \fs21 r}{\f20 \fs21 =}
{\i \f50 \fs21 m}{\f20 \fs21 )}{\fs21 sa,}{\fs21 na}{\fs21 primer,}{\fs21
minimizacijom}{\fs21 funkcije}{\fs21 cilja: }\par
}
Minimizirati:{\i \f50 F}{\f20 (}{\i \f50 x}{\i \f50 ,x}{\i \f50 ,...,x}{\f20
)}{\f20 = }\par
}
\fs14 \cf0 1
{\f10 \fs21 pod}{\f10 \fs21 ograni{\f63 \u269\'3f}enjima }\par
}
\par
}
\cf0 n \par
}
P{\i\dn006 \f50 \fs14 n }
{\i \f50 \fs14 i}{\f20 \fs14 =1 }\par
}
\cf0 c x
\fi100 {\fs14 i}{\fs14 i }\par
}
{\phpg\posx4222\pvpg\posy13118\absw294\absh574 \f10 \fs18 \cf0 \f10 \fs18 \cf0 X
\par}{\phpg\posx4222\pvpg\posy13118\absw294\absh574 \sl-218 \par\f10 \fs18 \cf0 {\i
\f50 \fs14 j}{\f20 \fs14 =1 }\par
}
\cf0 n \par
}
\cf0 a x{\i0 \f20 =} b{\dn006 \fs14 i},
\fi658 x{\i0 \f40 {\field{\*\fldinst SYMBOL 179 \\f Symbol }}}{\i0 \f20 0}, \par
}
\cf0 ij j \par
}
\cf0 i{\i0 \f20 = }\par
}
2,{\i \f50 ,}{\i \f50 ...,m }\par
}
\cf0 j{\i0 \f20 =}{\i0 \f20 1},...,n \par
}
\cf0 k \par
}
\fs21 \cf0 Optimalno re{\f63 \u353\'3f}enje se nalazi u jednom od temena
konveksnog polijedra, gde je najmanje
=}{\i \f50 n}{\f40 {\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\i \f50 m}
promenljivih jednako nuli. Izaberimo proizvoljno{\i \f50 k} promenljivih
za nezavisne i \par
}
pomo{\f63 \u263\'3f}u njih izrazimo zavisne promenljive. Neka su nezavisne
promenljive{\i \f50 x}{\dn006 \f20 \fs14 1}{\i \f50 ,x}{\dn006 \f20 \fs14 2}
{\i \f50 ,...,x}{\i\dn006 \f50 \fs14 k}. \par
}
ffd8ffe000104a46494600010100000100010000ffdb004300010101010101010101010101010101010
10101010101010101010101010101010101010101010101010101010101010101010101010101010101
010101010101ffdb0043010101010101010101010101010101010101010101010101010101010101010
1010101010101010101010101010101010101010101010101010101010101010101ffc0001108034a02
5303012200021101031101ffc4001f00000105010101010101000000000000000001020304050607080
90a0bffc400b5100002010303020403050504040000017d010203000411051221314106135161072271
14328191a1082342b1c11552d1f02433627282090a161718191a25262728292a3435363738393a43444
5464748494a535455565758595a636465666768696a737475767778797a838485868788898a92939495
0102030405060708090a0bffc400b511000201020404030407050404000102770001020311040521310
61241510761711322328108144291a1b1c109233352f0156272d10a162434e125f11718191a26272829
2a35363738393a434445464748494a535455565758595a636465666768696a737475767778797a82838
0028a28a0028a28a0028a28a0028a28a0028a28
6 \par
}
{\phpg\posx6059\pvpg\posy345\absw4734\absh225 \f10 \fs21 \cf0 \f10 \fs21 \cf0 GLAVA
2. LINEARNO PROGRAMIRANJE \par
}
x{\fs14 k}{\i0 \f20 \fs14 +1 }
x{\fs14 k}{\i0 \f20 \fs14 +2 }\par
}
={\i \f50 {\field{\*\fldinst SYMBOL 97 \\f Symbol }} }
\par}{\phpg\posx3922\pvpg\posy1222\absw401\absh485 \sl-288 \f20 \fs21 \cf0 ={\i
\f50 {\field{\*\fldinst SYMBOL 97 \\f Symbol }} }\par
}
k{\i0 \f20 +1},{\fs21 x1}{\i0 \f20 }{\i0 \f20 1 }
\par}{\phpg\posx4319\pvpg\posy1222\absw668\absh503 \sl-288 \i \f50 \fs14 \cf0 k{\i0
\f20 +2},{\fs21 x1}{\i0 \f20 }{\i0 \f20 1 }\par
}
{\phpg\posx5051\pvpg\posy1222\absw386\absh485 \f20 \fs21 \cf0 \f20 \fs21 \cf0 +
{\i \f50 {\field{\*\fldinst SYMBOL 97 \\f Symbol }} }
\par}{\phpg\posx5051\pvpg\posy1222\absw386\absh485 \sl-288 \f20 \fs21 \cf0 +{\i
}
k{\i0 \f20 +1},{\fs21 x2}{\i0 \f20 }{\i0 \f20 2 }
\f20 +2},{\fs21 x2}{\i0 \f20 }{\i0 \f20 2 }\par
}
{\i \f50 ...} +{\i \f50 {\field{\*\fldinst SYMBOL 97 \\f Symbol }} }
\f50 ...} +{\i \f50 {\field{\*\fldinst SYMBOL 97 \\f Symbol }} }\par
}
k{\i0 \f20 +1},k{\fs21 x}k
\f20 +2},k{\fs21 x}k \par
}
{\i \f50 {\field{\*\fldinst SYMBOL 98 \\f Symbol }} }
}
k{\i0 \f20 +1 }
k{\i0 \f20 +2 }\par
}
\f50 \fs21
\cf0 .....................................................................
\fi2247 x{\dn006 \fs14 n}{\i0 \f20 =} {\field{\*\fldinst SYMBOL 97 \\f Symbol }}
{\dn006 \fs14 n}{\i0\dn006 \f20 \fs14 1}x{\i0\dn006 \f20 \fs14 1}{\i0 \f20 +}
{\field{\*\fldinst SYMBOL 97 \\f Symbol }} {\dn006 \fs14 n}{\i0 \f20 \fs14 2}x{\i0
\f20 \fs14 2}{\i0 \f20 +} ...{\i0 \f20 +} {\field{\*\fldinst SYMBOL 97 \\f
Symbol }} x{\i0 \f20 +} {\field{\*\fldinst SYMBOL 98 \\f Symbol }}{\fs14 n }
\fi351 {\i0 \f10 Funkcija}{\i0 \f10 cilja}{\i0 \f10 u}{\i0 \f10 funkciji}
x{\i0\dn006 \f20 \fs14 1},x{\i0\dn006 \f20 \fs14 2},...,x{\dn006 \fs14 k}{\i0
\f10 postaje }
\par}{\phpg\posx1156\pvpg\posy1800\absw8314\absh1961 \sl-182 \par\par\i \f50
\fs21 \cf0 \fi2688 F{\i0 \f20 (}x{\i0\dn006 \f20 \fs14 1},x{\i0\dn006 \f20 \fs14
2},...,x{\dn006 \fs14 k}{\i0 \f20 )}{\i0 \f20 =} {\field{\*\fldinst SYMBOL
103 \\f Symbol }}{\i0 \f20 \fs14 0}{\i0 \f20 +} {\field{\*\fldinst SYMBOL 103 \\f
Symbol }}{\i0 \f20 \fs14 1}x{\i0 \f20 \fs14 1}{\i0 \f20 +} ...{\i0 \f20 +}
{\field{\*\fldinst SYMBOL 103 \\f Symbol }} x
{\i0 \f10 Ako}{\i0 \f10 stavimo}{\i0 \f10 da}{\i0 \f10 je} x{\i0\dn006 \f20
\fs14 1}{\i0 \f20 =} x{\i0\dn006 \f20 \fs14 2}{\i0 \f20 =}{\i0 \f40 ��}
{\i0 \f20 =} x{\dn006 \fs14 k}{\i0 \f20 =}{\i0 \f20 0}{\i0 \f10 dobijamo}
{\i0 \f10 bazisno}{\i0 \f10 dopustivo}{\i0 \f10 re{\f63 \u353\'3f}enje: }\par
}
nk k \par
}
k k \par
}
(0{\i \f50 ,} 0{\i \f50 ,...,} 0{\i \f50 ,{\field{\*\fldinst SYMBOL 98 \\f
Symbol }} }\par
}
k{\i0 \f20 +1}{\fs21 ,{\field{\*\fldinst SYMBOL 98 \\f Symbol }} }\par
}
k{\i0 \f20 +2 }\par
}
,...,{\field{\*\fldinst SYMBOL 98 \\f Symbol }}{\dn006 \fs14 n}{\i0 \f20 ) }\par
}
{\phpg\posx7107\pvpg\posy4162\absw73\absh225 \f10 \fs21 \cf0 \f10 \fs21 \cf0 i \par
}
F{\i0 \f20 =} {\field{\*\fldinst SYMBOL 103 \\f Symbol }}{\i0\dn006 \f20 \fs14
0 }\par
}
\fs21 \cf0 I KORAK: Me{\f63 \u273\'3f}u koeficijentima funkcije cilja{\i \f50
{\field{\*\fldinst SYMBOL 103 \\f Symbol }}}{\dn006 \f20 \fs14 1}{\i \f50 ,
{\field{\*\fldinst SYMBOL 103 \\f Symbol }}}{\dn006 \f20 \fs14 2}{\i \f50 ,...,
{\field{\*\fldinst SYMBOL 103 \\f Symbol }}}{\i\dn006 \f50 \fs14 k} odabrati{\i
\f50 {\field{\*\fldinst SYMBOL 103 \\f Symbol }}}{\i\dn006 \f50 \fs14 i} za koje
va{\f63 \u382\'3f}i da je
{\i \f50 {\field{\*\fldinst SYMBOL 103 \\f Symbol }}}{\i\dn006 \f50 \fs14 i}{\i
\f50 <}{\f20 0 } . U tom slu{\f63 \u269\'3f}aju {\f63 \u263\'3f}e promenljiva{\i
\f50 x}{\i\dn006 \f50 \fs14 i} pre{\f63 \u263\'3f}i iz zavisnih u nezavisne.
\fi351 Ako takvo{\i \f50 {\field{\*\fldinst SYMBOL 103 \\f Symbol }}}{\i\dn006
\f50 \fs14 i} ne postoji, onda smo dostigli optimalnu ta{\f63 \u269\'3f}ku, tj.
vi{\f63 \u353\'3f}e ne mo{\f63 \u382\'3f}emo da umanjimo
vrednost funkcije cilja.
\par}{\phpg\posx1156\pvpg\posy4981\absw10538\absh5238 \sl-198 \par\par\f10 \fs21
\cf0 \fi351 Ako su svi koeficijenti{\i \f50 {\field{\*\fldinst SYMBOL 103 \\f
Symbol }}}{\dn006 \f20 \fs14 1}{\i \f50 ,{\field{\*\fldinst SYMBOL 103 \\f
Symbol }}}{\dn006 \f20 \fs14 2}{\i \f50 ,...,{\field{\*\fldinst SYMBOL 103 \\f
Symbol }}}{\i\dn006 \f50 \fs14 k} uz promenljive{\i \f50 x}{\dn006 \f20 \fs14
1}{\i \f50 ,x}{\f20 \fs14 2}{\i \f50 ,...,x}{\i \f50 \fs14 k} u funkciji cilja
pozitivni,
\par}{\phpg\posx1156\pvpg\posy4981\absw10538\absh5238 \sl-253 \f10 \fs21 \cf0 onda
uve{\f63 \u263\'3f}avaju{\f63 \u263\'3f}i neku od ovih promenljivih (na vrednosti
koje su ve{\f63 \u263\'3f}e od 0) ne mo{\f63 \u382\'3f}emo da
umanjimo vrednost funkcije cilja. To zna{\f63 \u269\'3f}i da je dobijeno bazisno
re{\f63 \u353\'3f}enje i optimalno. Me{\f63 \u273\'3f}utim,
ako izme{\f63 \u273\'3f}u koeficijenata{\i \f50 {\field{\*\fldinst SYMBOL 103 \\f
Symbol }}}{\dn006 \f20 \fs14 1}{\i \f50 ,{\field{\*\fldinst SYMBOL 103 \\f
Symbol }}}{\dn006 \f20 \fs14 2}{\i \f50 ,...,{\field{\*\fldinst SYMBOL 103 \\f
Symbol }}}{\i\dn006 \f50 \fs14 k} ima i negativnih, onda uve{\f63
\u263\'3f}avaju{\f63 \u263\'3f}i vrednost promenljivih
ispred kojih je koeficijent u funkciji cilja negativan, mo{\f63 \u382\'3f}emo da
umanjimo vrednost funkcije cilja
{\i \f50 F}, to jest, mo{\f63 \u382\'3f}emo da do{\f63 \u273\'3f}emo do boljeg
bazisnog re{\f63 \u353\'3f}enja.
\fi351 Neka je koeficijenat{\i \f50 {\field{\*\fldinst SYMBOL 103 \\f Symbol }}}
{\dn006 \f20 \fs14 1} negativan. Sada ima smisla uve{\f63 \u263\'3f}ati
promenljivu{\i \f50 x}{\dn006 \f20 \fs14 1} i na taj na{\f63 \u269\'3f}in
pre{\f63 \u263\'3f}i
\par}{\phpg\posx1156\pvpg\posy4981\absw10538\absh5238 \sl-288 \f10 \fs21 \cf0 od
dobijenog re{\f63 \u353\'3f}enja, gde je{\i \f50 x}{\dn006 \f20 \fs14 1} bilo
jednako nuli, do novog bazisnog re{\f63 \u353\'3f}enja gde {\f63 \u263\'3f}e
umesto{\i \f50 x}{\dn006 \f20 \fs14 1 }
\par}{\phpg\posx1156\pvpg\posy4981\absw10538\absh5238 \sl-288 \f10 \fs21 \cf0 biti
jednaka nuli neka od zavisnih promenljivih. Uve{\f63 \u263\'3f}avaju{\f63
\u263\'3f}i{\i \f50 x}{\dn006 \f20 \fs14 1}, smanjujemo vrednost funkcije
cilja{\i \f50 F} ali moramo da pazimo da nam pri tom neka od zavisnih
promenljivih{\i \f50 x}{\i \f50 \fs14 k}{\f20 \fs14 +1}{\i \f50 ,x}{\i \f50 \fs14
k}{\f20 \fs14 +2}{\i \f50 ,...,x}{\i\dn006 \f50 \fs14 n }
\par}{\phpg\posx1156\pvpg\posy4981\absw10538\absh5238 \sl-324 \f10 \fs21 \cf0 ne
postane negativna. One, o{\f63 \u269\'3f}igledno ne{\f63 \u263\'3f}e postati
negativne, ako su koeficijenti uz{\i \f50 x}{\dn006 \f20 \fs14 1} u svim
jedna{\f63 \u269\'3f}inama pozitivni, pa se tada{\i \f50 x}{\dn006 \f20 \fs14 1}
mo{\f63 \u382\'3f}e da uve{\f63 \u263\'3f}a do beskona{\f63 \u269\'3f}nosti,
{\f63 \u353\'3f}to bi zna{\f63 \u269\'3f}ilo da je u
\par}{\phpg\posx1156\pvpg\posy4981\absw10538\absh5238 \sl-252 \f10 \fs21 \cf0 tom
slu{\f63 \u269\'3f}aju funkcija cilja neograni{\f63 \u269\'3f}ena.
\fi351 Pretpostavimo da se izme{\f63 \u273\'3f}u koeficijenati uz{\i \f50 x}
{\dn006 \f20 \fs14 1} u jedna{\f63 \u269\'3f}inama nalaze i negativni
koeficijenti.
\par}{\phpg\posx1156\pvpg\posy4981\absw10538\absh5238 \sl-288 \f10 \fs21 \cf0 Neka
je, na primer, u jedna{\f63 \u269\'3f}ini za{\i \f50 x}{\i\dn006 \f50 \fs14
l}: \par
}
\cf0 x{\dn006 \fs14 l }\par
}
={\i \f50 {\field{\*\fldinst SYMBOL 97 \\f Symbol }}}{\dn006 \fs14 1l}
{\i\dn006 \f50 \fs14 x}{\i \f50 }{\dn006 \fs14 1} +{\i \f50 {\field{\*\fldinst
SYMBOL 97 \\f Symbol }}}{\fs14 2l}{\i\dn006 \f50 \fs14 x}{\i \f50 }{\fs14 2} +
{\f40 ��} +{\i \f50 {\field{\*\fldinst SYMBOL 97 \\f Symbol }}}{\i \f50 x} +
{\i \f50 {\field{\*\fldinst SYMBOL 98 \\f Symbol }}}{\i \f50 \fs14 l }\par
}
\cf0 lk k \par
}
koeficijenat uz{\i \f50 x}{\dn006 \f20 \fs14 1} negativan:{\i \f50
{\field{\*\fldinst SYMBOL 97 \\f Symbol }}}{\dn006 \f20 \fs14 1l}{\i\dn006 \f50
\fs14 <}{\i \f50 }{\f20 0}. Ako stavimo{\i \f50 x}{\dn006 \f20 \fs14 2}{\f20
=}{\i \f50 x}{\f20 \fs14 3}{\f20 =}{\f40 ��}{\f20 =}{\i \f50 x}{\i \f50
\fs14 k}{\f20 =}{\f20 0}, onda{\i \f50 x}{\f20 \fs14 1} mo{\f63 \u382\'3f}emo
\par
}
{\phpg\posx1156\pvpg\posy11858\absw2783\absh225 \f10 \fs21 \cf0 \f10 \fs21 \cf0 da
uve{\f63 \u263\'3f}amo do vrednosti \par
}
\cf0 {\field{\*\fldinst SYMBOL 98 \\f Symbol }}{\dn006 \fs14 l }
\cf0 \fi98 {\fs14 l}{\i0 \f20 \fs14 1 }\par
}
\cf0 {\field{\*\fldinst SYMBOL 97 \\f Symbol }} \par
}
{\field{\*\fldinst SYMBOL 45 \\f Symbol }}{\i \f50 ,}{\i \f50 ,}{\i \f50
{\field{\*\fldinst SYMBOL 98 \\f Symbol }} }\par
}
\cf0 l{\fs21 >}{\i0 \f20 \fs21 0 }\par
}
jer za tu vrednost promenljive{\i \f50 x}{\dn006 \f20 \fs14 1} promenljiva{\i
\f50 x}{\i\dn006 \f50 \fs14 l} postaje jednaka nuli. Od promeljivih{\i \f50 x }
biramo promenjivu{\i \f50 x}{\i\dn006 \f50 \fs14 r} za koju je veli{\f63
\u269\'3f}ina
\cf0 \fi4116 slobodan {\f63 \u269\'3f}lan
\fi3900 {\f40 {\field{\*\fldinst SYMBOL 45 \\f Symbol }}}koeficijent uz{\i \f50 x}
{\dn006 \f20 \fs14 1 }\par
}
najmanja, tj. \par
}
{\phpg\posx6373\pvpg\posy14478\absw165\absh188 \f10 \fs17 \cf0 \f10 \fs17 \cf0 �
\par
}
{\phpg\posx7060\pvpg\posy14478\absw157\absh188 \f10 \fs17 \cf0 \f10 \fs17 \cf0 !
\par
}
\cf0 k{\i0 \f20 +1}{\fs21 ,x }\par
}
{\phpg\posx10403\pvpg\posy12762\absw1079\absh263 \i \f50 \fs14 \cf0 \i \f50
\fs14 \cf0 k{\i0 \f20 +1}{\fs21 ,...,x}{\dn006 n }\par
}
{\field{\*\fldinst SYMBOL 45 \\f Symbol }} \par
}
\fs21 \cf0 {\field{\*\fldinst SYMBOL 98 \\f Symbol }}{\dn006 \fs14 r }
{\field{\*\fldinst SYMBOL 97 \\f Symbol }}{\i0\dn006 \f20 \fs14 1r }\par
}
{\phpg\posx5357\pvpg\posy14795\absw976\absh341 \f20 \fs21 \cf0 \f20 \fs21 \cf0 =
min
{\i \f50 \fs14 k}{\fs14 +1}{\f40 \fs14 {\field{\*\fldinst SYMBOL 163 \\f Symbol }}}
{\i \f50 \fs14 l}{\f40 \fs14 {\field{\*\fldinst SYMBOL 163 \\f Symbol }}}{\i
\f50 \fs14 n }\par
}
{\field{\*\fldinst SYMBOL 45 \\f Symbol }} \par
}
\fs21 \cf0 {\field{\*\fldinst SYMBOL 98 \\f Symbol }}{\fs14 l }
{\field{\*\fldinst SYMBOL 97 \\f Symbol }}{\i0\dn006 \f20 \fs14 1l }\par
}
ffd8ffe000104a46494600010100000100010000ffdb004300010101010101010101010101010101010
10101010101010101010101010101010101010101010101010101010101010101010101010101010101
010101010101ffdb0043010101010101010101010101010101010101010101010101010101010101010
1010101010101010101010101010101010101010101010101010101010101010101ffc0001108034a02
5303012200021101031101ffc4001f00000105010101010101000000000000000001020304050607080
90a0bffc400b5100002010303020403050504040000017d010203000411051221314106135161072271
14328191a1082342b1c11552d1f02433627282090a161718191a25262728292a3435363738393a43444
5464748494a535455565758595a636465666768696a737475767778797a838485868788898a92939495
0102030405060708090a0bffc400b511000201020404030407050404000102770001020311040521310
61241510761711322328108144291a1b1c109233352f0156272d10a162434e125f11718191a26272829
2a35363738393a434445464748494a535455565758595a636465666768696a737475767778797a82838
0028a28a0028a28a0028a28a0028a28a0028a28
\cf0 2.6. KANONI{\f63 \u268\'3f}NI ZADATAK LP. TAKEROVE TABELE.
\par}{\phpg\posx1156\pvpg\posy345\absw6128\absh841 \sl-335 \par\f10 \fs21 \cf0 Tada
se veli{\f63 \u269\'3f}ina{\i \f50 x}{\dn006 \f20 \fs14 1} izra{\f63
\u382\'3f}ava iz jedna{\f63 \u269\'3f}ine \par
}
x{\dn006 \fs14 r }\par
}
{\phpg\posx4332\pvpg\posy1463\absw3562\absh276 \f20 \fs21 \cf0 \f20 \fs21 \cf0 ={\i
\f50 {\field{\*\fldinst SYMBOL 97 \\f Symbol }}}{\dn006 \fs14 1r}{\i\dn006
\f50 \fs14 x}{\i \f50 }{\dn006 \fs14 1} +{\i \f50 {\field{\*\fldinst SYMBOL
97 \\f Symbol }}}{\i \f50 \fs14 r}{\fs14 2}{\i \f50 x}{\fs14 2} +{\f40 ��} +{\i
\f50 {\field{\*\fldinst SYMBOL 97 \\f Symbol }}}{\i \f50 x} +{\i \f50
{\field{\*\fldinst SYMBOL 98 \\f Symbol }}}{\i \f50 \fs14 r }\par
}
rk k \par
}
\par
}
{\phpg\posx1156\pvpg\posy1946\absw10073\absh1806 \f10 \fs21 \cf0 \f10 \fs21 \cf0 i
zamenjuje u ostalim jedna{\f63 \u269\'3f}inama i u funkciji cilja. Na taj
na{\f63 \u269\'3f}in smo promenljivama{\i \f50 x}{\dn006 \f20 \fs14 1} i
{\i \f50 x}{\i\dn006 \f50 \fs14 r} zamenili mesta u sistemu, tj.
promenljiva{\i \f50 x}{\dn006 \f20 \fs14 1} je postala zavisna, dok smo
promenljivu{\i \f50 x}{\i\dn006 \f50 \fs14 r }
prbacili u nezavisne, uz to smo pobolj{\f63 \u353\'3f}ali vrednost funkcije cilja,
a da pri tom nismo naru{\f63 \u353\'3f}ili
dopustivost re{\f63 \u353\'3f}enja.
\fi351 Navedeni postupak se ponavlja dok se ne dobije optimalno re{\f63
\u353\'3f}enje.
\cf0 \fi351 Zadatak 1. Minimizirati{\i \f50 F}{\f20 =}{\f20 5}{\i \f50 x}
{\dn006 \f20 \fs14 1}{\f40 {\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\f20 2}
{\i \f50 x}{\dn006 \f20 \fs14 3} pri ograni{\f63 \u269\'3f}enjima: \par
}
{\field{\*\fldinst SYMBOL 45 \\f Symbol }} {\f20 5}{\i \f50 x}{\dn006 \f20 \fs14
1} {\field{\*\fldinst SYMBOL 45 \\f Symbol }}{\i \f50 x}{\dn006 \f20 \fs14 2}
{\f20 +}{\f20 2}{\i \f50 x}{\f20 \fs14 3 }
{\field{\*\fldinst SYMBOL 45 \\f Symbol }}{\i \f50 x}{\dn006 \f20 \fs14 1}{\f20
+}{\i \f50 x}{\dn006 \f20 \fs14 3}{\f20 +}{\i \f50 x}{\dn006 \f20 \fs14 4 }
{\field{\*\fldinst SYMBOL 45 \\f Symbol }} {\f20 3}{\i \f50 x}{\dn006 \f20 \fs14
1}{\f20 +}{\f20 5}{\i \f50 x}{\dn006 \f20 \fs14 4 }\par
}
}
\f20 0}, \par
}
\cf0 i{\i0 \f20 =}{\i0 \f20 1}{\i0 \f20 2}{\i0 \f20 3}{\i0 \f20 4,,, }\par
}
2.6 Kanoni{\f63 \u269\'3f}ni zadatak LP. Takerove tabele.
{\fs21 Zadatak}{\fs21 linearnog}{\fs21 programiranja}{\fs21 koji}{\fs21 je}
{\fs21 dat}{\fs21 u}{\fs21 op{\f63 \u353\'3f}tem}{\fs21 obliku}{\fs21 treba}
{\fs21 transformisati}{\fs21 u}{\fs21 kanoni{\f63 \u269\'3f}ni }
{\fs21 oblik}{\fs21 pogodan}{\fs21 za}{\fs21 popunjavanje}{\fs21 Takerovih}
{\fs21 tabela. }
\fi351 {\fs21 Moramo}{\fs21 razlikovati}{\fs21 maksimizacioni}{\fs21 i}{\fs21
minimizacioni}{\fs21 kanoni{\f63 \u269\'3f}ni}{\fs21 oblik}{\fs21 zadatka}{\fs21
LP. }
\fi351 {\fs21 Zadatak}{\fs21 1.}{\fs21 Jedna}{\fs21 firma}{\fs21 proizvodi}
{\fs21 pravougaone}{\fs21 (P)}{\fs21 i}{\fs21 okrugle}{\fs21 stolove.}{\fs21
Za}{\fs21 svaki}{\fs21 pravougaoni }
{\fs21 sto}{\fs21 potrebna}{\fs21 je}{\fs21 jedna}{\fs21 jedinica}{\fs21
komponente}{\fs21 A}{\fs21 (greda}{\fs21 0,1}{\fs21 x}{\fs21 0,1}{\fs21 x}
{\fs21 4),}{\fs21 dve}{\fs21 jedinice}{\fs21 komponente}{\fs21 B }
{\fs21 (daska}{\fs21 0,02}{\fs21 x}{\fs21 0,2}{\fs21 x}{\fs21 4)}{\fs21 i}
{\fs21 dve}{\fs21 jedinice}{\fs21 komponente}{\fs21 C}{\fs21 (ukrasna}{\fs21
plo{\f63 \u269\'3f}a}{\fs21 1}{\fs21 x}{\fs21 1),}{\fs21 a}{\fs21 za}{\fs21
svaki}{\fs21 okrugli}{\fs21 sto }
{\fs21 potrebne}{\fs21 su}{\fs21 dve}{\fs21 jedinice}{\fs21 komponente}{\fs21
A,}{\fs21 dve}{\fs21 jedinice}{\fs21 komponente}{\fs21 B}{\fs21 i}{\fs21
jedna}{\fs21 jedinica}{\fs21 komponente }
{\fs21 C.}{\fs21 Firma}{\fs21 ima}{\fs21 na}{\fs21 raspolaganju}{\fs21 20}
{\fs21 jedinica}{\fs21 komponente}{\fs21 A,}{\fs21 30}{\fs21 jedinica}{\fs21
komponente}{\fs21 B}{\fs21 i}{\fs21 25}{\fs21 jednica }
{\fs21 komponente}{\fs21 C.}{\fs21 Ako}{\fs21 firma}{\fs21 ostvaruje}{\fs21
{\f63 \u269\'3f}istu}{\fs21 zaradu}{\fs21 za}{\fs21 svaki}{\fs21 pravougaoni}
{\fs21 sto}{\i \f50 \fs21 c}{\dn006 \f20 \fs14 1}{\f20 \fs21 =}{\f20 \fs21
200}{\fs21 dinara}{\fs21 i}{\fs21 za }
{\fs21 svaki}{\fs21 okrugli}{\fs21 sto}{\i \f50 \fs21 c}{\dn006 \f20 \fs14 2}
{\f20 \fs21 =}{\f20 \fs21 150}{\fs21 dinara,}{\fs21 koliko}{\fs21 stolova}
{\fs21 svake}{\fs21 vrste}{\fs21 treba}{\fs21 da}{\fs21 proizvede}{\fs21 da}
{\fs21 bi}{\fs21 zarada }
{\fs21 bila}{\fs21 maksimalna? }
\cf0 \fi351 {\fs21 Zadatak}{\fs21 2.}{\fs21 Kompanija}{\fs21 priprema}{\fs21
me{\f63 \u353\'3f}avinu}{\fs21 hrane}{\fs21 od}{\fs21 tri}{\fs21 sastojka:}
{\i \f50 \fs21 S }{\dn006 \f20 \fs14 1}{\fs21 ,}{\i \f50 \fs21 S}{\dn006
\f20 \fs14 2}{\fs21 i}{\i \f50 \fs21 S}{\dn006 \f20 \fs14 3}{\fs21 .}{\fs21
Svaka }
{\fs21 jedinica}{\fs21 sastojka}{\i \f50 \fs21 S}{\dn006 \f20 \fs14 1}{\fs21
sadr{\f63 \u382\'3f}i}{\fs21 jedan}{\fs21 gram}{\fs21 proteina,}{\fs21 2}{\fs21
grama}{\fs21 masno{\f63 \u263\'3f}e}{\fs21 i}{\fs21 ko{\f63 \u353\'3f}ta}{\fs21
20}{\fs21 para.}{\fs21 Svaka}{\fs21 jedinica }
{\fs21 sastojka}{\i \f50 \fs21 S}{\dn006 \f20 \fs14 2}{\fs21 sadr{\f63
\u382\'3f}i}{\fs21 2}{\fs21 grama}{\fs21 proteina,}{\fs21 2}{\fs21 grama}
{\fs21 masno{\f63 \u263\'3f}e}{\fs21 i}{\fs21 ko{\f63 \u353\'3f}ta}{\fs21 30}
{\fs21 para.}{\fs21 Svaka}{\fs21 jedinica}{\fs21 sastojka }
{\i \f50 \fs21 S}{\dn006 \f20 \fs14 3}{\fs21 sadr{\f63 \u382\'3f}i}{\fs21 2}
{\fs21 grama}{\fs21 proteina,}{\fs21 1}{\fs21 gram}{\fs21 masno{\f63
\u263\'3f}e}{\fs21 i}{\fs21 ko{\f63 \u353\'3f}ta}{\fs21 25}{\fs21 para.}{\fs21
Ako}{\fs21 me{\f63 \u353\'3f}avina}{\fs21 ova}{\fs21 tri}{\fs21 sastojka }
{\fs21 mora}{\fs21 da}{\fs21 sadr{\f63 \u382\'3f}i}{\fs21 najmanje}{\fs21 200}
{\fs21 grama}{\fs21 proteina}{\fs21 i}{\fs21 najmanje}{\fs21 150}{\fs21
grama}{\fs21 masno{\f63 \u263\'3f}e,}{\fs21 koliko}{\fs21 jedinica }
{\fs21 svakog}{\fs21 sastojka}{\fs21 hrane}{\fs21 treba}{\fs21 kompanija}{\fs21
da}{\fs21 iskoristi}{\fs21 tako}{\fs21 da}{\fs21 realizuje}{\fs21 minimalne}
{\fs21 tro{\f63 \u353\'3f}kove? }
\cf0 \fi351 {\fs21 Zadatak}{\fs21 3}{\fs21 Maksimizirati}{\i \f50 \fs21 F}
{\f20 \fs21 =}{\f40 \fs21 {\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\i \f50
\fs21 x}{\dn006 \f20 \fs14 1}{\f20 \fs21 +}{\f20 \fs21 2}{\i \f50 \fs21 x}
{\dn006 \f20 \fs14 2}{\f20 \fs21 +}{\f20 \fs21 4}{\i \f50 \fs21 x}{\dn006
\f20 \fs14 3}{\fs21 ,}{\fs21 P.O. }
\cf0 \fi3967 {\i \f50 \fs21 x}{\dn006 \f20 \fs14 1}{\f40 \fs21 {\field{\*\fldinst
SYMBOL 45 \\f Symbol }}}{\i \f50 \fs21 x}{\dn006 \f20 \fs14 2}{\f40 \fs21
{\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\i \f50 \fs21 x}{\dn006 \f20 \fs14 3}
{\f40 \fs21 {\field{\*\fldinst SYMBOL 163 \\f Symbol }}}{\f20 \fs21 1 }
\fi3967 {\i \f50 \fs21 x}{\dn006 \f20 \fs14 1}{\f20 \fs21 +}{\i \f50 \fs21 x}
{\dn006 \f20 \fs14 2}{\f20 \fs21 +}{\i \f50 \fs21 x}{\dn006 \f20 \fs14 3}
{\f40 \fs21 {\field{\*\fldinst SYMBOL 163 \\f Symbol }}}{\f20 \fs21 3 }
\fi3967 {\i \f50 \fs21 x}{\dn006 \f20 \fs14 1}{\i \f50 \fs21 ,x}{\dn006 \f20 \fs14
2}{\i \f50 \fs21 ,x}{\dn006 \f20 \fs14 3}{\f40 \fs21 {\field{\*\fldinst SYMBOL
179 \\f Symbol }}}{\f20 \fs21 0 }
2.7 Zadaci LP bez prirodnih ograni{\f63 \u269\'3f}enja
{\fs21 Simpleks}{\fs21 metodu}{\fs21 smo}{\fs21 koristili}{\fs21 za}{\fs21
re{\f63 \u353\'3f}avanje}{\fs21 kanoni{\f63 \u269\'3f}kih}{\fs21 zadataka}{\fs21
LP}{\fs21 kod}{\fs21 kojih}{\fs21 se}{\fs21 tra{\f63 \u382\'3f}io}{\fs21
mak- }
{\fs21 simum}{\fs21 ili}{\fs21 minimum}{\fs21 funkcije}{\fs21 cilja.}{\fs21
Osnovna}{\fs21 osobina}{\fs21 zadataka}{\fs21 LP}{\fs21 u}{\fs21
op{\f63 \u353\'3f}tem}{\fs21 obliku}{\fs21 je}{\fs21 bila }
{\fs21 nenegativnost}{\fs21 promenljivih,}{\fs21 tj.}{\fs21 simpleks}{\fs21
metoda}{\fs21 pretpostavlja}{\fs21 da}{\fs21 su}{\fs21 sve}{\fs21 promenljive}
{\fs21 u}{\fs21 zadatku }
{\fs21 nenegativne.}{\fs21 Me{\f63 \u273\'3f}utim,}{\fs21 jednostavne}{\fs21
modifikacije}{\fs21 simpleks}{\fs21 algoritma}{\fs21 omogu{\f63
\u263\'3f}avaju}{\fs21 re{\f63 \u353\'3f}avanje }
{\fs21 izvesnih}{\fs21 zadataka}{\fs21 LP}{\fs21 bez}{\fs21 prirodnih}{\fs21
ograni{\f63 \u269\'3f}enja. }\par
}
ffd8ffe000104a46494600010100000100010000ffdb004300010101010101010101010101010101010
10101010101010101010101010101010101010101010101010101010101010101010101010101010101
010101010101ffdb0043010101010101010101010101010101010101010101010101010101010101010
1010101010101010101010101010101010101010101010101010101010101010101ffc0001108034a02
5303012200021101031101ffc4001f00000105010101010101000000000000000001020304050607080
90a0bffc400b5100002010303020403050504040000017d010203000411051221314106135161072271
14328191a1082342b1c11552d1f02433627282090a161718191a25262728292a3435363738393a43444
5464748494a535455565758595a636465666768696a737475767778797a838485868788898a92939495
0102030405060708090a0bffc400b511000201020404030407050404000102770001020311040521310
61241510761711322328108144291a1b1c109233352f0156272d10a162434e125f11718191a26272829
2a35363738393a434445464748494a535455565758595a636465666768696a737475767778797a82838
0028a28a0028a28a0028a28a0028a28a0028a28
8 \par
}
2. LINEARNO PROGRAMIRANJE \par
}
Definicija 2.7.1 Realna promenljiva u zadatku LP je bez prirodnog ograni{\f63
\u269\'3f}enja, ako ne zado-
voljava uslov nenegativnosti.
\cf0 \fi351 Prvi tip ovakvih zadataka {\f63 \u269\'3f}ine zadaci LP kod kojih samo
neke od promenljivih ne ispun-
javaju uslov nenegativnosti. Takvi zadaci se lako transformi{\f63 \u353\'3f}u na
ekvivalentni zadatak LP u
kanoni{\f63 \u269\'3f}kom obliku uz dodavanje niza jedna{\f63 \u269\'3f}ina.
\fi351 Primer 1. Maksimizirati{\i \f50 F}{\f20 (}{\i \f50 x,y}{\f20 )}{\f20 =}
{\i \f50 x}{\f20 +}{\f20 3}{\i \f50 y}, pri ograni{\f63 \u269\'3f}enjima
\cf0 \fi4147 {\i \f50 x}{\f20 +}{\f20 2}{\i \f50 y}{\f40 {\field{\*\fldinst
SYMBOL 163 \\f Symbol }}}{\f20 10 }
\fi3957 {\f40 {\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\f20 3}{\i \f50 x}{\f40
{\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\i \f50 y}{\f40 {\field{\*\fldinst
SYMBOL 163 \\f Symbol }}}{\f40 {\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\f20 15
}
\cf0 \fi351 Re{\f63 \u353\'3f}enje:{\i \f50 x}{\f20 =}{\f20 4}{\i \f50 ,y}{\f20
=}{\f20 3}{\i \f50 ,t}{\dn006 \f20 \fs14 1}{\f20 =}{\i \f50 t}{\dn006 \f20
\fs14 2}{\f20 =}{\f20 0}, max{\i \f50 F}{\f20 =}{\f20 13}{\i \f50 . }
\cf0 \fi351 Primer 2. Maksimizirati{\i \f50 F}{\f20 (}{\i \f50 x,y}{\f20 )}{\f20
=}{\i \f50 x}{\f20 +}{\f20 3}{\i \f50 y}, pri ograni{\f63 \u269\'3f}enjima
\fi4145 {\f20 3}{\i \f50 x}{\f20 +}{\i \f50 y}{\f40 {\field{\*\fldinst SYMBOL
163 \\f Symbol }}}{\f20 15 }
Re{\f63 \u353\'3f}enje: Funkcija cilja je neograni{\f63 \u269\'3f}ena, max{\i \f50
F}{\f20 =}{\f20 +}{\f40 {\field{\*\fldinst SYMBOL 165 \\f Symbol }}}.
\cf0 \fi351 Primer 3. Maksimizirati{\i \f50 F}{\f20 (}{\i \f50 x,y}{\f20 )}{\f20
=}{\i \f50 x}{\f20 +}{\f20 3}{\i \f50 y}, pri ograni{\f63 \u269\'3f}njima
\fi4145 {\f20 3}{\i \f50 x}{\f20 +}{\i \f50 y}{\f40 {\field{\*\fldinst SYMBOL
163 \\f Symbol }}}{\f20 15 }
\fi4673 {\i \f50 x}{\f40 {\field{\*\fldinst SYMBOL 179 \\f Symbol }}}{\f20 0 }
\cf0 \fi351 Re{\f63 \u353\'3f}enje:{\i \f50 x}{\f20 =}{\i \f50 t }{\dn006
\f20 \fs14 1}{\f20 =}{\f20 0}{\i \f50 ,t}{\dn006 \f20 \fs14 2}{\f20 =}{\f20
10}{\i \f50 ,y}{\f20 =}{\f20 5}, max{\i \f50 F}{\f20 =}{\f20 15}.
\cf0 \fi351 Drugi tip nestandardnih zadataka LP pojavljuje se kada se
me{\f63 \u273\'3f}u nejedna{\f63 \u269\'3f}inama na{\f63 \u273\'3f}u
\par}{\phpg\posx1156\pvpg\posy980\absw10424\absh12492 \sl-288 \f10 \fs21 \cf0 neka
ograni{\f63 \u269\'3f}enja u obliku jedna{\f63 \u269\'3f}ina. Mo{\f63
\u382\'3f}emo smatrati da ta ograni{\f63 \u269\'3f}enja dopu{\f63 \u353\'3f}taju
dopunske
promenljive 0, {\f63 \u353\'3f}to omogu{\f63 \u263\'3f}ava da zadatak prevedemo u
kanoni{\f63 \u269\'3f}ki oblik.
\cf0 \fi351 Primer 4. Maksimizirati{\i \f50 F}{\f20 (}{\i \f50 x,y,z}{\f20 )}
{\f20 =}{\f20 2}{\i \f50 x}{\f20 +}{\i \f50 y}{\f40 {\field{\*\fldinst SYMBOL
45 \\f Symbol }}}{\f20 2}{\i \f50 z} pri ograni{\f63 \u269\'3f}enjima:
\cf0 \fi4124 {\i \f50 x}{\f20 +}{\i \f50 y}{\f20 +}{\i \f50 z}{\f40
{\field{\*\fldinst SYMBOL 163 \\f Symbol }}}{\f20 1 }
\fi4433 {\i \f50 y}{\f20 +}{\f20 4}{\i \f50 z}{\f20 =}{\f20 2 }
\fi4492 {\i \f50 x,y,z}{\f40 {\field{\*\fldinst SYMBOL 179 \\f Symbol }}}{\f20
0 }
\cf0 \fi351 Re{\f63 \u353\'3f}enje:{\i \f50 x}{\f20 =}{\i \f50 t }{\dn006
\f20 \fs14 1}{\f20 =}{\f20 0}{\i \f50 ,z}{\f20 =}{\up006 \f20 \fs14 13}
{\f20 \fs14 ,}{\i \f50 y}{\f20 =}{\up006 \f20 \fs14 2}{\f20 \fs14 3}, max{\i
\f50 F}{\f20 =}{\f20 0}.
{\f20 =}{\i \f50 x}{\f20 +}{\f20 4}{\i \f50 y}{\f20 +}{\f20 2}{\i \f50 z},
pod ograni{\f63 \u269\'3f}enjima:
\cf0 \fi4007 {\i \f50 x}{\f20 +}{\f20 2}{\i \f50 y}{\f20 +}{\f20 3}{\i \f50 z}
{\f40 {\field{\*\fldinst SYMBOL 163 \\f Symbol }}}{\f20 6 }
\fi4298 {\f20 4}{\i \f50 x}{\f40 {\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\f20
7}{\i \f50 y}{\f20 =}{\f20 28 }
\fi4609 {\i \f50 x,y,z}{\f40 {\field{\*\fldinst SYMBOL 179 \\f Symbol }}}{\f20
0 }
\cf0 \fi351 Re{\f63 \u353\'3f}enje: Skup dopustivih re{\f63 \u353\'3f}enja je
prazan.
{\f20 =}{\i \f50 x}{\f20 +}{\f20 2}{\i \f50 y}{\f20 +}{\i \f50 z} pod
ograni{\f63 \u269\'3f}enjima:
\cf0 \fi4126 {\i \f50 x}{\f20 +}{\i \f50 y}{\f20 +}{\i \f50 z}{\f20 =}{\f20 6
}
\fi4530 {\i \f50 x}{\f20 +}{\i \f50 y}{\f40 {\field{\*\fldinst SYMBOL 163 \\f
Symbol }}}{\f20 1 }
\fi4717 {\i \f50 x,z}{\f40 {\field{\*\fldinst SYMBOL 179 \\f Symbol }}}{\f20
0 }\par
}
ffd8ffe000104a46494600010100000100010000ffdb004300010101010101010101010101010101010
10101010101010101010101010101010101010101010101010101010101010101010101010101010101
010101010101ffdb0043010101010101010101010101010101010101010101010101010101010101010
1010101010101010101010101010101010101010101010101010101010101010101ffc0001108034a02
5303012200021101031101ffc4001f00000105010101010101000000000000000001020304050607080
90a0bffc400b5100002010303020403050504040000017d010203000411051221314106135161072271
14328191a1082342b1c11552d1f02433627282090a161718191a25262728292a3435363738393a43444
5464748494a535455565758595a636465666768696a737475767778797a838485868788898a92939495
0102030405060708090a0bffc400b511000201020404030407050404000102770001020311040521310
61241510761711322328108144291a1b1c109233352f0156272d10a162434e125f11718191a26272829
2a35363738393a434445464748494a535455565758595a636465666768696a737475767778797a82838
0028a28a0028a28a0028a28a0028a28a0028a28
}}\par}{\phpg\posx1156\pvpg\posy2359\absw9369\absh1367 \f10 \fs44 \cf0 \f10
\fs44 \cf0 Glava 3
Dualni zadatak linearnog programiranja \par
}
Svakom zadatku LP odgovara njegov dualni zadatak.
{\fs30 3.1}{\fs30 Dualne}{\fs30 kanoni{\f63 \u269\'3f}ne}{\fs30 tabele }
{\fs30 3.2}{\fs30 Dualni}{\fs30 simpleks}{\fs30 algoritam }
{\fs30 3.3}{\fs30 Dualnost}{\fs30 u}{\fs30 nekanoni{\f63 \u269\'3f}nim}{\fs30
tabelama }
Teorija dualnosti se mo{\f63 \u382\'3f}e pro{\f63 \u353\'3f}iriti na
prilago{\f63 \u273\'3f}ene dualne nekanoni{\f63 \u269\'3f}ne tabele koje smo sreli.
U
\par}{\phpg\posx1156\pvpg\posy4664\absw10483\absh3443 \sl-288 \f10 \fs21 \cf0 ovom
poglavlju pokaza{\f63 \u263\'3f}emo oblik dualne nekanoni{\f63 \u269\'3f}ne tabele
i ilustrova{\f63 \u263\'3f}emo proceduru re{\f63 \u353\'3f}a-
\par}{\phpg\posx1156\pvpg\posy4664\absw10483\absh3443 \sl-289 \f10 \fs21 \cf0 vanja
kojom se ove tabele redukuju na dualne kanoni{\f63 \u269\'3f}ne tabele.
\fi351 Dualna kanoni{\f63 \u269\'3f}na tabela je oblika: \par
}
\cf0 ��
{\i \f50 \fs21 x}{\dn006 \f20 \fs14 1 }
\par}{\phpg\posx1751\pvpg\posy8391\absw985\absh1198 \sl-179 \f10 \fs17 \cf0 ��
{\i \f50 \fs21 a}{\dn006 \f20 \fs14 11 }
\par}{\phpg\posx1751\pvpg\posy8391\absw985\absh1198 \sl-179 \f10 \fs17 \cf0 ��
{\fs21 .}{\fs21 .. }
�� \par
}
y{\i0 \f20 \fs14 1 }
\fi143 {\i0 \f10 . }
\fi143 {\i0 \f10 . }\par
}
{\phpg\posx2100\pvpg\posy8709\absw637\absh725 \f10 \fs17 \cf0 \f10 \fs17 \cf0 ��
\par
}
\fs21 \cf0 y{\fs14 i }
y{\fs14 i}{\i0 \f20 \fs14 +1 }
\fi333 {\i0 \f10 ... }
\fi124 y{\dn006 \fs14 m }\par
}
{\phpg\posx2264\pvpg\posy9344\absw265\absh510 \f10 \fs21 \cf0 \f10 \fs21 \cf0 .
\par}{\phpg\posx2264\pvpg\posy9344\absw265\absh510 \sl-324 \f10 \fs21 \cf0 {\i \f50
a}{\dn006 \f20 \fs14 1i }\par
}
\par
}
\cf0 a{\fs14 i}{\i0 \f20 \fs14 +1}{\fs14 ,}{\i0 \f20 \fs14 1 }
\f10 ... }
a{\fs14 m}{\i0\dn006 \f20 \fs14 1 }\par
}
... \par
}
{\i \f50 \fs21 x}{\f20 \fs14 2 }
\par}{\phpg\posx3391\pvpg\posy8391\absw637\absh475 \sl-179 \f10 \fs17 \cf0 �� \par
}
... x{\dn006 \fs14 n }\par
}
... a
\fi513 {\i0 \f10 .. }
\par}{\phpg\posx5314\pvpg\posy8878\absw662\absh645 \sl-215 \i \f50 \fs21 \cf0 ...
{\i0 \f10 . }\par
}
1{\i \f50 n }\par
}
... a
\fi513 {\i0 \f10 .. }
{\i0 \f10 . }\par
}
1{\i \f50 j }\par
}
\cf0 ... a{\dn006 \fs14 ij }
a
\fi513 {\i0 \f10 .. }
\cf0 ... a{\dn006 \fs14 mj }
c{\dn006 \fs14 j }
{\i0 \f10 =0 }\par
}
\cf0 ...{\i0 \f10 . }\par
}
\cf0 i{\i0 \f20 +1},j \par
}
-1{\i \f50 c}{\dn006 \f20 \fs14 1 }
=0 \par
}
\cf0 x{\fs14 j}{\i0 \f20 \fs14 +1 }
a{\i0 \f20 \fs14 1}{\fs14 ,j}{\i0 \f20 \fs14 +1 }
\f10 .. }
\f10 . }
a{\fs14 i,j}{\i0 \f20 \fs14 +1 }
a{\fs14 i}{\i0 \f20 \fs14 +1}{\fs14 ,j}{\i0 \f20 \fs14 +1 }
\f10 ... }
a{\fs14 m,j}{\i0 \f20 \fs14 +1 }
c{\fs14 j}{\i0 \f20 \fs14 +1 }
\f10 =}s
\fi292 {\fs14 j}{\i0 \f20 \fs14 +1 }\par
}
\cf0 ... a{\dn006 \fs14 in }
a
\fi513 {\i0 \f10 .. }
\cf0 ... a{\dn006 \fs14 mn }
c{\dn006 \fs14 n }
{\i0 \f10 =}s{\dn006 \fs14 n }\par
}
\cf0 ...{\i0 \f10 . }\par
}
\cf0 i{\i0 \f20 +1},n \par
}
{\phpg\posx6624\pvpg\posy8511\absw404\absh2695 \f10 \fs21 \cf0 \f10 \fs21 \cf0 -1
\par}{\phpg\posx6624\pvpg\posy8511\absw404\absh2695 \sl-201 \par\f10 \fs21 \cf0 {\i
\f50 b}{\f20 \fs14 1 }
\par}{\phpg\posx6624\pvpg\posy8511\absw404\absh2695 \sl-351 \f10 \fs21 \cf0 ..
\par}{\phpg\posx6624\pvpg\posy8511\absw404\absh2695 \sl-215 \f10 \fs21 \cf0 .
\f50 b}{\i \f50 \fs14 i }
\f50 b}{\i \f50 \fs14 i}{\f20 \fs14 +1 }
\par}{\phpg\posx6624\pvpg\posy8511\absw404\absh2695 \sl-353 \f10 \fs21 \cf0 ...
\f50 b}{\i \f50 \fs14 m }
\f50 d }
\f50 G }\par
}
={\f40 {\field{\*\fldinst SYMBOL 45 \\f Symbol }}}0
{\f10 .. }
\par}{\phpg\posx7246\pvpg\posy8878\absw793\absh2105 \sl-215 \f20 \fs21 \cf0 {\f10 .
}
{\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\i \f50 t }
{\i \f50 \fs14 i}{\fs14 +1 }
{\f10 ... }
=-}{\i\dn006 \f50 \fs14 mt }
=}{\i \f50 F }\par
}
\cf0 Napomenimo da svakoj nezavisnoj promenljivoj bez ograni{\f63 \u269\'3f}enja
(nenegativnosti) u mak-
simizacionom zadatku LP odgovara ograni{\f63 \u269\'3f}enje u obliku jedna{\f63
\u269\'3f}ine u dualnom minimizacionom
zadatku i isto tako tako svakoj nezavisnoj promenljivoj bez ograni{\f63
\u269\'3f}enja (nenegativnosti) u min-
imizacionom zadatku odgovara ograni{\f63 \u269\'3f}enje u obliku
jedna{\f63 \u269\'3f}ine u dualnom maksimizacionom
zadatku. Ova osobina je su{\f63 \u353\'3f}tinska i omogu{\f63 \u263\'3f}ava nam da
re{\f63 \u353\'3f}imo dualne nekanoni{\f63 \u269\'3f}ne zadatke.
\fi351 Pogledati Primer 1. i Primer 2. u [?] kao i zadatke na kraju tog
poglavlja. (to su neki
\par}{\phpg\posx1156\pvpg\posy11544\absw10354\absh3797 \sl-289 \f10 \fs21 \cf0 od
zadataka za pripremu pismenog dela ispita)
{\fs30 3.4}{\fs30 Razni}{\fs30 zadaci }
\cf0 \fi286 1. Geometrijskom metodom izra{\f63 \u269\'3f}unati minimum i maksimum
funkcije cilja:
\cf0 \fi585 {\i \f50 F}{\f20 =}{\f20 2}{\f40 {\field{\*\fldinst SYMBOL 45 \\f
Symbol }}}{\f20 3}{\i \f50 x}{\dn006 \f20 \fs14 1}{\f40 {\field{\*\fldinst
SYMBOL 45 \\f Symbol }}}{\f20 2}{\i \f50 x}{\dn006 \f20 \fs14 2}{\f20 +}{\i \f50
x}{\dn006 \f20 \fs14 3}{\f40 {\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\f20 2}
{\i \f50 x}{\f20 \fs14 4}{\f40 {\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\f20
2}{\i \f50 x}{\f20 \fs14 5}, pod ograni{\f63 \u269\'3f}enjima:
\cf0 \fi4760 9 \par
}
ffd8ffe000104a46494600010100000100010000ffdb004300010101010101010101010101010101010
10101010101010101010101010101010101010101010101010101010101010101010101010101010101
010101010101ffdb0043010101010101010101010101010101010101010101010101010101010101010
1010101010101010101010101010101010101010101010101010101010101010101ffc0001108034a02
5303012200021101031101ffc4001f00000105010101010101000000000000000001020304050607080
90a0bffc400b5100002010303020403050504040000017d010203000411051221314106135161072271
14328191a1082342b1c11552d1f02433627282090a161718191a25262728292a3435363738393a43444
5464748494a535455565758595a636465666768696a737475767778797a838485868788898a92939495
0102030405060708090a0bffc400b511000201020404030407050404000102770001020311040521310
61241510761711322328108144291a1b1c109233352f0156272d10a162434e125f11718191a26272829
2a35363738393a434445464748494a535455565758595a636465666768696a737475767778797a82838
0028a28a0028a28a0028a28a0028a28a0028a28
10 \par
}
3. DUALNI ZADATAK LINEARNOG PROGRAMIRANJA \par
}
\cf0 2{\i \f50 x}{\dn006 \fs14 1}{\f40 {\field{\*\fldinst SYMBOL 45 \\f
Symbol }}}{\i \f50 x}{\dn006 \fs14 2}{\f40 {\field{\*\fldinst SYMBOL 45 \\f
Symbol }}}{\i \f50 x}{\dn006 \fs14 3} + 2 = 0
3{\i \f50 x}{\dn006 \fs14 1}{\f40 {\field{\*\fldinst SYMBOL 45 \\f Symbol }}}
3{\i \f50 x}{\dn006 \fs14 2}{\f40 {\field{\*\fldinst SYMBOL 45 \\f Symbol }}}
{\i \f50 x}{\dn006 \fs14 3}{\f40 {\field{\*\fldinst SYMBOL 45 \\f Symbol }}}
{\i \f50 x}{\dn006 \fs14 4} + 8 = 0 \par
}
3{\f40 {\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\i \f50 x}{\dn006 \fs14 1}
{\f40 {\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\i \f50 x}{\dn006 \fs14 5 }
{\i \f50 x}{\i\dn006 \f50 \fs14 i }\par
}
\f50 >}= 0{\i \f50 ,i} = 1{\i \f50 ..}5 \par
}
{\phpg\posx1442\pvpg\posy2931\absw5519\absh562 \f10 \fs21 \cf0 \f10 \fs21 \cf0 2.
Re{\f63 \u353\'3f}iti geometrijskom metodom zadatak:
Maksimizirati{\i \f50 F}{\f20 =}{\f20 2}{\i \f50 x}{\dn006 \f20 \fs14 1}{\f20
+}{\f20 5}{\i \f50 x}{\dn006 \f20 \fs14 2}, pod ograni{\f63 \u269\'3f}enjima:
\par
}
\cf0 x{\i0\dn006 \f20 \fs14 1}{\i0 \f20 +}{\i0 \f20 4}x{\i0\dn006 \f20 \fs14 2}
{\i0 \f20 +} x{\i0\dn006 \f20 \fs14 3 }
\f20 3}x{\i0\dn006 \f20 \fs14 1}{\i0 \f20 +} x{\i0\dn006 \f20 \fs14 2}{\i0 \f20
+} x{\i0\dn006 \f20 \fs14 4 }\par
}
x{\i0\dn006 \f20 \fs14 1 }\par
}
{\i \f50 x}{\dn006 \fs14 2} +{\i \f50 x}{\dn006 \fs14 5 }
{\i \f50 x}{\i\dn006 \f50 \fs14 i }\par
}
24
\f50 > } = 0;{\i \f50 i} = 1{\i \f50 ,} 2{\i \f50 ,} 3{\i \f50 ,} 4{\i \f50 ,}
5 \par
}
Algebarskom simpleks metodom minimizirati{\i \f50 F}{\f20 =}{\f20 4}{\i \f50 x}
{\dn006 \f20 \fs14 1}{\f20 +}{\f20 47}{\i \f50 x}{\dn006 \f20 \fs14 2}{\f20 +}
{\f20 13}{\i \f50 x}{\dn006 \f20 \fs14 3}{\f20 +}{\f20 26}{\i \f50 x}{\dn006
\f20 \fs14 4 }
pri ograni{\f63 \u269\'3f}enjima \par
}
\f50 \fs21 \cf0 x{\i0\dn006 \f20 \fs14 1}{\i0 \f20 +} x{\i0\dn006 \f20 \fs14 2 }
\fi117 {\i0 \f20 6}x{\i0\dn006 \f20 \fs14 1}{\i0 \f20 +}{\i0 \f20 13}x{\i0\dn006
\f20 \fs14 3 }
{\i0 \f20 24}x{\i0\dn006 \f20 \fs14 2}{\i0 \f20 +}{\i0 \f20 13}x{\i0\dn006
\f20 \fs14 4 }
}
=}{\f20 30 }
=}{\f20 96 }
}
\cf0 x{\dn006 \fs14 i}{\i0 \f40 {\field{\*\fldinst SYMBOL 179 \\f Symbol }}}
{\i0 \f20 0},i{\i0 \f20 =}{\i0 \f20 1},...,{\i0 \f20 4 }\par
}
Algebarskom simpleks metodom maksimizirati{\i \f50 F}{\f20 =}{\f20 14}{\i \f50
x}{\dn006 \f20 \fs14 1}{\f20 +}{\f20 7}{\i \f50 x}{\dn006 \f20 \fs14 2}{\f20
+}{\f20 10}{\i \f50 x}{\dn006 \f20 \fs14 3 }
}
\fs21 \cf0 5{\i \f50 x}{\dn006 \fs14 1} +{\i \f50 x}{\dn006 \fs14 2} + 2{\i \f50
x}{\dn006 \fs14 3 }
\par}{\phpg\posx4780\pvpg\posy8908\absw2067\absh1316 \sl-144 \par\f20 \fs21 \cf0 4
5,{\i \f50 x}{\i \f50 }{\dn006 \fs14 1} + 3{\i \f50 x}{\dn006 \fs14 2} +
2{\i \f50 ,} 5{\i \f50 x}{\dn006 \fs14 3 }
\fi221 1 5,{\i \f50 x}{\i \f50 }{\dn006 \fs14 1} + 4{\i \f50 x}{\dn006 \fs14
2} + 3{\i \f50 x}{\dn006 \fs14 3 }
3{\i \f50 x}{\dn006 \fs14 1} + 2{\i \f50 ,} 5{\i \f50 x}{\dn006 \fs14 2} +
5{\i \f50 x}{\dn006 \fs14 3 }
\fi1161 {\i \f50 x}{\dn006 \fs14 1}{\i \f50 ,x}{\dn006 \fs14 2}{\i \f50 ,x}
{\dn006 \fs14 3 }\par
}
}
Algebarskom simpleks metodom minimizirati{\i \f50 F}{\f20 =}{\f40
{\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\i \f50 x}{\dn006 \f20 \fs14 4}{\f20
+}{\i \f50 x}{\dn006 \f20 \fs14 5 }
}
\cf0 x{\i0\dn006 \f20 \fs14 1}{\i0 \f20 +} x{\i0\dn006 \f20 \fs14 4}{\i0 \f40
{\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\i0 \f20 2}x{\i0\dn006 \f20 \fs14 5 }
{\i0 \f20 2}x{\i0\dn006 \f20 \fs14 4}{\i0 \f20 +} x{\i0\dn006 \f20 \fs14 5 }
x{\i0\dn006 \f20 \fs14 3}{\i0 \f20 +}{\i0 \f20 3}x{\i0\dn006 \f20 \fs14 4}
{\i0 \f20 +} x{\i0\dn006 \f20 \fs14 5 }\par
}
\par
}
\fs21 \cf0 x{\dn006 \fs14 i}{\i0 \f40 {\field{\*\fldinst SYMBOL 179 \\f Symbol
}}}{\i0 \f20 0},i{\i0 \f20 =}{\i0 \f20 1},{\i0 \f20 2},...,{\i0 \f20 5 }
\cf0 {\i0 \f10 6.}{\i0 \f10 Re{\f63 \u353\'3f}iti}{\i0 \f10 svaki}{\i0 \f10 od}
{\i0 \f10 zadataka}{\i0 \f10 linearanog}{\i0 \f10 programiranja}{\i0 \f10
koriste{\f63 \u263\'3f}i}{\i0 \f10 simpleks}{\i0 \f10 tabele. }
\fi299 {\i0 \f10 a)}{\i0 \f10 Maksimizirati} F{\i0 \f20 (}x,y{\i0 \f20 )}{\i0
\f20 =} x
\fi299 {\i0 \f10 pri}{\i0 \f10 ograni{\f63 \u269\'3f}enjima }\par
}
\f50 \fs21 \cf0 x{\i0 \f20 +} y{\i0 \f40 {\field{\*\fldinst SYMBOL 163 \\f Symbol
}}}{\i0 \f20 1},
{\i0 \f10 b)}{\i0 \f10 Minimizirati} G{\i0 \f20 (}x,y{\i0 \f20 )}{\i0 \f20 =}
y{\i0 \f40 {\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\i0 \f20 5}x \par
}
\cf0 x{\i0 \f40 {\field{\*\fldinst SYMBOL 45 \\f Symbol }}} y{\i0 \f40
{\field{\*\fldinst SYMBOL 179 \\f Symbol }}}{\i0 \f20 1}, \par
}
\cf0 y{\i0 \f40 {\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\i0 \f20 2}x{\i0 \f40
{\field{\*\fldinst SYMBOL 179 \\f Symbol }}}{\i0 \f20 1}, \par
}
\cf0 x,y{\i0 \f40 {\field{\*\fldinst SYMBOL 179 \\f Symbol }}}{\i0 \f20 0 }\par
}
ffd8ffe000104a46494600010100000100010000ffdb004300010101010101010101010101010101010
10101010101010101010101010101010101010101010101010101010101010101010101010101010101
010101010101ffdb0043010101010101010101010101010101010101010101010101010101010101010
1010101010101010101010101010101010101010101010101010101010101010101ffc0001108034a02
5303012200021101031101ffc4001f00000105010101010101000000000000000001020304050607080
90a0bffc400b5100002010303020403050504040000017d010203000411051221314106135161072271
14328191a1082342b1c11552d1f02433627282090a161718191a25262728292a3435363738393a43444
5464748494a535455565758595a636465666768696a737475767778797a838485868788898a92939495
0102030405060708090a0bffc400b511000201020404030407050404000102770001020311040521310
61241510761711322328108144291a1b1c109233352f0156272d10a162434e125f11718191a26272829
2a35363738393a434445464748494a535455565758595a636465666768696a737475767778797a82838
0028a28a0028a28a0028a28a0028a28a0028a28
\cf0 3.4. RAZNI ZADACI
\fi585 pri ograni{\f63 \u269\'3f}enjima
\fi3603 {\i \f50 x}{\f40 {\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\i \f50 y}
{\f40 {\field{\*\fldinst SYMBOL 179 \\f Symbol }}}{\f20 1}{\i \f50 , }
\fi585 c) Minimizirati{\i \f50 g}{\f20 (}{\i \f50 x,y,z}{\f20 )}{\f20 =}{\f40
{\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\i \f50 x}{\f40 {\field{\*\fldinst
SYMBOL 45 \\f Symbol }}}{\i \f50 y }
pri ograni{\f63 \u269\'3f}enjima
\fi2909 {\f20 3}{\i \f50 x}{\f20 +}{\f20 6}{\i \f50 y}{\f20 +}{\f20 2}{\i \f50
z}{\f40 {\field{\*\fldinst SYMBOL 163 \\f Symbol }}}{\f20 6; }
\fi585 d)
\fi4121 {\i \f50 x}{\i \f50 y }
1 -1
-2 1
2 -1
\fi585 e) \par
}
\fs21 \cf0 x
\par}{\phpg\posx5267\pvpg\posy6585\absw263\absh745 \sl-288 \i \f50 \fs21 \cf0 \fi72
y
{\i0 \f10 -1 }\par
}
\cf0 -2
1
1
={\dn006 \f20 \fs14 1t }\par
}
\par
}
y{\i0 \f40 {\field{\*\fldinst SYMBOL 163 \\f Symbol }}}{\i0 \f20 8}, \par
}
x,y{\i0 \f40 {\field{\*\fldinst SYMBOL 179 \\f Symbol }}}{\i0 \f20 0 }\par
}
\cf0 y{\i0 \f20 +} z{\i0 \f40 {\field{\*\fldinst SYMBOL 179 \\f Symbol }}}{\i0
\f20 1; }\par
}
\cf0 x,y,z{\i0 \f40 {\field{\*\fldinst SYMBOL 179 \\f Symbol }}}{\i0 \f20 0 }\par
}
\par}{\phpg\posx6145\pvpg\posy4422\absw263\absh1005 \sl-288 \f10 \fs21 \cf0 \fi78 3

\par
}
\par}{\phpg\posx6580\pvpg\posy4711\absw183\absh745 \sl-288 \f10 \fs21 \cf0 =
\par}{\phpg\posx6580\pvpg\posy4711\absw183\absh745 \sl-288 \f10 \fs21 \cf0 = \par
}
{\phpg\posx7001\pvpg\posy4711\absw256\absh745 \f10 \fs21 \cf0 \f10 \fs21 \cf0 -
{\dn006 \f20 \fs14 1t }
\par}{\phpg\posx7001\pvpg\posy4711\absw256\absh745 \sl-289 \f10 \fs21 \cf0 -{\dn006
\f20 \fs14 2t }
{\i \f50 F }\par
}
\cf0 1
-2
0
={\dn006 \f20 \fs14 2t }\par
}
\cf0 -3
-2
0
\f50 G }\par
}
{\phpg\posx1741\pvpg\posy8102\absw193\absh225 \f10 \fs21 \cf0 \f10 \fs21 \cf0 f)
\par
}
x \par
}
y \par
}
\par
}
-1 -2 = -{\dn006 \f20 \fs14 1t }\par
}
-2 \par
}
\par}{\phpg\posx5277\pvpg\posy9614\absw263\absh485 \sl-288 \f10 \fs21 \cf0 -1 \par
}
}
\par}{\phpg\posx6223\pvpg\posy9326\absw165\absh745 \sl-288 \f10 \fs21 \cf0 1
}
\par}{\phpg\posx6580\pvpg\posy9326\absw183\absh745 \sl-288 \f10 \fs21 \cf0 =
\par}{\phpg\posx6580\pvpg\posy9326\absw183\absh745 \sl-288 \f10 \fs21 \cf0 = \par
}
{\phpg\posx7001\pvpg\posy9326\absw287\absh745 \f10 \fs21 \cf0 \f10 \fs21 \cf0 -
{\dn006 \f20 \fs14 2t }
\par}{\phpg\posx7001\pvpg\posy9326\absw287\absh745 \sl-288 \f10 \fs21 \cf0 -{\dn006
\f20 \fs14 3t }
\par}{\phpg\posx7001\pvpg\posy9326\absw287\absh745 \sl-253 \f10 \fs21 \cf0 \fi104 F
\par
}
Na{\f63 \u263\'3f}i sva re{\f63 \u353\'3f}enja slede{\f63 \u263\'3f}ih zadataka
linearnog programiranja:
a) \par
}
\cf0 x y \par
}
}
}
\cf0 z
\fi40 {\i0 \f10 1 }
\fi40 {\i0 \f10 1 }\par
}
\cf0 u
\fi27 {\i0 \f10 -1 }
\fi27 {\i0 \f10 -1 }\par
}
-1 -12 \par
}
3
3
0 \par
}
={\f40 {\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\dn006 \f20 \fs14 1t }
{\field{\*\fldinst SYMBOL 45 \\f Symbol }}}{\dn006 \f20 \fs14 2t }
\f50 F }\par
}
b) \par
}
\fs21 \cf0 x
\fi72 y
\f10 -1 }\par
}
\fs21 \cf0 -1
-1
-2
={\dn006 \f20 \fs14 1t }\par
}
\fs21 \cf0 -1
1
1
={\dn006 \f20 \fs14 2t }\par
}
\fs21 \cf0 -1
-1
0
={\i \f50 G }\par
}
ffd8ffe000104a46494600010100000100010000ffdb004300010101010101010101010101010101010
10101010101010101010101010101010101010101010101010101010101010101010101010101010101
010101010101ffdb0043010101010101010101010101010101010101010101010101010101010101010
1010101010101010101010101010101010101010101010101010101010101010101ffc0001108034a02
5303012200021101031101ffc4001f00000105010101010101000000000000000001020304050607080
90a0bffc400b5100002010303020403050504040000017d010203000411051221314106135161072271
14328191a1082342b1c11552d1f02433627282090a161718191a25262728292a3435363738393a43444
5464748494a535455565758595a636465666768696a737475767778797a838485868788898a92939495
0102030405060708090a0bffc400b511000201020404030407050404000102770001020311040521310
61241510761711322328108144291a1b1c109233352f0156272d10a162434e125f11718191a26272829
2a35363738393a434445464748494a535455565758595a636465666768696a737475767778797a82838
0028a28a0028a28a0028a28a0028a28a0028a28
12 \par
}
\cf0 GLAVA 3. DUALNI ZADATAK LINEARNOG PROGRAMIRANJA
\par}{\phpg\posx1442\pvpg\posy345\absw9350\absh899 \sl-223 \par\par\f10 \fs21 \cf0
8. Minimizirati{\i \f50 G}{\f20 (}{\i \f50 y}{\dn006 \f20 \fs14 1}{\i \f50 ,y}
{\dn006 \f20 \fs14 2}{\i \f50 ,y}{\dn006 \f20 \fs14 3}{\f20 )}{\f20 =}{\i \f50
y}{\dn006 \f20 \fs14 1}{\f20 +}{\f20 2}{\i \f50 y}{\f20 \fs14 2}{\f20 +}{\f20
3}{\i \f50 y }{\f20 \fs14 3} pri ograni{\f63 \u269\'3f}enjima \par
}
\f50 \fs21 \cf0 y{\i0\dn006 \f20 \fs14 1}{\i0 \f20 +} y{\i0\dn006 \f20 \fs14 2}
{\i0 \f20 +} y{\i0\dn006 \f20 \fs14 3 }
\fi3858 y{\i0\dn006 \f20 \fs14 1}{\i0 \f20 +} y{\i0\dn006 \f20 \fs14 3 }
\fi3741 {\i0 \f20 2}y{\i0\dn006 \f20 \fs14 2}{\i0 \f20 +} y{\i0\dn006 \f20 \fs14
3 }
\fi3728 y{\i0\dn006 \f20 \fs14 1},y{\i0\dn006 \f20 \fs14 2},y{\i0\dn006 \f20
\fs14 3 }
{\i0 \f10 a)}{\i0 \f10 Postaviti}{\i0 \f10 dualni}{\i0 \f10 maksimizacioni}{\i0
\f10 zadatak. }\par
}
\cf0 >{\i0 \f20 =}{\i0 \f20 1 }
>{\i0 \f20 =}{\i0 \f20 1 }
\f20 =}{\i0 \f20 1 }
>{\i0 \f20 =}{\i0 \f20 0 }\par
}
{\phpg\posx1918\pvpg\posy3283\absw9462\absh485 \f10 \fs21 \cf0 \f10 \fs21 \cf0 b)
Re{\f63 \u353\'3f}iti oba zadatka koriste{\f63 \u263\'3f}i dualnu tabelu. Ako bilo
koji od zadataka ima beskona{\f63 \u269\'3f}no
mnogo re{\f63 \u353\'3f}enja, na{\f63 \u263\'3f}i sva re{\f63 \u353\'3f}enja. \par
}
Potrebno je izgraditi odre{\f63 \u273\'3f}en PVO sistem. Poznato je da
protivnik raspola{\f63 \u382\'3f}e sa 100
\fi299 aviona za dejstvo sa malih visina, 150 aviona za dejstvo sa srednjih visina
i 100 aviona za
\fi299 dejstvo sa velikih visina, ali se ne zna sa koje {\f63 \u263\'3f}e visine
dejstvovati. Mo{\f63 \u382\'3f}emo obezbediti
\fi299 dva tipa raketa. Prvi tip raketa obara avione sa verovatno{\f63
\u263\'3f}ama 3/4, 1/2, 1/4 respektivno,
\fi299 a drugi tip sa verovatno{\f63 \u263\'3f}ama 1/4, 1/2, 3/4, zavisno od visine
leta. Prvi tip rakete staje
\fi299 25 a drugi 50 n.j. po komadu. Koliko kojih raketa je nu{\f63 \u382\'3f}no
obezbediti pa da o{\f63 \u269\'3f}ekivani
\fi299 broj oborenih aviona ne bude manji od broja aviona koji mogu dejstvovati.
Pri tome
\fi299 izdatke za nabavke raketa svesti na najmanju mogu{\f63 \u263\'3f}u meru.
\cf0 \fi488 a) Sastaviti matemati{\f63 \u269\'3f}ki model problema.
\fi475 b) Napisati dualni problem datom problemu i re{\f63 \u353\'3f}iti ih
dualnom simpleks metodom.
\fi501 c) Napraviti postoptimalnu analizu problema ({\f63 \u353\'3f}ta zna{\f63
\u269\'3f}i koja promenljiva) i odgovoriti
\fi814 da li napada{\f63 \u269\'3f} mo{\f63 \u382\'3f}e, i za koliko da
pove{\f63 \u263\'3f}a broj nekog od tipova aviona, a da branilac
\fi814 ne mora da ula{\f63 \u382\'3f}e dodatna sredstva za nabavku raketa. \par
}
10. U {\f63 \u353\'3f}umi se nalazi 4 vrste jestive pe{\f63 \u269\'3f}urke. U
razli{\f63 \u269\'3f}itom vremenskom periodu prvi bera{\f63 \u269\'3f}
\fi416 B1 raspola{\f63 \u382\'3f}e sa 80 radnih {\f63 \u269\'3f}asova berbe, drugi
bera{\f63 \u269\'3f} B2 sa 70 {\f63 \u269\'3f}asova berbe, a tre{\f63 \u263\'3f}i
bera{\f63 \u269\'3f}
\fi416 B3 sa 75 {\f63 \u269\'3f}asova berbe. Za kilu prve vrste pe{\f63
\u269\'3f}urke P1 bera{\f63 \u269\'3f}B1 treba da utro{\f63 \u353\'3f}i 1/2
{\f63 \u269\'3f}asa
\fi416 berbe, b2 3/4 {\f63 \u269\'3f}asa berbe, a B3 1 {\f63 \u269\'3f}as berbe. Za
pe{\f63 \u269\'3f}urku P2 bera{\f63 \u269\'3f} B1 utro{\f63 \u353\'3f}i 2 {\f63
\u269\'3f}asa berbe,
\fi416 B2 1 {\f63 \u269\'3f}as berbe, a B3 1/2 {\f63 \u269\'3f}asa berbe. Za P3
bera{\f63 \u269\'3f} B1 utro{\f63 \u353\'3f}i 1/4 {\f63 \u269\'3f}asa, B2 3/4 {\f63
\u269\'3f}asa, a
\fi416 B3 1/2 {\f63 \u269\'3f}asa berbe. Branje pe{\f63 \u269\'3f}urke P4 zahteva
od bera{\f63 \u269\'3f}a B1 2 {\f63 \u269\'3f}asa berbe, od B2 3 {\f63
\u269\'3f}asa
\fi416 berbe, a od B3 1 {\f63 \u269\'3f}as berbe. Na pijacama bera{\f63
\u269\'3f}i prodaju pe{\f63 \u269\'3f}urke po slede{\f63 \u263\'3f}im cenama:
\fi416 P1 za 50 din/kg, P2 za 60 din/kg, P3 za 45 din/kg, a P4 za 90 din/kg. Na
pijacama
\fi416 se mo{\f63 \u382\'3f}e prodati najvisv e 100 kg pe{\f63 \u269\'3f}urki P1,
90kg P2, 120kg P3 i 70kg P4. Odrediti
\fi416 optimalni plan berbe,ako se podrazumeva da sva tri bera{\f63 \u269\'3f}a
rade zajedno, da bi se dobila
\fi416 maksimalna zarada. Postaviti primarni i dualni problem LP, a zatim
re{\f63 \u353\'3f}iti oba problema.
11. U jednom pogonu treba da se proizvode dve vrste proizvoda na tri ma{\f63
\u353\'3f}ine. Norma {\f63 \u269\'3f}asovi
\fi416 obrade , raspolo{\f63 \u382\'3f}ivi kapaciteti ma{\f63 \u353\'3f}ina i
finansijski efekti dati su u tabeli : \par
}
\cf0 M{\i0\dn006 \f20 \fs14 1 }
M{\i0\dn006 \f20 \fs14 2 }
M{\i0\dn006 \f20 \fs14 3 }\par
}
\cf0 P{\i0\dn006 \f20 \fs14 1 }
{\i0 \f10 2 }
{\i0 \f10 4 }
{\i0 \f10 3 }\par
}
\cf0 P{\i0 \f20 \fs14 2 }
{\i0 \f10 4 }
{\i0 \f10 2 }
{\i0 \f10 0 }\par
}
Kapacitet
\par
}
Dobit 6000 4000 \par
}
ffd8ffe000104a46494600010100000100010000ffdb004300010101010101010101010101010101010
10101010101010101010101010101010101010101010101010101010101010101010101010101010101
010101010101ffdb0043010101010101010101010101010101010101010101010101010101010101010
1010101010101010101010101010101010101010101010101010101010101010101ffc0001108034a02
5303012200021101031101ffc4001f00000105010101010101000000000000000001020304050607080
90a0bffc400b5100002010303020403050504040000017d010203000411051221314106135161072271
14328191a1082342b1c11552d1f02433627282090a161718191a25262728292a3435363738393a43444
5464748494a535455565758595a636465666768696a737475767778797a838485868788898a92939495
0102030405060708090a0bffc400b511000201020404030407050404000102770001020311040521310
61241510761711322328108144291a1b1c109233352f0156272d10a162434e125f11718191a26272829
2a35363738393a434445464748494a535455565758595a636465666768696a737475767778797a82838
0028a28a0028a28a0028a28a0028a28a0028a28
\fi585 Na{\f63 \u263\'3f}i optimalni program proizvodnje koji {\f63 \u263\'3f}e
obezbediti maksimalni dohodak.
\fi863 {\f0\fs28 \bullet }{\f40 } Problem re{\f63 \u353\'3f}iti pomo{\f63
\u263\'3f}u simpleks tabele.
{\f0\fs28 \bullet }{\f40 } Objasniti zna{\f63 \u269\'3f}enje promenljivih u
modelu.
{\f0\fs28 \bullet }{\f40 } Da li optimalno re{\f63 \u353\'3f}enje zna{\f63
\u269\'3f}i i potpuno iskori{\f63 \u353\'3f}{\f63 \u263\'3f}enje ma{\f63
\u353\'3f}ina? \par
}
\par
}
\fs21 \cf0 Re{\f63 \u353\'3f}enje: X*=(12,6,0,0,60 ), F(X*)=96000.
12. Jedna pekara se specijalizovala za proizvodnju tri vrste peciva:
poga{\f63 \u269\'3f}e od 800g, hleb
\fi416 od 400g i ki{\f63 \u64258\'3f}e od 300g. Poizvodnja peciva se vr{\f63
\u353\'3f}i u dve faze: od pripremljenog testa
\fi416 se na ma{\f63 \u353\'3f}ini za me{\f63 \u353\'3f}enje (M1) oblikuju
odgovaraju{\f63 \u263\'3f}a peciva, a zatim se peku u pe{\f63 \u263\'3f}i (P).
\fi416 Trajanje (u minutima) me{\f63 \u353\'3f}enja i pecv enja ovih peciva, kao i
jedini{\f63 \u269\'3f}ni tro{\f63 \u353\'3f}kovi proizvodnje
\fi416 (u parama) su dati u tabeli: \par
}
{\phpg\posx5853\pvpg\posy5647\absw1813\absh225 \f10 \fs21 \cf0 \f10 \fs21 \cf0 M1
P tro{\f63 \u353\'3f}kovi \par
}
poga{\f63 \u269\'3f}a 7 \par
}
{\phpg\posx4905\pvpg\posy6241\absw571\absh493 \f10 \fs21 \cf0 \f10 \fs21 \cf0 hleb
ki{\f63 \u64258\'3f}a \par
}
}
}
}
\fs21 \cf0 Za pe{\f63 \u269\'3f}enje mo{\f63 \u382\'3f}e da radi 600 minuta dnevno,
a ma{\f63 \u353\'3f}ina za me{\f63 \u353\'3f}enje, koja predstavlja usko
\fi416 grlo u proizvodnji i {\f63 \u269\'3f}iji je kapacitet uvek u potpunosti
iskori{\f63 \u353\'3f}{\f63 \u263\'3f}en, 560 minuta dnevno.
\fi416 Potrebno je odrediti koli{\f63 \u269\'3f}inu poga{\f63 \u269\'3f}a, hleba i
ki{\f63 \u64258\'3f}i koju treba ispe{\f63 \u263\'3f}i za 5 dana, koje {\f63
\u263\'3f}e
\fi416 obezbediti minimalne tro{\f63 \u353\'3f}kove proizvodnje, ako se mora
utro{\f63 \u353\'3f}iti bar 160 kg testa.
\fi416 a) Formulisati matemati{\f63 \u269\'3f}ki model
\fi416 b) Odrediti sva optimalna re{\f63 \u353\'3f}enja i objasniti jedno od njih
\fi416 c) Odrediti da li dolazi do promene optimalnog re{\f63 \u353\'3f}enja ako je
potrebno:
\cf0 \fi694 {\f0\fs28 \bullet }{\f40 } maksimizirati ukupnu koli{\f63
\u269\'3f}inu peciva
\fi694 {\f0\fs28 \bullet }{\f40 } maksimizirati iskori{\f63 \u353\'3f}{\f63
\u263\'3f}enost kapacieta ma{\f63 \u353\'3f}ina
\fi694 {\f0\fs28 \bullet }{\f40 } utro{\f63 \u353\'3f}iti najmanje 200 kg testa
13. Pekara proizvodi tri vrste bureka: burek sa sirom od 1kg, burek sa mesom od 1
kg i prazan
\fi416 burek od 2 kg. Sve tri vrste bureka pravi pekar, koji dnevno radi
ta{\f63 \u269\'3f}no 420 minuta, a
\fi416 burek se zatim pe{\f63 \u269\'3f}e u pe{\f63 \u263\'3f}i {\f63 \u269\'3f}iji
je dnevni kapacitet 500 minuta. Trajanje (u minutima)
\fi416 pravljenja i pe{\f63 \u269\'3f}enja bureka, kao i jedini{\f63 \u269\'3f}ni
tro{\f63 \u353\'3f}kovi proizvodnje (u dinarima) su dati u
\fi416 tabeli:
\cf0 \fi4790 pekar pe{\f63 \u263\'3f} tro{\f63 \u353\'3f}kovi \par
}
burek sa sirom
\par}{\phpg\posx4229\pvpg\posy13389\absw1805\absh760 \sl-296 \f10 \fs21 \cf0 burek
sa mesom
\par}{\phpg\posx4229\pvpg\posy13389\absw1805\absh760 \sl-296 \f10 \fs21 \cf0 prazan
burek \par
}
}
}
}
Potrebno je odrediti koliko bureka i koje vrste treba ispe{\f63 \u263\'3f}i za 5
dana, tako da tro{\f63 \u353\'3f}kovi
proizvodnje budu minimalni i da bude ukupno napravljeno bar 1200 kg bureka. \par
}
ffd8ffe000104a46494600010100000100010000ffdb004300010101010101010101010101010101010
10101010101010101010101010101010101010101010101010101010101010101010101010101010101
010101010101ffdb0043010101010101010101010101010101010101010101010101010101010101010
1010101010101010101010101010101010101010101010101010101010101010101ffc0001108034a02
5303012200021101031101ffc4001f00000105010101010101000000000000000001020304050607080
90a0bffc400b5100002010303020403050504040000017d010203000411051221314106135161072271
14328191a1082342b1c11552d1f02433627282090a161718191a25262728292a3435363738393a43444
5464748494a535455565758595a636465666768696a737475767778797a838485868788898a92939495
0102030405060708090a0bffc400b511000201020404030407050404000102770001020311040521310
61241510761711322328108144291a1b1c109233352f0156272d10a162434e125f11718191a26272829
2a35363738393a434445464748494a535455565758595a636465666768696a737475767778797a82838
0028a28a0028a28a0028a28a0028a28a0028a28
14 \par
}
\fs21 \cf0 GLAVA 3. DUALNI ZADATAK LINEARNOG PROGRAMIRANJA
\par}{\phpg\posx1918\pvpg\posy345\absw8874\absh2439 \sl-317 \par\f10 \fs21 \cf0 a)
Formulisati matemati{\f63 \u269\'3f}ki model
\par}{\phpg\posx1918\pvpg\posy345\absw8874\absh2439 \sl-384 \f10 \fs21 \cf0 b)
Odrediti sva optimalna re{\f63 \u353\'3f}enja i objasniti jedno od njih
c) Odrediti da li dolazi do promene optimalnog re{\f63 \u353\'3f}enja ako je
potrebno:
- maksimizirati ukupnu koli{\f63 \u269\'3f}inu bureka
- maksimizirati iskori{\f63 \u353\'3f}{\f63 \u263\'3f}enost kapacieta pe{\f63
\u263\'3f}i
- napraviti najmanje 1600 kg bureka \par
}
14. Jedna tka{\f63 \u269\'3f}nica proizvodi tri vrste tkanina kao me{\f63
\u353\'3f}avinu pamuka i vune. Jedan metar
\fi416 najtanje tkanine ({\i \f50 T }{\dn006 \f20 \fs14 1}) sadr{\f63 \u382\'3f}i
200g pamuka i 100g vune; metar tkanine srednje debljine
\fi416 ({\i \f50 T}{\dn006 \f20 \fs14 2}) sadr{\f63 \u382\'3f}i 100g pamuka i 300g
vune, a metar najdeblje tkanine ({\i \f50 T}{\dn006 \f20 \fs14 3}) sadrzv i po
200g
\fi416 pamuka i vune. U skladi{\f63 \u353\'3f}tu tka{\f63 \u269\'3f}nice se nalazi
50 kg vune, koja se, zbog neodgovaraju{\f63 \u263\'3f}ih
\fi416 uslova skladi{\f63 \u353\'3f}tenja, mora odmah potro{\f63 \u353\'3f}iti i 40
kg pamuka. Tro{\f63 \u353\'3f}kovi proizvodnje po metru
\cf0 \fi416 tkanine{\i \f50 T}{\dn006 \f20 \fs14 1},{\i \f50 T}{\dn006 \f20
\fs14 2} i{\i \f50 T}{\dn006 \f20 \fs14 3} iznose 25, 30 i 26 nov{\f63
\u269\'3f}anih jedinica, respektivno.
\cf0 \fi605 a) Formulisati matemati{\f63 \u269\'3f}ki model minimizacije ukupnih
tro{\f63 \u353\'3f}kova proizvodnje tkanina,
\fi931 ako se zahteva da se proizvede najmanje 10 metara vi{\f63 \u353\'3f}e
tkanine tipa{\i \f50 T}{\dn006 \f20 \fs14 1} nego tipa
\fi931 {\i \f50 T} .2
\fi592 b) Formulisati dualni model modela pod a)
\fi618 c) Odrediti optimalno re{\f63 \u353\'3f}enje modela pod b), a zatim
odrediti i objasniti optimalno
\fi931 re{\f63 \u353\'3f}enje modela pod a)
\fi592 d) Da li dolazi do promene optimalnog re{\f63 \u353\'3f}enja ako se zahteva
da ukupna du{\f63 \u382\'3f}ina tkanina
\fi931 bude maksimalna
\fi618 e) Da li dolazi do promene opt. re{\f63 \u353\'3f}enja ako se koli{\f63
\u269\'3f}ina vune u skladi{\f63 \u353\'3f}tu smanji za 8 kg
\fi634 f) Odrediti optimalno re{\f63 \u353\'3f}enje ako je potrebno da du{\f63
\u382\'3f}ina najtanje tkanine bude naj-
\fi931 manje onolika kolika je ukupna du{\f63 \u382\'3f}ina druge dve tkanine
zajedno \par
}
Dat je problem linearnog programiranja:
\fi416 Na{\f63 \u263\'3f}i maksimum funkcije cilja{\i \f50 F}{\f20 (}{\i \f50 X}
{\f20 )}{\f20 =}{\i \f50 x}{\dn006 \f20 \fs14 1}{\f40 {\field{\*\fldinst SYMBOL
45 \\f Symbol }}}{\i \f50 x}{\dn006 \f20 \fs14 2}{\f20 +}{\f20 2}{\i \f50 x}
{\dn006 \f20 \fs14 3}, pod ograni{\f63 \u269\'3f}enjima: \par
}
\fs21 \cf0 x{\i0\dn006 \f20 \fs14 1}{\i0 \f20 +} x{\i0\dn006 \f20 \fs14 2}{\i0
\f20 +} x{\i0\dn006 \f20 \fs14 3 }
\fi3302 x{\i0\dn006 \f20 \fs14 1}{\i0 \f40 {\field{\*\fldinst SYMBOL 45 \\f
Symbol }}}{\i0 \f20 2}x{\i0\dn006 \f20 \fs14 2}{\i0 \f20 +} x{\i0\dn006 \f20
\fs14 3 }
\fi3753 {\i0 \f40 {\field{\*\fldinst SYMBOL 45 \\f Symbol }}}x{\i0\dn006 \f20 \fs14
2}{\i0 \f20 +} x{\i0\dn006 \f20 \fs14 3 }
\fi3251 x{\i0\dn006 \f20 \fs14 1}{\i0 \f40 {\field{\*\fldinst SYMBOL 179 \\f
Symbol }}}{\i0 \f20 0},x{\i0\dn006 \f20 \fs14 3}{\i0 \f40 {\field{\*\fldinst
SYMBOL 179 \\f Symbol }}}{\i0 \f20 0 }
\cf0 {\i0 \f10 a.}{\i0 \f10 Postaviti}{\i0 \f10 dualni}{\i0 \f10 problem,}
{\i0 \f10 datog}{\i0 \f10 problema. }\par
}
=}{\f20 7 }\par
}
\fs21 \cf0 b. Dualnim simplex algoritmom prona{\f63 \u263\'3f}i optimalno
re{\f63 \u353\'3f}enje.
Napomena Obratiti pa{\f63 \u382\'3f}nju na ograni{\f63 \u269\'3f}enje tipa
jednakost, kao i na to da sve promenljive ne
\fi1209 zadovoljavaju uslov nenegativnosti. \par
}
16. Uprava fabrike sokova ho{\f63 \u263\'3f}e u ovoj godini da lansira novu grupu
proizvoda - sokove od
\fi416 dunja. Za tu svrhu je otkupljeno 2000 litara ka{\f63 \u353\'3f}e od dunja.
Ova ka{\f63 \u353\'3f}a ne mo{\f63 \u382\'3f}e da se
\fi416 iskoristi za neku od ve{\f63 \u263\'3f} postoje{\f63 \u263\'3f}ih vrsta
sokova i zbog toga mora potpuno da se iskoristi
\fi416 za nove proizvode. Sokovi od dunja {\f63 \u263\'3f}e biti u pakovanjima od
jednog litra i proizvodi{\f63 \u263\'3f}e se
\fi416 u 3 varijante: \par
}
ffd8ffe000104a46494600010100000100010000ffdb004300010101010101010101010101010101010
10101010101010101010101010101010101010101010101010101010101010101010101010101010101
010101010101ffdb0043010101010101010101010101010101010101010101010101010101010101010
1010101010101010101010101010101010101010101010101010101010101010101ffc0001108034a02
5303012200021101031101ffc4001f00000105010101010101000000000000000001020304050607080
90a0bffc400b5100002010303020403050504040000017d010203000411051221314106135161072271
14328191a1082342b1c11552d1f02433627282090a161718191a25262728292a3435363738393a43444
5464748494a535455565758595a636465666768696a737475767778797a838485868788898a92939495
0102030405060708090a0bffc400b511000201020404030407050404000102770001020311040521310
61241510761711322328108144291a1b1c109233352f0156272d10a162434e125f11718191a26272829
2a35363738393a434445464748494a535455565758595a636465666768696a737475767778797a82838
0028a28a0028a28a0028a28a0028a28a0028a28
\fi863 {\f0\fs27 \bullet }{\f40 } Dunja*** - koja sadr{\f63 \u382\'3f}i 50%
ka{\f63 \u353\'3f}e i 50% vode,
{\f0\fs27 \bullet }{\f40 } Dunja** - koja sadr{\f63 \u382\'3f}i 40% ka{\f63
\u353\'3f}e, 10% {\f63 \u353\'3f}e{\f63 \u263\'3f}era i 50% vode i
{\f0\fs27 \bullet }{\f40 } Dunja* - koja sadr{\f63 \u382\'3f}i 25% ka{\f63
\u353\'3f}e, 25% {\f63 \u353\'3f}e{\f63 \u263\'3f}era i 50% vode. \par
}
\par
}
{\phpg\posx1741\pvpg\posy2305\absw9819\absh3848 \f10 \fs21 \cf0 \f10 \fs21 \cf0 Na
osnovu analize tr{\f63 \u382\'3f}i{\f63 \u353\'3f}ta, procenjeno je da do kraja
godine mo{\f63 \u382\'3f}e da se proda najvi{\f63 \u353\'3f}e 6000
\par}{\phpg\posx1741\pvpg\posy2305\absw9819\absh3848 \sl-289 \f10 \fs21 \cf0 litara
svih sokova od dunje, a da {\f63 \u263\'3f}e Dunje***, zbog visoke cene, mo{\f63
\u263\'3f}i da se proda najvi{\f63 \u353\'3f}e
litara. Po{\f63 \u353\'3f}to uprava {\f63 \u382\'3f}eli da odr{\f63 \u382\'3f}i
imid{\f63 \u382\'3f} proizvo{\f63 \u273\'3f}a{\f63 \u269\'3f}a kvalitetnih sokova,
odlu{\f63 \u269\'3f}eno
\par}{\phpg\posx1741\pvpg\posy2305\absw9819\absh3848 \sl-288 \f10 \fs21 \cf0 je da
se soka Dunja* proizvede najvi{\f63 \u353\'3f}e 2000 litara. Potrebno je
odrediti koliko litara
\par}{\phpg\posx1741\pvpg\posy2305\absw9819\absh3848 \sl-288 \f10 \fs21 \cf0 soka
Dunja***, Dunja** i Dunja* treba proizvesti da bi ukupan profit koji se ostvaruje
prodajom ovih sokova bio maksimalan. Profit po jednom pakovanju soka Dunja*** je
15
\par}{\phpg\posx1741\pvpg\posy2305\absw9819\absh3848 \sl-288 \f10 \fs21 \cf0 nj,
Dunja** 12 nj i Dunja* 9nj.
\fi189 1) Formulisati matemati{\f63 \u269\'3f}ki model
2) Odrediti jedno optimalno re{\f63 \u353\'3f}enje koriste{\f63 \u263\'3f}i
simpleks tabele
3) Odrediti drugo bazno optimalno re{\f63 \u353\'3f}enje i napisati sva optimalna
re{\f63 \u353\'3f}enja.
4) Primenom postoptimanle analize odrediti da li se isplati proizvoditi
de{\f63 \u269\'3f}je sokove
Dunja*** u pakovanjima od 0,2 litra, ako je o{\f63 \u269\'3f}ekivani profit po
jednom pakovanju
ovih sokova 4 nj. \par
}
17. Miladin, otac malog Perice (studenta matematike) bavi se vinogradarstvom. Ove
godine
\fi416 sazrelo je 1800 kg belog i 1200 kg crnog gro{\f63 \u382\'3f}{\f63
\u273\'3f}a. Vinarija za 1 kg belog gro{\f63 \u382\'3f}{\f63 \u273\'3f}a
pla{\f63 \u263\'3f}a 0,42
\fi416 eura plus 0.02 eura po stepenu slatko{\f63 \u263\'3f}e, a za 1 kg crnog
gro{\f63 \u382\'3f}{\f63 \u273\'3f}a 0,40 eura plus 0.02 eura
\fi416 po stepenu slatko{\f63 \u263\'3f}e. Gro{\f63 \u382\'3f}{\f63 \u273\'3f}e
svaka 4 dana postane sla{\f63 \u273\'3f}e za jedan stupanj. Perica mo{\f63
\u382\'3f}e
\fi416 brati gro{\f63 \u382\'3f}{\f63 \u273\'3f}e 21.9 (najvi{\f63 \u353\'3f}e 1500
kg), 25.9 (najvi{\f63 \u353\'3f}e 1100 kg) i 27.9 (najvi{\f63 \u353\'3f}e 800 kg).
Mali
\fi416 Perica je simpleks metodom na{\f63 \u353\'3f}ao optimalan plan berbe, za
koji je zarada najve{\f63 \u263\'3f}a. Koji
\fi416 je to plan, ako je 21.9 slatko{\f63 \u263\'3f}a belog gro{\f63 \u382\'3f}
{\f63 \u273\'3f}a 17 stepena, a crnog 18.5 stepena? \par
}
}

Linearno Programiranje

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

Linearno Programiranje

Uploaded by

Copyright:

Available Formats

{\rtf \ansi\ansicpg1252\deff0\viewkind1\margt750\margb620

{\fonttbl{\f11\fswiss\fcharset0 Arial Narrow;}{\f10\fswiss\fcharset0 Arial;}

\par}{\phpg\posx6145\pvpg\posy4422\absw263\absh1005 \sl-288 \f10 \fs21 \cf0 \fi78 2

You might also like