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

DOI10.1016/J.AUTOMATICA.2012.06.040MaRDI QIDQ1937523zbMATH OpenOpenAlexWikidataFDO

Authors Mathias Bürger, Giuseppe Notarstefano, Frank Allgöwer, Francesco Bullo

Publication date 1 March 2013

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.automatica.2012.06.040

zbMATH Keywords

asynchronous algorithmdistributed linear programmingdistributed simplexmulti-agent task assignment

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• On the efficacy of distributed simplex algorithms for linear programming
• Distributed linear programming with event-triggered communication
• Stateless distributed gradient descent for positive linear programs
• Multi-agent network flows that solve linear complementarity problems.
• A distributed algorithm for efficiently solving linear equations and its applications (special issue JCW)

Cites work

• An approach to nonlinear programming
• ASYNPLEX, an asynchronous parallel revised simplex algorithm
• Constrained Consensus and Optimization in Multi-Agent Networks
• Distributed Abstract Optimization via Constraints Consensus: Theory and Applications
• Distributed Task Assignment for Mobile Agents
• scientific article; zbMATH DE number 1239298 (Why is no real title available?)
• Lexicographic perturbation for multiparametric linear programming with applications to control
• Linear programming — Randomization and abstract frameworks
• Monotonic Target Assignment for Robotic Networks
• On Distributed Convex Optimization Under Inequality and Equality Constraints
• Selected topics on assignment problems
• The auction algorithm: A distributed relaxation method for the assignment problem
• The Decomposition Algorithm for Linear Programs
• The Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP

Cited in

(8)

• Modal consensus, synchronization and formation control with distributed endogenous internal models
• Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions
• Multi-agent coordination over local indexes via clique-based distributed assignment
• Optimal role and position assignment in multi-robot freely reachable formations
• Distributed linear programming with event-triggered communication
• Multi-agent network flows that solve linear complementarity problems.
• Networked Systems Theory: Distributed Algorithms for Optimal Cooperation of Dynamical Systems
• Distributed proximal‐gradient algorithms for nonsmooth convex optimization of second‐order multiagent systems

Describes a project that uses

Uses Software

• ASYNPLEX

This page was built for publication: A distributed simplex algorithm for degenerate linear programs and multi-agent assignments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1937523)