
Summary: We consider a generalization of the transportation problem. We formulate the problem by introducing membership functions which show a degree of satisfaction for the value of flows from source nodes and those to sink nodes. The membership function is decided in advance by a decision-maker for each source node and each sink node. The objective is to determine the flow which attains an equitable distribution such that all membership functions, as much as possible, have the same values.
Deterministic network models in operations research, Fuzzy and other nonstochastic uncertainty mathematical programming, Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
Deterministic network models in operations research, Fuzzy and other nonstochastic uncertainty mathematical programming, Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
