摘要
将参数不定区间估计 (PIE)问题变换成一组对偶线性规划 (DLP)问题 ,提出了求解这组DLP问题的改进单纯形方法 .该方法利用变量间的对偶关系 ,直接计算初始基本可行解 ,省去了初始基本可行解的搜索步骤 .此外 ,在确定旋入和旋出变量时都采用了目标值最大减少规则 ,减少了旋转迭代次数 .针对由PIE问题所导出的全部DLP问题都具有相同的目标函数和约束矩阵 ,给出了单搜索过程求解全部DLP问题的联合单纯形法 .
The parameter uncertainty interval estimation (PIE) problem was transferred into a set of dual linear programming (DLP) problems, and an improved simplex method was proposed to solve these DLP problems. The dual relationship between the variables of the DLP problems was used to directly compute an initial basic feasible solution, so that the process of finding an initial basic feasible solution is removed. Moreover, the largest reduction rule was used in the determination of both entering and leaving variables, and thus the iterative number was reduced. Considering that all the DLP problems derived from a PIE problem have the same objective function and constraint matrix, a unified simplex method was given to solve all the DLP problems in a single searching procedure. Simulation results show the effectiveness of the proposed algorithm.
出处
《北京航空航天大学学报》
EI
CAS
CSCD
北大核心
2003年第6期529-533,共5页
Journal of Beijing University of Aeronautics and Astronautics
基金
国家自然科学基金资助项目 ( 6990 40 0 1)
航空基础科学基金资助项目 ( 99E5 10 0 3 )
北京市自然科学基金资助项目 ( 4 0 3 2 0 14 )
关键词
系统辨识
线性规划
对偶单纯形算法
参数不定区间估计
集员辨识
systems identification
linear programming
dual simplex algorithm
parameter interval estimation
set membership identification
