Skip to main content
SpringerLink
Log in

Criteria and dimension reduction of linear multiple criteria optimization problems

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

Two of the main approaches in multiple criteria optimization are optimization over the efficient set and utility function program. These are nonconvex optimization problems in which local optima can be different from global optima. Existing global optimization methods for solving such problems can only work well for problems of moderate dimensions. In this article, we propose some ways to reduce the number of criteria and the dimension of a linear multiple criteria optimization problem. By the concept of so-called representative and extreme criteria, which is motivated by the concept of redundant (or nonessential) objective functions of Gal and Leberling, we can reduce the number of criteria without altering the set of efficient solutions. Furthermore, by using linear independent criteria, the linear multiple criteria optimization problem under consideration can be transformed into an equivalent linear multiple criteria optimization problem in the space of linear independent criteria. This equivalence is understood in a sense that efficient solutions of each problem can be derived from efficient solutions of the other by some affine transformation. As a result, such criteria and dimension reduction techniques could help to increase the efficiency of existing algorithms and to develop new methods for handling global optimization problems arisen from multiple objective optimization.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Agrell P.J.: On redundancy in multi criteria decision making. Eur. J. Oper. Res. 98, 571–586 (1997)

    Article  Google Scholar 

  2. Amador F., Romero C.: Redundancy in lexicographic goal programming: an empirical approach. Eur. J. Oper. Res. 41, 347–354 (1989)

    Article  Google Scholar 

  3. Benson H.P.: Optimization over the efficient set. J. Math. Anal. Appl. 98, 562–580 (1984)

    Article  Google Scholar 

  4. Benson H.P.: An all-linear programming relaxation algorithm for optimizing over the efficient set. J. Glob. Optim. 1, 83–104 (1991)

    Article  Google Scholar 

  5. Benson H.P.: A geometrical analysis of the outcome set in multiple objective convex programs with linear criterion functions. J. Glob. Optim. 6, 231–251 (1995)

    Article  Google Scholar 

  6. Benson H.P.: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problems. J. Glob. Optim. 13, 1–24 (1998)

    Article  Google Scholar 

  7. Benson H.P., Lee D.: Outcome–based algorithm for ptimizing over the efficient set of a bicriteria linear programming problem. J. Optim. Theory Appl. 88, 77–105 (1996)

    Article  Google Scholar 

  8. Benson H.P., Sun E.: Outcome space partition of weight set in multiobjective linear programming. J. Optim. Theory Appl. 105, 17–36 (2000)

    Article  Google Scholar 

  9. Brockhoff, D., Zitzler, E.: Dimensionality reduction in multiobjective optimization: the minimum objective subset problem, In: Waldmann K.H., Stocker U.M. (eds.) Operations Research Proceedings 2006, 423–429 (2007)

  10. Dauer J.P., Fosnaugh T.A.: Optimization over the efficient set. J. Glob. Optim. 7, 261–277 (1995)

    Article  Google Scholar 

  11. Deb, K., Saxena, D.: On finding pareto-optimal solutions through dimensionality reduction for certain large-dimensional multi-objective optimization problems, KanGal Report 2005011, Department of Mechanical Engineering, IIT Kanpur, India, (2005)

  12. Ehrgott M.: Multicriteria Optimization. Springer, Berlin (2005)

    Google Scholar 

  13. Fülöp, J.: A cutting plane algorithm for linear optimization over the efficient set, generalized convexity. In: Komlösi S., Rapcsàk T., Schaible S. (eds.) Lecture Notes in Economics and Mathematical Systems, vol. 405, 374–385, Springer, Berlin, Germany, (1994)

  14. Gal, T.: A note on size reduction of the objective functions matrix in vector maximum problems. In: Multiple Criteria Decision Making Theory and Application, Proceedings of Third Conference, Hagen/Königswinter, 1979. Lecture Notes in Economics and Mathematical Systems, vol. 177, pp. 74–84. Springer, Berlin (1980)

  15. Gal T., Hanne T.: Consequences of dropping nonessential objectives for the application of MCDM methods. Eur. J. Oper. Res. 119, 373–378 (1999)

    Article  Google Scholar 

  16. Gal T., Hanne T.: Nonessential objectives within network approaches for MCDM. Eur. J. Oper. Res. 168, 584–592 (2006)

    Article  Google Scholar 

  17. Gal T., Leberling H.: Redundant objective functions in linear vector maximum problems and their determination. Eur. J. Oper. Res. 1, 176–184 (1977)

    Article  Google Scholar 

  18. Hanne, T.: Nonessential objectives and network-based multicriteria decision making. In: Ferreira M., Menezes A.M.R., Catanas F. (eds.), Temas em metodos quantitativos, 4, 153–168 (2004)

  19. Horst R., Pardalos P.M., Thoai N.V.: Introduction to Global Optimization, 2nd edn. Kluwer, Dordrecht, The Netherlands (2000)

    Google Scholar 

  20. Horst R., Thoai N.V.: Utility function programs and optimization over the efficient set in multiple objective decision making. J. Optim. Theory Appl. 92, 469–486 (1997)

    Article  Google Scholar 

  21. Horst R., Thoai N.V.: Maximizing a concave function over the efficient or weakly–efficient set. Eur. J. Oper. Res. 117, 239–252 (1999)

    Article  Google Scholar 

  22. Horst R., Thoai N.V., Yamamoto Y., Zenke D.: On optimization over the efficient set in linear multicriteria programming. J. Optim. Theory Appl. 134, 433–443 (2007)

    Article  Google Scholar 

  23. Horst R., Tuy H.: Global Optimization: Deterministic Approaches, 2nd edn. Springer, Berlin (1993)

    Google Scholar 

  24. Keeney R.L., Raiffa H.: Decisions with Multiple Objectives: Preferences and Value Tradeoffs. Wiley, New York (1976)

    Google Scholar 

  25. Le-Thi H.A., Pham D.T., Muu L.D.: Numerical solution for optimization over the efficient set by D.C. optimization algorithms. Oper. Res. Lett. 19, 117–128 (1996)

    Article  Google Scholar 

  26. Lindroth P., Patriksson M., Stömberg A.B.: Approximating the pareto optimal set using a reduced set of objective functions. Eur. J. Oper. Res. 207, 1519–1534 (2010)

    Article  Google Scholar 

  27. Malinowska A.B.: Changes of the set of efficient solutions by extending the number of objectives and its evaluation. Control Cybern. 31, 964–974 (2002)

    Google Scholar 

  28. Malinowska A.B.: Nonessential objective functions in linear multiobjective optimization problems. Control Cybern. 35, 873–880 (2006)

    Google Scholar 

  29. Malinowska A.B.: Weakly and properly nonessential objectives in multiobjective optimization problems. Oper. Res. Lett. 36, 647–650 (2008)

    Article  Google Scholar 

  30. Malinowska A.B., Torres D.F.M.: Computational approach to essential and nonessential objective functions in linear multicriteria optimization. J. Optim. Theory Appl. 139, 577–590 (2008)

    Article  Google Scholar 

  31. Muu L.D., Luc L.T.: On equivalence between convex maximization and optimization over the efficient set. Vietnam J. Math. 24, 439–444 (1996)

    Google Scholar 

  32. Pardalos, P., Siskos, Y., Zopounidis, C. (eds): Advances in Multicriteria Analysis. Kluwer, (1995)

  33. Pareto V.: Manual d’économie polytique. F. Rouge, Lausan (1896)

    Google Scholar 

  34. Philip J.: Algorithms for the vector maximization problem. Math. Program. 2, 207–229 (1972)

    Article  Google Scholar 

  35. Roy B.: Multicriteria Methodology for Decision Aiding. Kluwer, (1996)

  36. Steuer R.E.: Multiple Criteria Optimization: Theory, Computation, Applications. Wiley, New York (1985)

    Google Scholar 

  37. Thoai N.V.: Conical algorithm in global optimization for optimizing over efficient sets. J. Glob. Optim. 18, 321–336 (2000)

    Article  Google Scholar 

  38. Thoai N.V.: Convergence and application of a decomposition method using duality bounds for nonconvex global optimization. J. Optim. Theory Appl. 113, 165–193 (2002)

    Article  Google Scholar 

  39. Thoai N.V.: Decomposition branch and bound algorithm for optimization problems over efficient sets. J. Ind. Manag. Optim. 4, 647–660 (2008)

    Article  Google Scholar 

  40. Thoai N.V.: Reverse convex programming approach in the space of extreme criteria for optimization over the efficient sets. J. Optim. Theory Appl. 147, 263–277 (2010)

    Article  Google Scholar 

  41. Yamamoto Y.: Optimization over the efficient set: overview. J. Glob. Optim. 22, 285–317 (2002)

    Article  Google Scholar 

  42. Yu P.L.: Multiple Criteria Decision Making: Concepts, Techniques and Extensions. Plenum, New York (1985)

    Google Scholar 

  43. Yu P.L.: Multiple criteria decision making: five basic concepts. In: Nemhauser, G.L., Rinnooy Kan, A.H.G., Todd, M.J. (eds) Optimization, pp. 663–699. Amsterdam, North-Holland (1989)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Trier, 54286, Trier, Germany

    Nguyen V. Thoai

Authors
  1. Nguyen V. Thoai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nguyen V. Thoai.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Thoai, N.V. Criteria and dimension reduction of linear multiple criteria optimization problems. J Glob Optim 52, 499–508 (2012). https://doi.org/10.1007/s10898-011-9764-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-011-9764-4

Keywords

Search

Navigation