A distributed simplex algorithm for degenerate linear programs and multi-agent assignments

  title={A distributed simplex algorithm for degenerate linear programs and multi-agent assignments},
  author={Mathias B{\"u}rger and Giuseppe Notarstefano and Francesco Bullo and Frank Allg{\"o}wer},
In this paper we propose a novel distributed algorithm to solve degenerate linear programs on asynchronous peer-to-peer networks with distributed information structures. We propose a distributed version of the well-known simplex algorithm for general degenerate linear programs. A network of agents, running our algorithm, will agree on a common optimal solution, even if the optimal solution is not unique, or will determine infeasibility or unboundedness of the problem. We establish how the multi… CONTINUE READING
Highly Cited
This paper has 74 citations. REVIEW CITATIONS
41 Citations
26 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 41 extracted citations

75 Citations

Citations per Year
Semantic Scholar estimates that this publication has 75 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 26 references

The existence of a short sequence of admissible pivots to an optimal basis in LP and LCP

  • K. Fukuda, H.-J. Lüthi, M. Namiki
  • International Transactions in Operational…
  • 1997
Highly Influential
5 Excerpts

A distributed

  • G. Yarmish, R. Slyke
  • scalable simplex method. Journal of…
  • 2009
Highly Influential
4 Excerpts

How . Consensus - based auction approaches for decentralized task assignment

  • H.-L. Choi L. Brunet, P. J.
  • 2010

Mart́ınez . On distributed convex optimization under inequality and equality constraints via primaldual subgradient methods

  • S.
  • IEEE Transactions on Automatic Control
  • 2009

Similar Papers

Loading similar papers…