【摘要】 <正> 在非线性规划中,有时需要求出分别由两个不同的有限点集所生成的凸包(凸多面体)与锥包(多面体维)之间的最短距离,例如在[1]中就是如此。我们在那里已经指出,这个子问题可以用标准的二次规划方法来实现。但另一方面,在最优化与逼近论中更多还原

【Abstract】 In this paper a sufficient and necessary condition for a pair of points to provide the shortest distance between a polyhedron and a polyhedral convex cone is first established. By this criterion we propose an algorithm to find such a pair of points. This algorithm can be easily implemented and its convergence is also proved.更多还原