Title of article :
Linear programming approaches to the convex hull problem in Rm
Author/Authors :
P. M. Pardalos، نويسنده , , Y. Li، نويسنده , , and W. W. Hager، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 1995
Abstract :
In this paper, two linear programming formulations of the convex hull problem are presented. Each formulation is the dual of the other. Linear programming problems that identify a face of the convex hull are also discussed. An efficient algorithm is developed. Computational results obtained on an IBM 3090 are presented.
Keywords :
Convex hull , Extreme points , Complexity , Linear programming , Divide-and-conquer
Journal title :
Computers and Mathematics with Applications
Journal title :
Computers and Mathematics with Applications
