An algorithm for identifying the frame of a pointed finite conical hull

INFORMS Journal on Computing

Volumn 10, Issue 3, 1998, Pages 323-330

  Dula J H ^a   Helgasom, R V ^b   Venugopal, N ^c  

^a UNIVERSITY OF MISSISSIPPI   (United States)

^b SOUTHERN METHODIST UNIVERSITY   (United States)

^c MCI Telecommunications Corporation   (United States)

Author keywords

Computational geometry; Convex analysis; Geometry; Linear programming; Polyhedral cones; Separation; Theorem of alternatives

Indexed keywords

EID: 0043111773     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.10.3.323     Document Type: Article

References (11)

1. J.H. DULÁ AND R.V. HELGASON, 1996. A New Procedure for Identifying the Frame of the Convex Hull of a Finite Collection of Points in Multidimensional Space, European Journal of Operational Research 92, 352-367.
2. J.H. DULÁ, R.V. HELGASON, and B.L. HICKMAN, 1992. Preprocessing Schemes and a Solution Method for the Convex Hull Problem in Multidimensional Space, in Computer Science and Operations Research: New Developments in Their Interfaces, O. Balci (ed.), 59-70, Pergamon Press, U.K.
3. J.H. DULÁ and N. VENUGOPAL, 1995. On Characterizing the Production Possibility set for the CCR Ratio Model in DEA, International Journal of Systems Science 26, 2319-2325.
4. M. GERSTENHABER, 1951. Theory of Convex Polyhedral Cones, in Activity Analysis of Production and Allocation, Tjalling C. Koopmans (ed.), 298-316, Chapman and Hall, London.
5. R. MARSTEN, 1981. The Design of the XMP Linear Programming Library, ACM Transactions on Mathematical Software 7, 481-497.
6. R.T. ROCKAFELLAR, 1972. Convex Analysis, Princeton University Press, Princeton, New Jersey.
7. d, in Advances in Optimization and Parallel Computing, P.M. Pardalos (ed.), 267-292, North Holland, Amsterdam.
8. N. VENUGOPAL, 1995. Determining the Frame of a Pointed Polyhedral Cone, Ph.D. dissertation, Southern Methodist University, Dallas, TX 75275.
9. S.W. WALLACE and ROGER J.-B. WETS, 1992. Preprocessing in Stochastic Programming: The Case of Linear Programs, ORSA Journal on Computing 4, 45-59.
10. R.J.-B. WETS, 1990. Elementary, Constructive Proofs of the Theorems of Farkas, Minkowski and Weyl, in J.J. Gabszewicz, J.-F. Richard and L.A. Wolsey, editors, Economic Decision Making: Games, Econometrics and Optimisation, JJ. Gabszewicz, J.-F. Richard, and L.A. Wolsey (eds.), 427-432, North Holland Elsevier-Science, Amsterdam.
11. R.J.-B. WETS and CHRISTOPH WITZGALL, 1967. Algorithms for Frames and Lineality Spaces of Cones, Journal of Research of the National Bureau of Standards - B. Mathematics and Mathematical Physics 71B, 1-7.