pith. sign in

arxiv: 1504.02532 · v2 · pith:3XDIXGVZnew · submitted 2015-04-10 · 🧮 math.OC · cs.SI

Optimal Design of Switched Networks of Positive Linear Systems via Geometric Programming

classification 🧮 math.OC cs.SI
keywords networkdesigncostcost-optimalframeworkgeometriclinearoptimization
0
0 comments X
read the original abstract

In this paper, we propose an optimization framework to design a network of positive linear systems whose structure switches according to a Markov process. The optimization framework herein proposed allows the network designer to optimize the coupling elements of a directed network, as well as the dynamics of the nodes in order to maximize the stabilization rate of the network and/or the disturbance rejection against an exogenous input. The cost of implementing a particular network is modeled using posynomial cost functions, which allow for a wide variety of modeling options. In this context, we show that the cost-optimal network design can be efficiently found using geometric programming in polynomial time. We illustrate our results with a practical problem in network epidemiology, namely, the cost-optimal stabilization of the spread of a disease over a time-varying contact network.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.