摘要
本文研究求成对线性规划问题的组合最优解的算法，巧妙地将问题的求解转化成了求两凸多面体间的距离，并给出了求两凸多面体间距离的快速算法，以该算法为核心，一系列的成对线性规划问题的组合最优解均能在Ｏ（ｌｏｇ４（ｍ十ｎ））时间内求得。
This paper considers an algorithm for solving optimal combination solutions of paired linear programming problems. It ingeniously changes the problems into one of seeking the distance between two convex-polyhedra and gives a fast algorithm to solve such a problem. Based on this algorithm, a series of optimal combination solutions of paired linear programming problems can be obtained in the time of O(log4 (m+n) ).
出处
《计算机研究与发展》
EI
CSCD
北大核心
1995年第10期6-11,15,共7页
Journal of Computer Research and Development
基金
国家自然科学基金
关键词
成对线性规划
组合最优解
算法
线性规划
Paired linear programming problems, optimal combination solution, convex-polyhedron, distance, algorithm.
