自动化与信息科学期刊
每年出版 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
摘要
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.
241 文章浏览量
3 文章下载
统计数据
相似内容的文章:
最新一期
Modeling of Configurations Formed when Using Microneedle Systems
Properties of Large Deviations of Empirical Estimates in a Stochastic Optimization Problem for a Homogeneous Random Field
The Dynamics of One Arms Race Mathematical Model with a Delay
Some Ways to Modeling Input Data for Information Search in the Library of Standards when Solving Semantics Problems
Method for Constructing Primitive Polynomials for Cryptographic Subsystems of Dependable Automated Systems
Complete Asymptotics of Approximations by Certain Singular Integrals in Mathematical Modeling
Index, Volume 52, 2020