摘要
本文提出一种有效算法,不重复地循着由一个线性不等式系统所决定的凸多面体棱线仅一次访遍全部顶点,同时确定此系统中全部非多会约束。
An efficient algorithm to determine all vertices and nonredundant constraints of linear inequality systems is proposed. With this algorithm, every vertex of a convex polyhedron will be visited only once by non-repeatedly going along the edges. Meantime, all nonredundant constraints of the linear inequality systems can be determined.
出处
《深圳大学学报（理工版）》
EI
CAS
1992年第3期36-40,共5页
Journal of Shenzhen University(Science and Engineering)
关键词
线性不等式
凸多面体
线性规划
Lineas inequality systems, Convex polyhedra, Redundant constraints
