Ically mathematical programuvannya - Nakonechny S.І.

1.3. Butt-ekonomіko matematichnoї modelі

Povertayuchis to hover butt 1.1 pobuduєmo ekonomіko-ically mathematical model danoї zadachі.

Poznachimo through x1 Quantity viroblenih freezer, and a x2 - elektroplit. Virazimo mathe- matical minds scho obmezhuyut vikoristannya resursіv.

Vihodyachi s normativіv vikoristannya skin s resursіv on odinitsyu produktsії scho navedenі Table. 1.1 zapishemo sumarnі vitrati robochem hour: 9,2 x1 + x2 4. Over the minds zadachі tsya value is not Mauger perevischuvati zagalny stock danogo resource tobto 520 lyud.-year. Tsya vimoga opisuєtsya with such a nerіvnіstyu:

Analogіchno zapishemo minds schodo vikoristannya sheet zalіza that skla:

;

Neobhіdno Sered mnozhini vsіh mozhlivih values x1, x2 know that takі for yakih scrip viruchki maximal tobto: .

Otzhe, minds zadachі, opisanі prikladі in 1.1, it is possible with such a tribute ekonomіko-ically mathematical Modell:

.

of minds: ;

;

;

.

Stop Umov fіksuє nemozhlivіst nabuttya zmіnnimi vіd'єmnih value to scho Quantity viroblenoї produktsії not Mauger Buti vіd'єmnoyu. Rozv'yazavshi task vіdpovіdnim ically mathematical method programuvannya, dіstaєmo Taqiy rozv'yazok: for maksimalnoї viruchki od realіzatsії produktsії neobhіdno vigotovlyati freezer - 50 pieces, elektroplit - 15 (= 50 x 1, x 2 = 15).

Perevіrimo vikonannya minds zadachі:

;

;

.

OAO All minds zadachі vikonuyutsya before Well optimal plan daє zmogu povnіstyu vikoristati two Vidi resursіv s mіnіmalnim nadlishkom third.

Viruchka stanovitime: mind. od.

Otrimany optimal plan in porіvnyannі s Persha varіantom virobnichoї prog umozhlivlyuє zbіlshennya viruchki on mind. od., on tobto .