{"id":3246,"date":"2022-02-18T09:38:37","date_gmt":"2022-02-18T08:38:37","guid":{"rendered":"https:\/\/nblok306.ftn.uns.ac.rs\/~zoran\/?page_id=3246"},"modified":"2026-02-12T17:02:36","modified_gmt":"2026-02-12T16:02:36","slug":"20-0m534-linearno-programiranje-sa-primenama-master-akademske-studije-matematika-u-tehnici","status":"publish","type":"page","link":"https:\/\/nblok306.ftn.uns.ac.rs\/~zoran\/?page_id=3246","title":{"rendered":"V2.20.0M534 Linearno programiranje sa primenama, master akademske studije Matematika u tehnici"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\" id=\"sadrzaj-predmeta\">Sadr\u017eaj predmeta<\/h2>\n\n\n\n<h3 class=\"wp-block-heading\" id=\"1-problem-linearnog-programiranja\">1. Problem linearnog programiranja<\/h3>\n\n\n\n<h4 class=\"wp-block-heading\" id=\"1-1-resenje-problema-linearnog-programiranja1-2-recnik1-3-simplex-algoritam1-4-simplex-tabela1-5-graficko-resavanje1-6-degenerisani-recnici-degenerisani-pivoti-anticiklin1-7-dualnost1-8-slaba-i-jaka-teorema-dualnosti1-9-negativno-transponovanje1-10-komplementarnost-dodatnih-promenljivih1-11-dualni-simplex-algoritam1-12-matricni-zapis1-13-analiza-osetljivosti1-14-parametarski-self-dual-simplex-algoritam\">1.1 Re\u0161enje problema linearnog programiranja<br \/>1.2 Re\u010dnik<br \/>1.3 Simplex algoritam<br \/>1.4 Simplex tabela<br \/>1.5 Grafi\u010dko re\u0161avanje<br \/>1.6 Degenerisani re\u010dnici, degenerisani pivoti, anticiklin<br \/>1.7 Dualnost<br \/>1.8 Slaba i jaka teorema dualnosti<br \/>1.9 Negativno transponovanje<br \/>1.10 Komplementarnost dodatnih promenljivih<br \/>1.11 Dualni simplex algoritam<br \/>1.12 Matri\u010dni zapis<br \/>1.13 Analiza osetljivosti<br \/>1.14 Parametarski self dual simplex algoritam<\/h4>\n\n\n\n<h3 class=\"wp-block-heading\" id=\"2-mrezni-protok-minimizacija-cene-transporta\">2. Mre\u017eni protok &#8211; minimizacija cene transporta<\/h3>\n\n\n\n<h4 class=\"wp-block-heading\" id=\"2-1-mrezni-protok-kao-problem-linearnog-programiranja2-2-primarni-simplex-algoritam2-3-dualni-simplex-algoritam2-4-parametarski-self-dual-simplex-algoritam2-5-mrezni-protok-sa-ogranicenjem-po-granama2-6-najkraci-put-u-mrezi2-7-hickokov-problem2-8-problem-angazovanja\">2.1 Mre\u017eni protok kao problem linearnog programiranja<br \/>2.2 Primarni simplex algoritam<br \/>2.3 Dualni simplex algoritam<br \/>2.4 Parametarski self-dual simplex algoritam<br \/>2.5 Mre\u017eni protok sa ograni\u010denjem po granama<br \/>2.6 Najkra\u0107i put u mre\u017ei<br \/>2.7 Hi\u010dkokov problem<br \/>2.8 Problem anga\u017eovanja<\/h4>\n\n\n\n<h3 class=\"wp-block-heading\" id=\"3-matricne-igre\">3. Matri\u010dne igre<\/h3>\n\n\n\n<h4 class=\"wp-block-heading\" id=\"3-1-sedlasta-tacka3-2-optimalna-strategija3-3-resavanje\">3.1 Sedlasta ta\u010dka<br \/>3.2 Optimalna strategija<br \/>3.3 Re\u0161avanje<\/h4>\n\n\n\n<h3 class=\"wp-block-heading\" id=\"nacin-polaganja\">Na\u010din polaganja:<\/h3>\n\n\n\n<p>Predmet se sastoji iz dva dela, oba se pola\u017eu pismeno i usmeno. Pismeni deo se pola\u017ee na ispitu u zakazanom terminu ili preko kolokvijuma. Usmeni za oba dela se pola\u017ee kad se na oba pismena dela ima osvojeno barem 20 bodova, u terminu par dana posle pismenog ispita, dogovorenom na pismenom ispitu.<\/p>\n\n\n\n<p>Va\u017eenje pismenog dela polo\u017eenog preko kolokvijuma je do kraja kalendarske godine u kojoj je odslu\u0161an predmet ili do poni\u0161tavanja izlaskom na pismeni ispit i re\u0161avanjem zadataka iz tog dela.<\/p>\n\n\n\n<p>Va\u017eenje pismenog dela polo\u017eenog u ispitnom roku je do usmenog ispita u tom roku, najdu\u017ee 7 dana.<\/p>\n\n\n\n<p>Ocene se formiraju na osnovu osvojenih bodova, u skladu sa Statutom FTN-a: 51+ -&gt; 6, 61+ -&gt; 7, &#8230;<\/p>\n\n\n\n<p>Bodovi:<\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td>&nbsp;<\/td><td>I deo<\/td><td>II deo<\/td><\/tr><tr><td>Pismeni<\/td><td>30<\/td><td>30<\/td><\/tr><tr><td>Datum kolokvijuma<\/td><td>24. I 2026.<\/td><td>21. II 2026. 10:00<\/td><\/tr><tr><td>Usmeni<\/td><td>20<\/td><td>20<\/td><\/tr><\/tbody><\/table><\/figure>\n","protected":false},"excerpt":{"rendered":"<p>Sadr\u017eaj predmeta 1. Problem linearnog programiranja 1.1 Re\u0161enje problema linearnog programiranja1.2 Re\u010dnik1.3 Simplex algoritam1.4 Simplex tabela1.5 Grafi\u010dko re\u0161avanje1.6 Degenerisani re\u010dnici, degenerisani pivoti, anticiklin1.7 Dualnost1.8 Slaba i jaka teorema dualnosti1.9 Negativno transponovanje1.10 Komplementarnost dodatnih promenljivih1.11 Dualni simplex algoritam1.12 Matri\u010dni zapis1.13 Analiza osetljivosti1.14 Parametarski self dual simplex algoritam 2. Mre\u017eni protok &#8211; minimizacija cene transporta 2.1 Mre\u017eni [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":3119,"menu_order":5,"comment_status":"closed","ping_status":"closed","template":"","meta":{"ngg_post_thumbnail":0,"footnotes":""},"class_list":["post-3246","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/nblok306.ftn.uns.ac.rs\/~zoran\/index.php?rest_route=\/wp\/v2\/pages\/3246","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/nblok306.ftn.uns.ac.rs\/~zoran\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/nblok306.ftn.uns.ac.rs\/~zoran\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/nblok306.ftn.uns.ac.rs\/~zoran\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/nblok306.ftn.uns.ac.rs\/~zoran\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=3246"}],"version-history":[{"count":5,"href":"https:\/\/nblok306.ftn.uns.ac.rs\/~zoran\/index.php?rest_route=\/wp\/v2\/pages\/3246\/revisions"}],"predecessor-version":[{"id":3924,"href":"https:\/\/nblok306.ftn.uns.ac.rs\/~zoran\/index.php?rest_route=\/wp\/v2\/pages\/3246\/revisions\/3924"}],"up":[{"embeddable":true,"href":"https:\/\/nblok306.ftn.uns.ac.rs\/~zoran\/index.php?rest_route=\/wp\/v2\/pages\/3119"}],"wp:attachment":[{"href":"https:\/\/nblok306.ftn.uns.ac.rs\/~zoran\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=3246"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}