| Article ID: | iaor1996625 |
| Country: | United States |
| Volume: | 29 |
| Issue: | 7 |
| Start Page Number: | 23 |
| End Page Number: | 29 |
| Publication Date: | Apr 1995 |
| Journal: | Computers & Mathematics with Applications |
| Authors: | Pardalos P.M., Li Y., Hager W.W. |
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.