Zusammenfassung
In diesem Artikel wird eine Methode zur Bestimmung aller effizienten Punkte eines Vektoroptimierungsproblems mit stückweise linearen Zielfunktionen dargestellt. Der Ansatz beruht auf einer Unterteilung des Raumes in Zellen, in denen das Problem linear ist. Die Konzepte der Zell-Effizienz sowie der Komplex-Effizienz und ihre Beziehung zur allgemeinen Effizienz werden dargestellt. Anwendungen in Standorttheorie und Worst-Case Analyse werden besprochen und das Konzept wird an einem Beispiel verdeutlicht.
Abstract
An approach to generating all efficient solutions of multiple objective programs with piece- wise linear objective functions and linear constraints is presented. The approach is based on the decomposition of the feasible set into subsets, referred to as cells, so that the original problem reduces to a series of linear multiple objective programs over the cells. The concepts of cell-efficiency and complex-efficiency are introduced and their relationship with efficiency is examined. Applications in location theory as well as in worst case analysis are highlighted.
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
Burkard, R. E., Hamacher, H. W., and Rote, G. (1991). Sandwich approximation of univariate convex functions with an application to separable convex programming.Naval Research Logistics Quarterly, 38:911–924.
Ehrgott, M., Hamacher, H., Klamroth, K., Nickel, S., Schoebel, A., and Wiecek, M. (1996). A note on the equivalence of balance points and pareto solutions in multiple objective programming.Journal of Optimization Theory and Applications. To appear.
Gal, T. (1986). On efficient sets in vector maximum problems - a brief survey.European Journal of Operational Research, 24:253–264.
Geoffrion, A. M. (1968). Proper efficiency and the theory of vector maximization.Journal of Mathematical Aixalysis and Applications, 22:618–630.
Hamacher, H. W., and Nickel, S. (1993). Multicriterial planar location problems. Technical Report 243, Department of Mathematics, University of Kaiserslautern. Accepted by European Journal of Operational Research.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nickel, S., Wiecek, M.M. (1997). A Flexible Approach to Piecewise Linear Multiple Objective Programming. In: Operations Research Proceedings 1996. Operations Research Proceedings, vol 1996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60744-8_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-60744-8_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62630-5
Online ISBN: 978-3-642-60744-8
eBook Packages: Springer Book Archive