Minimax Flow Over Acyclic Networks: Distributed Algorithms and Microgrid Application

Given a flow network with variable suppliers and fixed consumers, the minimax flow problem consists in minimizing the maximum flow between nodes, subject to flow conservation and capacity constraints. We solve this problem over acyclic graphs in a distributed manner by showing that it can be recast...

Full description

Bibliographic Details

Published in:	IEEE transactions on control of network systems Vol. 10; no. 2; pp. 937 - 946
Main Authors:	Coraggio, Marco, Jafarpour, Saber, Bullo, Francesco, Bernardo, Mario di
Format:	Journal Article
Language:	English
Published:	Piscataway IEEE 01.06.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Control systems design Distributed algorithms Distributed generation Image edge detection Microgrids Minimax technique network optimization problems Network systems Optimization Overcurrent Safety Transportation
ISSN:	2325-5870, 2372-2533
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!