{"id":3129,"date":"2021-11-24T11:32:59","date_gmt":"2021-11-24T10:32:59","guid":{"rendered":"https:\/\/nblok306.ftn.uns.ac.rs\/~zoran\/?page_id=3129"},"modified":"2024-10-03T08:21:29","modified_gmt":"2024-10-03T06:21:29","slug":"ee-1320-e145-operaciona-istrazivanja","status":"publish","type":"page","link":"https:\/\/nblok306.ftn.uns.ac.rs\/~zoran\/?page_id=3129","title":{"rendered":"EE.{13,20}.E145.Operaciona istra\u017eivanja"},"content":{"rendered":"\n\n\n\n\n
SEMESTAR<\/td>\n4<\/td>\n<\/tr>\n
ESPB<\/td>\n7<\/td>\n<\/tr>\n
FOND \u010cASOVA<\/td>\n3+3<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

Sadr\u017eaj predmeta<\/h2>\n

1. Problem linearnog programiranja<\/h3>\n

1.1 Re\u0161enje problema linearnog programiranja
\n1.2 Re\u010dnik
\n1.3 Simplex algoritam
\n1.4 Simplex tabela
\n1.5 Grafi\u010dko re\u0161avanje
\n1.6 Degenerisani re\u010dnici, degenerisani pivoti, anticiklin
\n1.7 Dualnost
\n1.8 Slaba i jaka teorema dualnosti
\n1.9 Negativno transponovanje
\n1.10 Komplementarnost dodatnih promenljivih
\n1.11 Dualni simplex algoritam
\n1.12 Matri\u010dni zapis
\n1.13 Analiza osetljivosti
\n1.14 Parametarski self dual simplex algoritam<\/h4>\n

2. Mre\u017eni protok – minimizacija cene transporta<\/h3>\n

2.1 Mre\u017eni protok kao problem linearnog programiranja
\n2.2 Primarni simplex algoritam
\n2.3 Dualni simplex algoritam
\n2.4 Parametarski self-dual simplex algoritam
\n2.5 Najkra\u0107i put u mre\u017ei
\n2.6 Hi\u010dkokov problem
\n2.7 Problem anga\u017eovanja<\/h4>\n

3. Matri\u010dne igre<\/h3>\n

3.1 Sedlasta ta\u010dka
\n3.2 Optimalna strategija
\n3.3 Re\u0161avanje<\/h4>\n

Na\u010din polaganja:<\/h3>\n

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

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

Va\u017eenje pismenog dela polo\u017eenog u ispitnom roku je do usmenog ispita u tom roku, najdu\u017ee 7 dana.<\/p>\n

Ocene se formiraju na osnovu osvojenih bodova, u skladu sa Statutom FTN-a: 51+ -> 6, 61+ -> 7, …<\/p>\n

Bodovi:<\/p>\n\n\n\n\n\n\n
 <\/td>\nI deo<\/td>\nII deo<\/td>\n<\/tr>\n
Pismeni<\/td>\n40<\/td>\n40<\/td>\n<\/tr>\n
Datum kolokvijuma<\/td>\n <\/td>\n <\/td>\n<\/tr>\n
Usmeni<\/td>\n10<\/td>\n10<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

 <\/p>\n

 <\/p>\n","protected":false},"excerpt":{"rendered":"

SEMESTAR 4 ESPB 7 FOND \u010cASOVA 3+3 Sadr\u017eaj predmeta 1. Problem linearnog programiranja 1.1 Re\u0161enje problema linearnog programiranja 1.2 Re\u010dnik 1.3 Simplex algoritam 1.4 Simplex tabela 1.5 Grafi\u010dko re\u0161avanje 1.6 Degenerisani re\u010dnici, degenerisani pivoti, anticiklin 1.7 Dualnost 1.8 Slaba i jaka teorema dualnosti 1.9 Negativno transponovanje 1.10 Komplementarnost dodatnih promenljivih 1.11 Dualni simplex algoritam 1.12 […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":3119,"menu_order":10,"comment_status":"closed","ping_status":"closed","template":"","meta":{"ngg_post_thumbnail":0,"footnotes":""},"class_list":["post-3129","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/nblok306.ftn.uns.ac.rs\/~zoran\/index.php?rest_route=\/wp\/v2\/pages\/3129","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=3129"}],"version-history":[{"count":1,"href":"https:\/\/nblok306.ftn.uns.ac.rs\/~zoran\/index.php?rest_route=\/wp\/v2\/pages\/3129\/revisions"}],"predecessor-version":[{"id":3131,"href":"https:\/\/nblok306.ftn.uns.ac.rs\/~zoran\/index.php?rest_route=\/wp\/v2\/pages\/3129\/revisions\/3131"}],"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=3129"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}