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

Volumn 92, Issue 2, 1996, Pages 352-367

  Dula J H ^a   Helgason, R V ^a  

^a Southern Methodist University   (United States)

Author keywords

Convex hull problem; Data envelopment analysis; Frame; Linear programming; Redundancy

Indexed keywords

CALCULATIONS; COMPUTATIONAL GEOMETRY; ECONOMICS; LINEAR PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; SET THEORY; STATISTICAL METHODS; VECTORS;

CONVEX HULL PROBLEM; DATA ENVELOPMENT ANALYSIS; MULTIDIMENSIONAL SPACE; STOCHASTIC PROGRAMMING;

OPERATIONS RESEARCH;

EID: 0030193968     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(94)00366-1     Document Type: Article

References (15)

1. Charnes, A., and Cooper, W.W. (1985), "Preface to topics in Data Envelopment Analysis", Annals of Operations Research 2, 59-94.
2. Charnes, A., Cooper, W.W., and Rhodes, E. (1978), "Measuring the efficiency of decision making units", European Journal of Operational Research 2/6, 429-444.
3. Chatterjee, S., and Chatterjee, S. (1990), "A note on finding extreme points in multivariate space", Computational Statistics & Data Analysis 10, 87-92.
4. Dulá, J.H. (1993), "Designing a majorization scheme for the recourse function of two-stage stochastic linear programs", Computational Optimization and Applications 1/4, 399-414.
5. Dulá, J.H. (1994), "Geometry of optimal value functions with applications to redundancy in linear programming", Journal of Optimization Theory and Applications 81/1, 35.
6. Dulá, J.H., Helgason, R.V., and Hickman, B.L. (1992), "Preprocessing schemes and a solution method for the convex hull problem in multidimensional space", in: O. Balci (ed.), Computer Science and Operations Research: New Developments in their Interfaces, Pergamon, Oxford.
7. Gastwirth, J. (1966). "On robust procedures", Journal of the American Statistical Association 61, 929-948.
8. Marsten, R. (1981), "The design of the XMP linear programming library", ACM Transactions on Mathematical Software 7, 481-497.
9. Preparata, F.P. and Shamos, M.I. (1985), Computational Geometry: An Introduction, Springer-Verlag, New York.
10. d", in: P.M. Pardalos (ed.), Advances in Optimization and Parallel Computating, North-Holland, Amsterdam, 267-292.
11. Seidel, R. (1986), "Constructing higher-dimensional convex hulls at logarithmic cost per face", in: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, Berkeley, CA, May 28-30, 1986, 404-413.
12. Tomlin, J.A. and Welch, J.S. (1986), "Finding duplicate rows in a linear programming model", Operations Research Letters 5/1, 7-11.
13. Wallace, S.W., and Wets, R.J.-B. (1989), "Preprocessing in stochastic programming: The case of uncapacitated networks", ORSA Journal on Computing 1/4, 252-270.
14. Wallace, S.W., and Wets, R.J.-B. (1992), "Preprocessing in stochastic programming: The case of linear programs", ORSA Journal on Computing 4, 45-59.
15. Wets, R.J.-B., and Witzgall, C. (1967), "Algorithms for frames and lineality spaces of cones", Journal of Research of the National Bureau of Standards. Series B. Mathematics and Mathematical Physics 71B/1, 1-7.