Abo Bibliothek: Guest
Journal of Automation and Information Sciences

Erscheint 12 Ausgaben pro Jahr

ISSN Druckformat: 1064-2315

ISSN Online: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

On Solution of the Optimization Problem of Planning Reformation of a Military Unit

Volumen 37, Ausgabe 12, 2005, pp. 40-45
DOI: 10.1615/J Automat Inf Scien.v37.i12.60
Get accessGet access

ABSTRAKT

The mathematical foundations of solving two problems of formation of optimal plans of reformation of a military formation (MF) are stated. The first one ensures cost minimization of total inputs while MF reformation, and the second one — time minimization of reformation. Formalized statements of the considered problems, the scheme of numerical optimization by means of which they may be solved, as well as the generalized algorithm of forming an optimal plan of MF reformation, are given.

Digitales Portal Digitale Bibliothek eBooks Zeitschriften Referenzen und Berichte Forschungssammlungen Preise und Aborichtlinien Begell House Kontakt Language English 中文 Русский Português German French Spain