R^m凸域包含与相交性判定的一个线性规划算法  

Linear Programming Approaches to the Convex Domain Inclusion and Intersection Problem in R

作　　者：周厚斌[1] 李岩[1] 

机构地区：[1]西南交通大学桥梁及结构工程系,成都610031

出　　处：《计算机工程与应用》1999年第5期49-51,共3页Computer Engineering and Applications

摘　　要：该文提出了凸域包含与相交性判定的一个新的基于线性规划的分析型算法。该算法具有通用性，适用于任意维欧氏空间凸域的包含与相交性判定；且由于利用了成熟的线性规划方法，效率亦较高，文中研究了凸域包含与相交问题的两种线性规划表述形式，并考察了它们之间的关系，给出了算法的实现策略。In this paper, a new analytic type algorithm to the convex domain inclusion and intersechon problem ispresented, which based on linear programming techniqUe. The algorithm features its simplicity and suitability forconvex domains in any dimensional Euclidean spaces, and is also quite efficient in virtue of the well-developedlinear programming technique. In the paper, two linear programming formulations of the convex domain inclusionand intersection pmblem are researched, and the relationship betWeen the formulations is examined. Some considerations on the implementation Of the algorithm are also discussed.

关 键 词：线性规划 算法 凸域包含 相交性 CAD 

分 类 号：O221.1[理学—运筹学与控制论] TP391.72[理学—数学]