Abstract
The sharing problem is a method to find an equitable distribution of resources by maximizing the smallest value of all “tradeoff functions” where a tradeoff function is a function of the flux to a sink node. We generalize some researches about the problem and propose a fuzzy integer sharing problem with fuzzy capacity constraints. Our model has bicriteria, i e, minimal satisfaction among all fuzzy capacity constraints and that among fluxes to all sink nodes, both of which are to be maximized.
Chapter PDF
References
Brown, J.R. (1979) The Sharing Problem: Operations Research, 27, 324–340.
Chanas, S. and Kolodziejjczyk, W. (1982) Maximum Flow in a Network with Fuzzy Arc Capacities: Fuzzy Sets and Systems, 8, 139–151.
Chanas, S. and Kolodziejczyk, W. (1986) Integer Flows in Network with Fuzzy Capacity Constraints: Networks, 16, 17–31.
Tada, M., Ishii, H., Nishida, T. and Masuda, T. (1989) Fuzzy Sharing Problem: Fuzzy Sets and Systems, 33, 303–313.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Ishii, H., Itoh, T. (1996). Fuzzy integer sharing problem with fuzzy capacity constraints. In: Doležal, J., Fidler, J. (eds) System Modelling and Optimization. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34897-1_31
Download citation
DOI: https://doi.org/10.1007/978-0-387-34897-1_31
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6671-4
Online ISBN: 978-0-387-34897-1
eBook Packages: Springer Book Archive