图书馆订阅: Guest
自动化与信息科学期刊

每年出版 12 

ISSN 打印: 1064-2315

ISSN 在线: 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

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

摘要

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.

Begell Digital Portal Begell 数字图书馆 电子图书 期刊 参考文献及会议录 研究收集 订购及政策 Begell House 联系我们 Language English 中文 Русский Português German French Spain