Skip to main content

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 6))

  • 508 Accesses

Abstract

This work develops a foundation for the parametric analysis of large, potentially degenerate multiple objective decision problems. The development is based on Dauer’s objective space analysis of multiple objective linear programs (MOLP) and utilizes Gal’s work on degeneracy graphs. A discussion of related nonlinear analysis is presented, and sensitivity analysis for linear goal programs is developed.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 219.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 279.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 279.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Armand, P.: Finding all maximal efficient faces in multiobjective linear programming, Mathematical Programming 61 (1993) 357–375.

    Article  Google Scholar 

  2. Bana e Costa, C.A.: A methodology for sensitivity analysis in three-criteria problems: A case study in municipal management, European Journal of Operational Research 33 (1988) 159–173.

    Article  Google Scholar 

  3. Belton, V., S. Vickers: “Use of a simple multi-attribute value function incorporating visual interactive sensitivity analysis for multiple criteria decision making”. In: C.A. Bana e Costa (ed.): Readings in Multiple Criteria Decision Aid. Springer-Verlag, New York, NY 1990, pp. 319.

    Chapter  Google Scholar 

  4. Benson, H.P.: A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions, Journal of Global Optimization 6 (1994) 231–251.

    Article  Google Scholar 

  5. Bless, M.: Sensitivität in der Vektoroptimierung, Ph.D. Thesis, Institut für Numerisene und Angewandte Mathematik, Universität Göttingen, Germany 1990.

    Google Scholar 

  6. Chames, A., W.W. Cooper: Management Model and Industrial Applications of Linear Programming, Vol. 1, John Wiley, New York, NY 1961.

    Google Scholar 

  7. Charnes, A., W.W. Cooper: Goal programming and multiple objective, European Journal of Operational Research 1(1977) 39–54.

    Google Scholar 

  8. Craven, B.D.: On sensitivity analysis for multicriteria optimization, Optimization 19 (1988) 513–524.

    Article  Google Scholar 

  9. Dauer, J.P.: An equivalence result for solutions of multiobjective linear programs, Computers and Operations Research 7 (1980) 33–39.

    Article  Google Scholar 

  10. Dauer, J.P.: Analysis of the objective space in multiple objective linear programming, Journal of Mathematical Analysis and Applications 126 (1987) 579–593.

    Article  Google Scholar 

  11. Dauer, J.P.: “Numerical methods in multicriteria optimization”. In: W. Stadler (ed.) Applications of Multicriteria Optimization in Engineering and in the Sciences. Plenum Press, New York, NY 1987, pp. 27–47.

    Google Scholar 

  12. Dauer, J.P.: Optimization over the efficiency set using an active constraint approach, Zeitschrift Für Operations Research-Methods and Models of Operations Research 35 (1991) 185–195.

    Google Scholar 

  13. Dauer, J.P.: On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program, Annals of Operations Research 47 (1993) 279–292.

    Article  Google Scholar 

  14. Dauer, J.P., R.J. Gallagher: A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs, European Journal of Operational Research 88 (1996)368–381.

    Article  Google Scholar 

  15. Dauer, J. P., R.J. Krueger: An interative approach to goal programming, Operational Research Quarterly 28 (1977) 671–681.

    Article  Google Scholar 

  16. Dauer, J.P., R.J. Krueger: A multiobjective optimization model for water resources planning, Applied Mathematical Modelling 4 (1980) 171–175.

    Article  Google Scholar 

  17. Dauer, J.P., Y.-H. Liu: Solving multiple objective linear programs in objective space, European Journal of Operational Research 46 (1990) 350–357.

    Article  Google Scholar 

  18. Dauer, J.P., O.A. Saleh: Constructing the set of efficient objective values in multiple objective linear programs, European Journal of Operational Research 46 (1990) 358–365.

    Article  Google Scholar 

  19. Dauer, J.P., O.A. Saleh: A representation of the set of feasible objectives in multiple objective linear programs, Linear Algebra and Its Applications 166 (1992) 261–275.

    Article  Google Scholar 

  20. Dauer, J.P., W. Stadler: A survey of vector optimization in infinite-dimensional space, part 2, Journal of Optimization Theory and Applications 51 (1986) 205–242.

    Article  Google Scholar 

  21. Deif, A.: Sensitivity Analysis in Linear Systems, Springer-Verlag, Heidelberg 1986.

    Book  Google Scholar 

  22. Duesing, E.C.: Polyhedral convex sets and the economic analysis of production, Ph.D. Thesis, Department of Economics, University of North Carolina at Chapel Hill, Chapel Hill, NC 1978.

    Google Scholar 

  23. Duesing, E.C.: Generalized nondominance relationships and algorithms for multiple objective linear programming. Proc. of the Third Conference in Multiple Criteria Decision Making-Theory and Application, Koningswinter, West Germany, 1979.

    Google Scholar 

  24. Dyer, J.S.: Interactive goal programming, Management Science 19 (1972) 62–70.

    Article  Google Scholar 

  25. Ecker, J.G., I.A. Kouada: Finding efficient points for linear multiple objective programs, Mathematical Programming 8 (1975) 373–377.

    Article  Google Scholar 

  26. Ecker, J.G., N.S. Hegner: On computing an initial efficient extreme point, Journal of the Operational Research Society 29 (1978) 1005–1007.

    Google Scholar 

  27. Ecker, J.G., N.S. Hegner, Hegner and I.A. Kouada: Generating all maximal efficient faces for multiple objective linear programs, Journal of Optimization Theory and Applications 30 (1980) 353–381.

    Article  Google Scholar 

  28. El-Abyad, A.M.: Geometric approach to multiple objective optimization with application to multiple criteria decision making, Ph.D. Thesis, Department of Mathematics, University of Nebraska, Lincoln, NE 1986.

    Google Scholar 

  29. Fourier, J.: Solution d’une question particuliére du calcul des inégalités, Oeuvres II (1826) 317–328.

    Google Scholar 

  30. Gal, T.: A general method for determining the set of all efficient solutions to a linear vector maximum problem, European Journal of Operational Research 1 (1977) 307–322.

    Article  Google Scholar 

  31. Gal, T.: Determination of all neighbours of a degenerate extreme point in polytopes, Work paper no. 17b, FernUniversität Hagen, FB Wirtschaftswiss., 1978.

    Google Scholar 

  32. Gal, T.: Postoptimal Analysis, Parametric Programming, and Related Topics, 2nd Edition, Walter de Gruyter, Berlin 1995.

    Google Scholar 

  33. Gal, T.: “Postefficient sensitivity analysis in linear vector-maximum problems”. In: P. Nijkamp and J. Spronk (eds.): Multiple Criteria Analysis: Operational Methods. Gower Press, London 1981, pp. 259–271.

    Google Scholar 

  34. Gal, T.: On the structure of the set of bases of a degenerate point, Journal of Optimization Theory and Applications 45 (1985) 577–589.

    Article  Google Scholar 

  35. Gal, T.: A general method for determining the set of all efficient solutions to a linear vector maximum problem, European Journal of Operational Research 1 (1977) 307–322.

    Article  Google Scholar 

  36. Gal, T., H. Leberling: “Relaxation analysis in multicriteria linear programming, an introduction”. In: M. Roubens, (ed.): Advances in Operation Research. Proceedings of EURO II, Stockholm 1976, pp. 177–180.

    Google Scholar 

  37. Gal, T., H. Leberling: Über unwesentliche Zielfunktionen in linearen Vektormaximum-Problem. Proc. in Operational Research. Physica, Würzburg, Erlangen, 1976.

    Google Scholar 

  38. Gal, T., H. Leberling: Redundant objective functions in linear vektormaximum-problems and a method for determining them, European Journal of Operational Research 1 (1977) 176–184.

    Article  Google Scholar 

  39. Gal, T., H. Leberling: Relaxation analysis in linear vectorvalued maximum, European Journal of Operational Research 8 (1981) 274–282.

    Article  Google Scholar 

  40. Gal, T., K. Wolf: Stability in vector maximization-a survey, European Journal of Operational Research 25 (1986) 169–182.

    Article  Google Scholar 

  41. Gallagher, R.J., O.A. Saleh: Constructing the set of efficient objective values in linear multiple objective transportation problems, European Journal of Operational Research 73 (1994) 150–163.

    Article  Google Scholar 

  42. Gallagher, R.J., O.A. Saleh: A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program, European Journal of Operational Research 80 (1995) 204–212.

    Article  Google Scholar 

  43. Gembicki, F. W., Y.Y. Haimes: Approach to performance and sensitivity multiobjective optimization: The goal attainment model, IEEE Transactions on Automatic Control (1975) 769–771.

    Google Scholar 

  44. Geue, F.: “An improved N-tree method to determine all neighbors of a degenerate vertex”. In: T. Gal (ed.): Degeneracy in optimization problems. Annals of OR Vols 46/47, Balzer Basel 1993, pp. 361–392.

    Google Scholar 

  45. Guddat, J., F.Guerra Vazquez: Multiobjective optimization using pivoting and continuation methods, Archives of Control Sciences 32 (1987) 301–317.

    Google Scholar 

  46. Guddat, J., F.Guerra Vazquez, K. Tammer, K. Wendler: Multiobjective and Stochastic Optimization Based on Parametric Optimization, Akademie Verlag, Berlin 1985.

    Google Scholar 

  47. Guddat, J., F.Guerra Vazquez, K. Tammer, K. Wendler: “On dialogue algorithms of multiobjective optimization problem based on parametric optimization”. In: I.I. Eremin, J. Guddat (eds.): Parametric optimization and ill-posed problems in mathematical optimization. Seminarbericht, No. 81, Humboldt University, Sektion Mathematik, Berlin 1986.

    Google Scholar 

  48. Guddat, J., H.Th. Jongen, B. Kummer, F. Nozicka (eds.): Parametric Optimization and Related Topics, Akademie Verlag, Berlin 1987.

    Google Scholar 

  49. Hannan, E.L.: Using duality theory of identification of primal efficient points and for sensitivity analysis in multiple objective linear programming, Journal of Operational Research Society 29 (1978) 643–649.

    Google Scholar 

  50. Hansen, P., M. Labbé and R. E. Wendell: Sensitivity analysis in multiple objective linear programming: the tolerance approach, European Journal of Operational Research 38 (1989) 63–69.

    Article  Google Scholar 

  51. Ignizio, J.P.: Linear Programming in Single- & Multiple- Objective System, Prentice-Hall, Englewood Cliffs, NJ 1982.

    Google Scholar 

  52. Ignizio J.P.: Goal Programming and Extension, D.C. Heath, Lexington, MA 1976.

    Google Scholar 

  53. Isermann, H.: The enumeration of the set of all efficient solutions for a linear multiple objective program, Operational Research Quarterly 28 (1977) 711–725.

    Article  Google Scholar 

  54. Isermann, H.: The enumeration of all efficient solutions for a linear multiple-objective transportation problem, Naval Research Logistics Quarterly 26 (1979) 123–139.

    Article  Google Scholar 

  55. Insua, D.R.: Sensitivity Analysis in Multi-Objective Decision Making, Springer-Verlag, New York, NY 1990.

    Google Scholar 

  56. Karandikar, H.M., F. Mistree: Conditional post-solution analysis of multiobjective decision support problem, Engineering Optimization 12 (1987) 43–61.

    Article  Google Scholar 

  57. Kok, M., C. Roos: On the feasible region in the objective space of a multiple objective linear programming problem, Reports of the Department of Mathematics and Informatics No. 86–01, Delft Institute of Technology, The Netherlands 1987.

    Google Scholar 

  58. Kornbluth, J.: Ranking with multiple objectives. Proc. of the Conference on Multiple Criteria Problem Solving: Theory, Methodology and Practice, State University of New York at Buffalo, 1977.

    Google Scholar 

  59. Kornbluth, J.S.H.: Duality, indifference and sensitivity analysis in multiobjective linear programming, Operations Research Quarterly 25 (1975) 599–614.

    Article  Google Scholar 

  60. Kornbluth, J.S.H.: Using duality theory for identification of primal efficient points and for sensitivity analysis in MOLP: a comment, Journal of the Operational Research Society 30 (1979), 285–287.

    Google Scholar 

  61. Kruse, H.-J.: Degeneracy Graphs and the Neighborhood Problem, Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, New York, NY 1986.

    Google Scholar 

  62. Lee S.: Goal Programming for Decision Analysis, Auerbach, Philadelphia, PA 1972.

    Google Scholar 

  63. Murty, K. G.: Faces of a polyhedron, Mathematical Programming Study 24 (1985) 30–42.

    Article  Google Scholar 

  64. Murty, K.G., S.-J. Chung: Segments in enumerating faces, Mathematical Programming 70 (1995) 27–45.

    Google Scholar 

  65. Philip, J.: Algorithms for the vector-maximization problem, Mathematical Programming 2 (1972) 459–467.

    Article  Google Scholar 

  66. Philip, J.: An algorithm for combined quadratic and multiobjective programming. Proc. of the International Conference on MCDM, Jouy-en-Josas, France, May 21–23, 1975

    Google Scholar 

  67. H. Thiriez, S. Zionts (eds.): Multiple Criteria Decision Making. Lecture Notes in Economics and Mathematical Systems No. 130, Springer-Verlag, New York, NY 1976, pp. 35–52.

    Google Scholar 

  68. Philip, J.: Vector maximization at a degenerate vertex, Mathematical Programming 13 (1977) 357–359.

    Article  Google Scholar 

  69. Sawaragi, Y., H. Nakayama and T. Tanino: Theory of Multiobjective Optimization, Academic Press, New York, NY 1985.

    Google Scholar 

  70. Schniederjans, M.J.: Goal programming: Methodology and Applications, Kluwer, Norwell, MA 1995.

    Book  Google Scholar 

  71. Schniederjans, M.J.: Linear Goal Programming, Petrocelli books, Princeton, NJ 1984.

    Google Scholar 

  72. Sebo, D.E.: Multiple objective linear programming in objective space, Ph.D. Thesis, Department of Mathematics, University of Nebraska-Lincoln, Lincoln, NE 1981.

    Google Scholar 

  73. Shim, J. K., J. Siegel: Sensitivity analysis of goal programming with preemption, International Journal of System Science 11 (1980) 393–401.

    Article  Google Scholar 

  74. Stadler, W.: A survey of multicriteria optimization or the vector maximum problem, part I: 1776–1960, Journal of Optimization Theory and Applications 29 (1979) 1–52.

    Article  Google Scholar 

  75. Stadler, W.: Stability implications and the equivalence of stability and optimality conditions in the optimal design of uniform arches. Proc. of the International Symposium on Optimum Structural Design, the 11th ONR Structural Mechanis Symposium, Tucson, AR October 19–22, 1981.

    Google Scholar 

  76. Stadler, W.: Stability of the natural shapes of sinusoidally loaded uniform shallow arches, Quarterly Journal of Mechanics and Applied Mathematics 36 (1983), 365–386.

    Article  Google Scholar 

  77. Stadler, W.: Caveats and boons of multicriteria optimization, Journal of Microcomputers in Civil Engineering 10 (1995) 291–299.

    Article  Google Scholar 

  78. Steuer, R.E.: Goal programming sensitivity analysis using interval penalty weights, Mathematical Programming 17 (1979) 16–31.

    Article  Google Scholar 

  79. Steuer, R.: Multiple Criteria Optimization, Wiley, New York, NY 1986.

    Google Scholar 

  80. Steuer, R.: Private communication, (1990).

    Google Scholar 

  81. Tanino, T.: Sensitivity analysis in multiobjective optimization, Journal of Optimization, Theory and Applications 56 (1988) 479–499.

    Google Scholar 

  82. Tanino, T.: Stability and sensitivity analysis in convex vector optimization, SIAM Journal on Control and Optimization 26 (1988) 521–536.

    Article  Google Scholar 

  83. Tanino, T., Y. Sawaragi: Stability of nondominated solutions in multicriteria decision making, Journal of Optimization, Theory and Applications 30 (1980) 229–254.

    Google Scholar 

  84. Vincent, T.L., W.J. Grantham: Optimality in Parametric Systems, John Wiley & Sons, New York, NY 1981.

    Google Scholar 

  85. Wets, R.J.B., C. Witzgall: Algorithms for frames and linearity spaces of cones, Journal of Research of the National Bureau of Standards 71B (1967) 1–7.

    Google Scholar 

  86. Wierzbicki, A.P.: On the completeness and constructiveness of parametric characterizations to vector optimization problems, OR Spektrum 8 (1986) 73–87.

    Article  Google Scholar 

  87. Wolf, K.: Sensitivity analysis in vectormaximum problems: A conedominance representation, Ph.D. Thesis, Department of Operations Research, Faculty of Economics, Fern Uiversität, Hagen 1988.

    Google Scholar 

  88. Zeleny, M.: Linear Multiobjective Programming, Springer-Verlag, New York, NY 1974.

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Science+Business Media New York

About this chapter

Cite this chapter

Dauer, J., Liu, YH. (1997). Multi-Criteria and Goal Programming. In: Gal, T., Greenberg, H.J. (eds) Advances in Sensitivity Analysis and Parametic Programming. International Series in Operations Research & Management Science, vol 6. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-6103-3_11

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-6103-3_11

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-7796-2

  • Online ISBN: 978-1-4615-6103-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics