Approximation of the Set of Efficient Objective Vectors for Large Scale MOLP

  • Yong Sun Choi
  • Soung Hie Kim
Conference paper


A new method which presents the overall structure of efficient criterion vectors (N hereafter) for large scale MOLP is introduced. The proposed algorithm ASEOV (Approximation of the Set of Efficient Objective Vectors) insures full coverage of N, with corresponding coverage precision indicated. The DM can guide the determination procedure by assessing the coverage allowance on each criterion. Combined with proper interactive methods, this insight over N obtained through ASEOV can help a DM in assessing his preference and reduce his burden in deriving the final best compromise solution. An illustrative example is presented.


Extreme Point None None Supporting Hyperplane Representative Subset Criterion Vector 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Balachandran, S. and Gero, J. (1984), “A comparison of three methods for generating the Pareto optimal set”, Engineering Optimization 7/5, 319 – 336.Google Scholar
  2. Choi, Y. S. and Kim, S. H. (1993), “An improved multiple criteria visual interactive method with stepwise focused contouring of efficient criterion vectors”, Computers and Operations Research, forthcoming. Cohon, J. L. (1978), Multiobjective Programming and Planning, Academic Press, New York.Google Scholar
  3. Cohon, J.L. (1978), Multiobjective Programming and Planning, Academic Press, New York.Google Scholar
  4. Cohon, J. L., Church, R. L., and Sheer, D. P. (1979), “Generating multiobjective trade—Offs: An algorithm for bicriterion problems”, Water Resources Research 15, 1001–1010.CrossRefGoogle Scholar
  5. Dauer, J. P., and Liu, Y. -H. (1990), “Solving multiple objective linear programs in objective space”, European Journal of Operational Research 46, 350 – 357.MathSciNetMATHCrossRefGoogle Scholar
  6. Dauer, J. P. (1987), “Analysis of the objective space in multiple objective linear programming”, Journal of Mathematical Analysis and Applications 126, 579 – 593.MathSciNetMATHCrossRefGoogle Scholar
  7. Ferreira, P. A. V. and Geromel, J. C. (1990), “An interactive method for multicriteria optimization problems”, IEEE Transactions on Systems, Man, and Cybernetics 20 (3) 596–605.Google Scholar
  8. Shin, W. S. and Ravindran, A. (1991), “Interactive multiple objective optimization: Survey I — Continuous case”, Computers and Operations Research 18, 97–114.MathSciNetMATHCrossRefGoogle Scholar
  9. Solanki, R. S. and Cohon, J. L. (1989), “Approximating the noninferior set in linear biobjective programs using multiparametric decomposition”, European Journal of Operational Research 41, 355 – 366.MathSciNetMATHCrossRefGoogle Scholar
  10. Steuer, R. E. (1986), Multiple Criteria Optimization: Theory, Computation, and Application, John Wiley and Sons, New York.MATHGoogle Scholar
  11. Zionts, S. and Wallenius, J. (1980), “Identifying efficient vectors: Some theory and computational results”, Operations Research 28 (5), 785 – 793.Google Scholar

Copyright information

© Springer-Verlag New York, Inc. 1994

Authors and Affiliations

  • Yong Sun Choi
    • 1
  • Soung Hie Kim
    • 2
  1. 1.Dept. of Business AdministrationINJE UniversityKimhaeKorea
  2. 2.Dept. of Management Information SystemsKAISTSeoulKorea

Personalised recommendations