论文信息 - Identifying Efficient Vectors: Some Theory and Computational Results

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.

Jyrki Wallenius | Stanley Zionts | S. Zionts | J. Wallenius

[1] Ralph E. Steuer,et al. A revised simplex method for linear multiple objective programs , 1973, Math. Program..

[2] Minimum-effort control for discrete systems , 1966 .

[3] Johan Philip,et al. Algorithms for the vector maximization problem , 1972, Math. Program..

[4] Joseph G. Ecker,et al. Finding efficient points for linear multiple objective programs , 1975, Math. Program..

[5] S. Zionts,et al. An Interactive Programming Method for Solving the Multiple Criteria Problem , 1976 .

[6] Stanley Zionts,et al. Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems , 1966 .

[7] Joseph G. Ecker,et al. Finding all efficient extreme points for multiple objective linear programs , 1978, Math. Program..

[8] T. H. Mattheiss,et al. An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities , 1973, Oper. Res..