摘要
本文研究被若干线性约束条件界定的凸空间是否为空的判断问题，此问题在线性规划中有广泛的实际背景．本文提出了一个求解此问题的交边算法，该算法已被编程实现了，实际试算表明，其平均计算时间复杂度不高，是目前求解同类问题的算法中的较优者．
The problem of determining whether convex regions bounded by multiple constraints are empty, which has a wide practical background in linear programming, is studied in this paper. An intersecting-side algorithm to solve this problem is presented. The algorithm has been implemented, and it is shown by practical computing that its complexity of average computation time is not high.
出处
《计算机学报》
EI
CSCD
北大核心
1996年第9期704-708,共5页
Chinese Journal of Computers
基金
国家自然科学基金
关键词
线性约束
凸空间
交边算法
线性规划
Linear constraining, convex regions, intersecting-side algorithm, corner point, linear programming
