Measuring the Balance Space Sensitivity in Vector Optimization

  • Alejandro Balbás
  • Pedro Jiménez Guerra
Conference paper
Part of the Advances in Soft Computing book series (AINSC, volume 12)


Recent literature has shown that the balance space approach may be a significant alternative to address several topics concerning vector optimization. Although this new look also leads to the efficient set and, consequently, is equivalent to the classical viewpoint, it yields new results and algorithms, as well as new economic interpretations, that may be very useful in theoretical frameworks and practical applications. The present paper focuses on the sensitivity of the balance set. We prove a general envelope theorem that yields the sensitivity with respect to any parameter considered in the problem. Furthermore, we provide a dual problem that characterizes the primal balance space and its sensitivity. Finally, we also give the implications of our results with respect to the sensitivity of the efficient set.


Ideal Point Vector Optimization Dual Solution Vector Optimization Problem Pareto Solution 
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. [1]
    Balbás, A., Ballvé, M. and P.J. Guerra, 1999, “Sensitivity analysis in multiobjective programming under homogeneity assumptions.” Journal of Multi-Criteria Decision Analysis, 8, 133–138.CrossRefGoogle Scholar
  2. [2]
    Balbâs, A., Fernândez, F.J. and P.J. Guerra, 1995, “On the envolvent theorem in multiobjective programming ” Indian Journal of Pure and Applied Mathematics, 26, 11, 1035–1047.Google Scholar
  3. [3]
    Balbâs, A. and P.J. Guerra, 1996, “Sensitivity analysis for convex multiobjective programming in abstract spaces.” Journal of Mathematical Analysis and Applications, 202, 645–658.CrossRefGoogle Scholar
  4. [4]
    Balbâs, A. and A. Heras, 1993, “Duality theory for infinite-dimensional multiobjective linear programming ” European Journal of Operational Research, 68, 379–388.CrossRefGoogle Scholar
  5. [5]
    Ehrgott, M., Harnacher, H.W., Klamroth, K., Nickel, S., Schobel, A. and M.M. Wiecek, 1997, “A Note on the equivalence of balance points and Pareto solutions in multiple objective programming ” Journal of Optimization. Theory and Applications, 92, 209–212.CrossRefGoogle Scholar
  6. [6]
    Galperin, E.A., 1990, “ The Cubic Algorithm for Optimization and Control.” NP Research Publication. Montreal, Québec, Canada.Google Scholar
  7. [7]
    Galperin, E.A., 1992, “Nonscalarized multiobjective global optimization.” Journal of Optimization. Theory and Applications, 75, 69–85.CrossRefGoogle Scholar
  8. [8]
    Galperin, E.A., 1997, “Pareto analysis vis-à-vis balance space approach in multiobjective global optimization,” Journal of Optimization. Theory and Applications, 93, 3, 533–545.Google Scholar
  9. [9]
    Galperin, E.A. and M.M. Wiecek, 1999, “Retrieval and use of the balance set in multiobjective global optimization,” Computers and Mathematics with Applications, 37, 111–123.CrossRefGoogle Scholar
  10. [10]
    Jahn, J., 1986, “Mathematical vector optimization in partially ordered linear spaces.” Verlag Peter Lang, Frankfurt am Main.Google Scholar
  11. [11]
    Klose, J., 1992, “Sensitivity analysis using the tangent derivative.” Numerical Functional Analysis and Optimization, 13, 143–153.CrossRefGoogle Scholar
  12. [12]
    Kuk, H., Tanino, J. and M. Tanaka, 1996, “Sensitivity analysis in vector optimization. ” Journal of Optimization. Theory and Applications, 89; 713–730.Google Scholar
  13. [13]
    Luenberger, D.G., 1969, “Optimization by vector space methods.” Wiley. New York.Google Scholar
  14. [14]
    Meyer-Nieberg, P., 1991, “Banach lattices.” Springer-Verlag. New York.Google Scholar
  15. [15]
    Sawaragi, Y., H. Nakayama and T Tanino, 1985, “Theory of multiobjective optimization.” Academic Press.Google Scholar
  16. [16]
    Zowe, S., 1977, “The saddle point theorem of Kuhn and Tucker in ordered vector spaces.” Journal of Mathematical Analysis and Applications, 57, 41–55.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Alejandro Balbás
    • 1
  • Pedro Jiménez Guerra
    • 2
  1. 1.Departamento de Economia de la EmpresaUniversidad Carlos IIIGetafeMadrid (Spain)
  2. 2.Departamento de Matemáticas FundamentalesU.N.E.D.Madrid (Spain)

Personalised recommendations