Polyhedral Robust Minkowski–Lyapunov Functions

This article creates a numerical platform for practical utility of the recently introduced theoretical framework of robust Minkowski–Lyapunov functions. Systems of affine inequalities and equalities whose feasibility verifies the robust Lyapunov nature of polyhedral Minkowski functions with respect to the recently introduced robust Minkowski–Lyapunov inequality are derived. The theoretically exact verification of the robust Minkowski–Lyapunov inequality in the polyhedral setting is reduced to the feasibility stage of a linear program. The topological flexibility of the proposed methods is illustrated by two examples.