Abstract
Changes or probable errors in input data in a Multiple Objective Linear Program raise the following question: What are the limits within which parameters can be varied without affecting the solution?
Sensitivity analysis enables the analyst to obtain answers which, otherwise, can be obtained only by formulating and solving different problems repeatedly. In this paper we address the problem of changes in the Objective Function Matrix and propose a solution method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Belenson, S. M. and Kapur, K. C., “An Algorithm for Solving Multicriterion Linear Programming Problems with Examples”, Operational Research Quarterly, Vol. 24 (1973), pp. 65–77.
Benayoun, R., de Montgolfier, J., Tergny, J. and Laritchev, O., “Linear Programming with Multiple Objective Functions: Step Method (STEM)” Mathematical Programming, Vol. 1 (1971), pp. 366–375.
Da Cunha, N. D. and Ploak, E., “Constrained Minimization Under Vector Valued Criteria in Finite Dimensional Space”, Journal of Mathematical Analysis and Applications, Vol. 19 (1967), pp. 103–124.
Deshpande, D. V., “Investigations in Multiple Objective Linear Programming—Theory and an Application”, Doctoral Dissertation in Progress, School of Management, SUNY Buffalo, (1979).
Deshpande, D. V. and Zionts, S., “Sensitivity Analysis in Multiple Ovjective Linear Programming”, Working Paper, School of Management, SUNY Buffalo, (1979).
Ecker, J. G. and Kouada, I. A., “Finding All Efficient Extreme Points for Linear Multiple Objective Programs”, Mathematical Programming, Vol. 14 (1978), pp. 249–261.
Evans, J. P. and Steuer, R. E., “A Revised Simplex Method for Linear Multiple Objective Programs”, Mathematical Programming, Vol. 15 (1973), pp. 54–72.
Gal, T., “A General Method for Determining the Set of All Efficient Solutions to a Linear Vector-maximum Problem”, Institut für Wirtschaftswissenschaften, Aachen, September 1976.
Gal, T. and Leberling, H., “Relaxation Analysis in Linear Vector Valued Optimization”, Institut für Wirtschaftswissenschaften, Aachen, Working Paper No. 76-15, November 1976.
Geoffrion, A. M., “Proper Efficiency and the Theory of Vector Maximization”, Journal of Mathematical Analysis and Applications, Vol. 22 (1968), pp. 618–630.
Gillmore, P. C, and Gomory, R. E., “A Linear Programming Approach to the Culting Stock Problem, Part II.”, Operations Research, Vol. 11 (1963), pp. 863–888.
Hegner, N. S., “Multiple Objective Linear Programming”, Unpublished Doctoral Dissertation, Rensselaer Polytechnic Institute, 1977.
Isermann, H., “The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program”, Operational Research Quarterly, Vol. 28 (1977), pp. 711–725.
Kornbluth, J. S. H., “Duality, Indifference and Sensitivity Analysis in Multiple Objective Linear Programming”, Operational Research Quarterly, Vol. 25 (1974), pp. 519–614.
Philip, J., “Algorithms for the Vector Maximization Problem”, Mathematical Programming, Vol. 2 (1972), pp. 207–229.
Thompson, G. L., Tonge, F. M., and Zionts, S., “Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems”, Management Science, Vol. 12 (1966), pp. 588–608.
Zeleny, M., “Linear Multiobjective Programming”, New York, Springer — Verlag, 1974.
Zionts, S., “Size Reduction Techniques in Linear Programming and Their Applications”, Unpublished Doctoral Dissertation, Carnegie-Mellon University, 1965.
Zionts, S. and Wallenius, J., “An Interactive Programming Method for Solving the Multiple Criteria Problem”, Management Science, Vol. 22 (1976), pp. 652–663.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Deshpande, D.V., Zionts, S. (1980). Sensitivity Analysis in Multiple Objective Linear Programming: Changes in the Objective Function Matrix. In: Fandel, G., Gal, T. (eds) Multiple Criteria Decision Making Theory and Application. Lecture Notes in Economics and Mathematical Systems, vol 177. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-48782-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-48782-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09963-5
Online ISBN: 978-3-642-48782-8
eBook Packages: Springer Book Archive