Abstract
A major goal in any optimization or decision-making process is to identify a single or all best solutions within a set of feasible alternatives. In multiple objective programming (MOP), while it is theoretically possible to identify the complete set of efficient solutions, finding an exact description of this set often turns out to be practically impossible or computationally too expensive. Thus many research efforts during the last thirty years have focused on concepts and procedures for the efficient set approximation.
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 subscriptionsAuthor information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wiecek, M., Engau, A. (2007). Promoting ε-Efficiency in Multiple Objective Programming: Theory, Methodology, and Application. In: Waldmann, KH., Stocker, U.M. (eds) Operations Research Proceedings 2006. Operations Research Proceedings, vol 2006. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69995-8_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-69995-8_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69994-1
Online ISBN: 978-3-540-69995-8
eBook Packages: Business and EconomicsBusiness and Management (R0)