Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Towards equitable distribution via proportional equity constraints

  • Published:
Mathematical Programming Submit manuscript

Abstract

We propose a new approach to the formulation of models for solving problems of equitable distribution. Equity is achieved by the use of “proportional equity constraints” which require that each recipient must receive ashare of the total distribution which falls within a prespecified range. The algorithmic implications of this new approach are illustrated using two mathematical models. We consider the problem of maximizing total flow in a multiterminal network with proportional equity constraints. An efficient algorithm for solving this problem is provided. As a further application, we show that the introduction of such constraints still permits easy solutions for the linear knapsack problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • J.R. Brown, “The sharing problem,”Operations Research 27 (1979a) 324–340.

    Google Scholar 

  • J.R. Brown, “The knapsack sharing problem,”Operations Research 27 (1979b) 341–355.

    Google Scholar 

  • L.R. Ford, Jr. and D.R. Fulkerson,Flows in Networks (Princeton University Press, Princeton, NJ, 1962).

    Google Scholar 

  • S. Fujishige, “Lexicographically optimal base of a polymatroid with respect to a weight vector,”Mathematics of Operations Research 5 (1980) 186–196.

    Google Scholar 

  • G. Gallo, M.D. Grigoriadis and R.E. Tarjan, “A fast parametric maximum flow algorithm,”SIAM Journal on Computing 18 (1989) 30–55.

    Google Scholar 

  • T. Ichimori, H. Ishii and T. Nishida, “Optimal sharing,”Mathematical Programming 23 (1982) 341–348.

    Google Scholar 

  • S. Kaplan, “Application of programs with maximin objective functions to problems of optimal resource allocation,”Operations Research 22 (1974) 802–807.

    Google Scholar 

  • V.M. Malhotra, M.P. Kumar and S.N. Maheshwari, “An O(|V|3) algorithm for finding maximum flows in networks,”Information Processing Letters 7 (1978) 277–278.

    Google Scholar 

  • M. Minoux, “Flots equilibries et flots avec securité,”Informatique 1 (1976) 5–16.

    Google Scholar 

  • J. Rawls,A Theory of Justice (Harvard University Press, Cambridge, MA, 1971).

    Google Scholar 

  • U. Zimmerman, “Duality for balanced submodular flows,”Discrete Applied Mathematics 15 (1986) 365–376.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hall, N.G., Vohra, R.V. Towards equitable distribution via proportional equity constraints. Mathematical Programming 58, 287–294 (1993). https://doi.org/10.1007/BF01581272

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01581272

Key words