Identifying Efficient Vectors: Some Theory and Computational Results

Five problems of finding efficient vectors as a subset of a finite set of vectors are shown to be related and a common methodology based on the simplex method of linear programming is developed for solving all of them. Randomly generated problems for one of the five types are solved using the method, and the implications regarding computational requirements are discussed.