运用改进的线性规划算法求解分片线性方程组 | |
李颖 ; 黄晓霖 ; 王书宁 ; LI Ying ; HUANG Xiaolin ; WANG Shuning | |
2010-06-09 ; 2010-06-09 | |
关键词 | 电路求解 分片线性方程组 线性规划 circuit solving piecewise-linear equations linear programming O241 O221.1 |
其他题名 | Finding all solutions of piecewise-linear equations using linear programming |
中文摘要 | 为了提高求解分片线性方程组的线性规划算法的计算效率,提出基于线性规划算法的改进算法。首先找出若干线性区域组成的超立方体,使得方程组函数在此超立方体上表现为凸函数或凹函数,然后在超立方体上求解一次特定的线性规划问题并判断此超立方体是否含有方程组的解。该文给出的数例中改进线性规划算法需要求解的线性规划问题数目仅为线性规划算法的1/4。改进线性规划算法无需在全部线性区域上求解线性规划,因此相对线性规划算法提高了计算效率,提高程度取决于方程组函数的性质。; A linear programming(LP) algorithm was developed to more efficiently find all solutions of piecewise-linear equations than the traditional LP algorithm.This algorithm first finds the hypercube consisting of the various linear regions with the equations being other convex or concave in this hypercube.Then,specific LP problems are solved in the hypercube to determine whether the solution exists.For the example given in this paper,the algorithm uses only 25% as many linear programs as the conventional LP algorithm.Thus this algorithm is more efficient than the conventional LP algorithm since it reduces the number of linear programs that need to be solved.The improved performance compared to the conventional LP algorithm depends on the equation properties.; 国家自然科学基金资助项目(60674025,60534060); 国家“九七三”重点基础研究项目(2002CB312200) |
语种 | 中文 ; 中文 |
内容类型 | 期刊论文 |
源URL | [http://hdl.handle.net/123456789/57172] |
专题 | 清华大学 |
推荐引用方式 GB/T 7714 | 李颖,黄晓霖,王书宁,等. 运用改进的线性规划算法求解分片线性方程组[J],2010, 2010. |
APA | 李颖,黄晓霖,王书宁,LI Ying,HUANG Xiaolin,&WANG Shuning.(2010).运用改进的线性规划算法求解分片线性方程组.. |
MLA | 李颖,et al."运用改进的线性规划算法求解分片线性方程组".(2010). |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论