APPROXIMATE SOLUTION OF THE PROBLEM OF OPTIMAL STANDBY BY THE METHOD OF DYNAMIC-PROGRAMMING

被引：0
|
作者：
SHURABURA, AE
机构：
来源：
ENGINEERING CYBERNETICS | 1979年 / 17卷 / 04期
关键词：
MATHEMATICAL PROGRAMMING; DYNAMIC;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
An examination is made of an optimal standby problem. It is reduced to a nonlinear knapsack problem. A method based on the idea of dynamic programming and completely acceptable from the point of view of the expenditure of computational means is proposed for approximate solution (to a given degree of accuracy) of the latter problem.
引用
收藏
页码：31 / 36
页数：6
相关论文
共 50 条
12345