Towards equitable distribution via proportional equity constraints

DOI10.1007/BF01581272zbMath0780.90038OpenAlexW2073947723MaRDI QIDQ1803612

Rakesh V. Vohra, Nicholas G. Hall

Publication date: 29 June 1993

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01581272

zbMATH Keywords

linear knapsack problemtotal flowmultiterminal networkproportional equity constraints

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (4)

Allocation rules on networks ⋮ Optimality conditions for distributive justice ⋮ A submodular optimization problem with side constraints ⋮ A strongly polynomial time algorithm for a constrained submodular optimization problem

Cites Work

• Unnamed Item
• Duality for balanced submodular flows
• An \(O(IVI^3)\) algorithm for finding maximum flows in networks
• Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
• Optimal sharing
• The Sharing Problem
• The Knapsack Sharing Problem
• A Fast Parametric Maximum Flow Algorithm and Applications
• Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation

This page was built for publication: Towards equitable distribution via proportional equity constraints