Finally, it must be remarked that Possibilistic MFA estimations have been cast as linear optimisation problems, for which widely-known and efficient tools exist (a MATLAB script solving example 1 is given in the additional file 2 to illustrate this point).
It was further pointed out in [6] that model (8) can be cast as a linear program.
It is shown that the problem of choosing the optimal routing, both under working conditions and under single link failure scenarios, can be cast as a linear program of reasonable size.
The PMFA will be cast as a linear programming problem; this is the reason why the non-negative decision variables ε1 and μ1 were introduced in substitution of e m.
Therefore we solve the problem for the l1 norm [19], which can be cast as a standard linear program which is convex and tractable, and solved efficiently using general purpose solvers such as simplex and interior point methods [20].
In the present work, we show that the overall system with delays, erasures, quantization effects, and multiple descriptions, can be cast as a Markov jump linear system (MJLS), which makes it possible to use general stability results from the MJLS literature [26, 27].
Existence conditions for the control structure can be cast as (convex) optimization problems over Linear Matrix Inequalities.
Existence conditions for these two control structures can be cast as (convex) optimization problems over linear matrix inequalities (LMIs).
The problem can be cast as a bilevel mixed-integer linear program (MILP), Equations (2 - 8), where each reaction j is assigned a Boolean variable y j ∈ {0,1}.
The control design problem is cast as a linear matrix inequality (LMI) optimization.
