Abstract
The theorem of efficiency shows that every efficient solution of a multiple objective linear program (MOLP) is the optimal solution of a parametric opti-mization problem. For the parametric optimization one uses weighted sums
for the k objective functions c i (x 1,…, x n), i = 1,…, k where the weights have the properties that and λ i > 0 and λ i = 1,…, k = 1. To get every efficient solution one has to organize effectively a search of these vectors (1, 0,…, 0) which de¬livers different efficient solutions. We decompose the poly tope given by the unit vectors (1,0,…,0),…,(0,…,0,1) into the poly topes which correspond to the efficient solutions. This decomposition can be performed by an algorithm using hyperplanes. Our methods will be examined for vector-weighted matchings but of course apply to every multiobjective linear program. We consider a simple bipartite graph G where the edges have weights w(e) = [w 1(e),…,[w n (e)] of vectors of positive reals. A matching M of G is called efficient if there is no other matching M’ with
where w i (M) is the sum of the ith components of the weights of all edges contained in the matching M. The problem to find the efficient matchings can be considered as a problem in multicriteria optimization. One can even present this problem as multiple objective linear program (MOLP). The solution of such a problem provides some unexpected difficulties.
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
Ch. R. Chegireddy, H. W. Hamacher, Algorithms for finding the fc-best perfect matchings. Discrete Appl. Math. 18 (1987) 155–165
H. W. Hamacher, M. Queyranne, K-best solutions to combinatorial optimization problems. Ann. Oper. Res. 4(1985/6) 12233–1143
H. Isermann, The enumeration of the set of all efficient solutions for a linear multiple objective program. Opl. Res. Q. 28 (1977) 711–725
D. Schweigert, Linear extensions and vector-valued spanning trees. Methods of operations research 60, Anton Hain Frankfurt 1990.
D. Schweigert, Lineatr extensions and efficient trees. Uni. Kaiserslautern, preprint 172 (1990)
R. E. Steuer, Multiple criteria optimization: Theory, computation and application. Wiley, New York, 1986
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Kluwer Academic Publishers
About this chapter
Cite this chapter
Schweigert, D. (1995). Vector-Weighted Matchings. In: Colbourn, C.J., Mahmoodian, E.S. (eds) Combinatorics Advances. Mathematics and Its Applications, vol 329. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3554-2_19
Download citation
DOI: https://doi.org/10.1007/978-1-4613-3554-2_19
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-3556-6
Online ISBN: 978-1-4613-3554-2
eBook Packages: Springer Book Archive