V knige izlozheny skhemy resheniya zadach uslovnoy optimizatsii. Prichem pervonachal"no eti obshchie skhemy proillyustrirovany na konechnomernoy zadache nelineynogo programmirovaniya i ee usrednennoy postanovke. Zatem oni pereneseny na variatsionnye zadachi. Ispol"zovannyy podkhod pozvolyaet v uproshchennoy i kratkoy forme vyyavit" svyaz" mezhdu konechnomernymi i variatsionnymi zadachami, pokazat", chto skhema polucheniya usloviy optimal"nosti zadachi nelineynogo programmirovaniya i ee usrednennoy postanovki mozhet byt" perenesena na variatsionnye zadachi s uchetom ikh osobennostey. Privedeny usloviya v forme printsipa maksimuma dlya zadach s proizvol"nym sochetaniem razlichnykh tipov kriteriev i ogranicheniy. Rassmotreny inzhenernye metody preobrazovaniya variatsionnykh zadach, pozvolyayushchie uprostit" ikh reshenie. 190 str.