摘要
提出多面集顶点的所有邻近顶点个数的计算方法．利用所得结果,获得了多面集是否有界的一个判别法,并给出线性规划(LP)有多解的充要条件．
This paper has proposed a computing method for the contiguous points amount of the polyhedral set vertex. By the result, it gets the way whether the polyhedral set is bounded. Furthermore, the necessary and sufficient conditions of poly-keys to LP are studied.
出处
《温州大学学报（自然科学版）》
2007年第2期1-4,共4页
Journal of Wenzhou University(Natural Science Edition)
关键词
多面集
顶点
邻近顶点
线性规划
最优基本解
Vertex
Contiguous point
Linear programming
Optimum fundamental solution
