求连乘模型最优解的一种新方法  

Method for best solution to series multiplication model

作　　者：熊云[1] 王庆栋[1] 赵奕[1] 王国彪[2] 

机构地区：[1]解放军理工大学工程兵工程学院,江苏南京210007 [2]南京陆军指挥学院,江苏南京210045

出　　处：《解放军理工大学学报（自然科学版）》2007年第2期186-189,共4页Journal of PLA University of Science and Technology(Natural Science Edition)

摘　　要：为求得连乘模型的最优解,探讨了该模型及其现有的解决方法,对该连乘模型特点及其约束条件进行了分析,给出一种加权平衡算法。利用该方法对连乘模型求最优解时,先对连乘模型各项因子的指数进行求和,然后求得各项因子所对应的指数在所有因子指数之和中所占的权重,将约束条件下所有因子之和与其各自对应的指数所占的权重相乘,求得各项因子的值,即为最优解。将利用加权平衡算法求得的结果与利用现有算法求得的结果进行对比,加权平衡算法极大地减少了运算量。In order to get the best solution to series multiplication model, this paper the model and its current solutions were investigated. According to the analysis of the model and its restriction, a new solution, called weighted factor-balance arithmetic was proposed. This arithmetic was useful under only one restriction. Weighted factor-balance arithmetic was a method improved based on analysing the dynamical programming arithmetic. When to use this arithmetic to get the best solution to the model, needed to figure out the sum of the exponents first. According to the weight factors of exponents of the target function, the best solution was obtained by weighing the restriction directly. After the analysis being contrasted with current solutions, it was further proved that weighted factor-balance arithmetic was an effective method which reduced the process and contracted the calculation quantity.

关 键 词：连乘模型 加权平衡 最优解 动态规划 

分 类 号：E911[军事]