Abstract
In vector maximum problems among the given objective functions may be some which do not influence the set of all efficient solutions. Deleting such objectives the matrix of the corresponding coefficients is reduced in size. Working with the size reduced matrix saves computer time when eg. a compromise solution is to be determined. A straightforward method is described how to determine at least a part of the deletable objective functions.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Focke, J. 1973: Vektormaximumproblem und parametrische Optimierung. Math. Oper.-forsch. Stat. 4, 365–369
Gal, T. 1977: A General Method for Determining the Set of all Efficient Solutions to a Linear Vectormaximum Problem. European J. of OR 1, 307–322
Gal, T. and H. Leberling 1977: Redundant Objective Functions in Linear Vectormaximum problems and their Determination European J. of OR 1, 176–184
Leberling, H. 1977: Zur Theorie der linearen Vektormaximumprobleme. Dissertation, RWTH Aachen
Tshernikov, S.M. 1971: Lineare Ungleichungen. Deutscher Verlag der Wissenschaften, Berlin
Wets, R.J.-B. and Witzgall, C. 1967: Algorithms for Frames and Linear Spaces of Cones. J. Res. Nat. Bur. Standards, Sect. B71, 1
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
Gal, T. (1980). A Note on Size Reduction of the Objective Functions Matrix in Vector Maximum Problems. 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_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-48782-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09963-5
Online ISBN: 978-3-642-48782-8
eBook Packages: Springer Book Archive