A Linear System of Both Equations and Inequalities in Max-Algebra

The aim of this chapter is to present a system of linear equation and inequalities in max-al‐ gebra. Max-algebra is an analogue of linear algebra developed on the pair of operations (⊕ , ⊗ ) extended to matrices and vectors, where a⊕ b = max(a, b) and a⊗ b = a + b for a, b ∈ R. The system of equations A⊗ x = c and inequalities B⊗ x ≤ d have each been stud‐ ied in the literature. We will present necessary and sufficient conditions for the solvability of a system consisting of these two systems and also develop a polynomial algorithm for solv‐ ing max-linear program whose constraints are max-linear equations and inequalities. More‐ over, some solvability concepts of an inteval system of linear equations and inequalities will also be presented.


Introduction
The aim of this chapter is to present a system of linear equation and inequalities in max-algebra.Max-algebra is an analogue of linear algebra developed on the pair of operations ( ⊕ , ⊗ ) extended to matrices and vectors, where a ⊕ b = max ( a, b ) and a ⊗ b = a + b for a, b ∈ ℝ.The system of equations A ⊗ x = c and inequalities B ⊗ x ≤ d have each been studied in the literature.We will present necessary and sufficient conditions for the solvability of a system consisting of these two systems and also develop a polynomial algorithm for solving max-linear program whose constraints are max-linear equations and inequalities.Moreover, some solvability concepts of an inteval system of linear equations and inequalities will also be presented.
Max-algebraic linear systems were investigated in the first publications which deal with the introduction of algebraic structures called (max,+) algebras.Systems of equations with variables only on one side were considered in these publications [1], [2] and [3].Other systems with a special structure were investigated in the context of solving eigenvalue problems in correspondence with algebraic structures or synchronisation of discrete event systems, see [4] and also [1] for additional information.Given a matrix A, a vector b of an appropriate size, using the notation ⊕ = max, ⊗ = plus, the studied systems had one of the following forms: A ⊗ x = b, A ⊗ x = x or A ⊗ x = x ⊕ b.An infinite dimensional generalisation can be found in [5].
In [1] Cuninghame-Green showed that the problem A ⊗ x = b can be solved using residuation [6].That is the equality in A ⊗ x = b be relaxed so that the set of its sub-solutions is studied.It was shown that the greatest solution of A ⊗ x ≤ b is given by x ¯ where The equation A ⊗ x = b is also solved using the above result as follows: The equation A ⊗ x = b has solution if and only if A ⊗ x ¯= b.Also, Gaubert [7] proposed a method for solving the one-sided system x = A ⊗ x ⊕ b using rational calculus.
Zimmermann [3] developed a method for solving A ⊗ x = b by set covering and also presented an algorithm for solving max-linear programs with one sided constraints.This method is proved to has a computational complexity of O ( mn ) , where m, n are the number of rows and columns of input matrices respectively.Akian, Gaubert and Kolokoltsov [5] extended Zimmermann's solution method by set covering to the case of functional Galois connections.
Butkovic [8] developed a max-algebraic method for finding all solutions to a system of inequalities x i -x j > b ij , i, j = 1, ..., n using n generators.Using this method Butkovic [8] developed a pseudopolynomial algorithm which either finds a bounded mixed-integer solution, or decides that no such solution exists.Summary of these results can be found in [9] and [10] Cechla ´rova and Diko [11] proposed a method for resolving infeasibility of the system A ⊗ x = b .The techniques presented in this method are to modify the right-hand side as little as possible or to omit some equations.It was shown that the problem of finding the minimum number of those equations is NP-complete.

Max-algebra and some basic definitions
In this section we introduce max-algebra, give the essential definitions and show how the operations of max-algebra can be extended to matrices and vectors.
In max-algebra, we replace addition and multiplication, the binary operations in conventional linear algebra, by maximum and addition respectively.For any problem that involves adding numbers together and taking the maximum of numbers, it may be possible to describe it in max-algebra.A problem that is nonlinear when described in conventional terms may be converted to a max-algebraic problem that is linear with respect to ( ⊕ , ⊗ ) = ( max , + ) .
The completed min-plus semiring ℝ ¯min is defined in the dual way.

Proposition 1
The following properties hold for all a, b, c ∈ ℝ ¯: The statements follow from the definitions.

Proposition 4
The following hold for A, B, C, a, b, c, x, y of compatible sizes and α, β ∈ ℝ: The statements follow from the definition of the pair of operations (⊕ ,⊗ ).
Definition 3 Given real numbers a, b, c, ⋯ , a max-algebraic diagonal matrix is defined as: Definition 4 Max-algebraic identity matrix is a diagonal matrix with all diagonal entries zero.We denote by I an identity matrix.Therefore, identity matrix I = diag ( 0, 0, 0, ⋯ ) .
It is obvious that A ⊗ I = I ⊗ A for any matrices A and I of compatible sizes.
Definition 5 Any matrix that can be obtained from the identity matrix, I , by permuting its rows and or columns is called a permutation matrix.A matrix arising as a product of a diagonal matrix and a permutation matrix is called a generalised permutation matrix [12].
The matrix B is unique and will be called the inverse of A. We will henceforth denote B by A -1 .
It has been shown in [1] that a matrix is invertible if and only if it is a generalised permutation matrix.

Example 4
Consider the following matrices The matrix B is an inverse of A because, Given a matrix A = (a ij ) ∈ ℝ ¯, the transpose of A will be denoted by A T , that is A T = (a ji ).
Structures of discrete-event dynamic systems may be represented by square matrices A over the semiring: A Linear System of Both Equations and Inequalities in Max-Algebra http://dx.doi.org/10.5772/48195 The system ℜ is embeddable in the self-dual system: Basic algebraic properties for ⊕ ' and ⊗ ' are similar to those of ⊕ and ⊗ described earlier.
These are obtained by swapping ≤ and ≥ .Extension of the pair ( ⊕ ' , ⊗ ' ) to matrices and vectors is as follows: Given A, B of compatible sizes and α ∈ ℝ, we define the following: Also, properties of matrices for the pair ( ⊕ ' , ⊗ ' ) are similar to those of ( ⊕ , ⊗ ) , just swap ≤ and ≥ .For any matrix A = a ij over ℝ ¯, the conjugate matrix is A * = -a ji obtained by negation and transposition, that is A = -A T .

Proposition 5
The following relations hold for any matrices U , V , W over ℝ ¯ .
Follows from the definitions.

The Multiprocessor Interactive System (MPIS): A practical application
Linear equations and inequalities in max-algebra have a considerable number of applications, the model we present here is called the multiprocessor interactive system (MPIS) which is formulated as follows: Products P 1 , ⋯ , P m are prepared using n processors, every processor contributing to the completion of each product by producing a partial product.It is assumed that every processor can work on all products simultaneously and that all these actions on a processor start as soon as the processor is ready to work.Let a ij be the duration of the work of the j th processor needed to complete the partial product for denote by x j the starting time of the j th processor ( j = 1, ⋯ , n ) .Then, all partial products for P i ( i = 1, ⋯ , m; j = 1, ⋯ , n ) will be ready at time max (a i1 + x 1 , ⋯ , a in + x n ).If the com- pletion times b 1 , ⋯ , b m are given for each product then the starting times have to satisfy the following system of equations: Using the notation a ⊕ b = max ( a, b ) and a ⊗ b = a + b for a, b ∈ ℝ extended to matrices and vectors in the same way as in linear algebra, then this system can be written as Any system of the form (▭) is called 'one-sided max-linear system'.Also, if the requirement is that each product is to be produced on or before the completion times b 1 , ⋯ , b m , then the starting times have to satisfy which can also be written as The system of inequalities (▭) is called 'one-sided max-linear system of inequalities'.

Linear equations and inequalities in max-algebra
In this section we will present a system of linear equation and inequalities in max-algebra.Solvability conditions for linear system and inequalities will each be presented.A system consisting of max-linear equations and inequalities will also be discussed and necessary and sufficient conditions for the solvability of this system will be presented.

System of equations
In this section we present a solution method for the system A ⊗ x = b as given in [3], [1], [13] and also in the monograph [10].Results concerning the existence and uniqueness of solution to the system will also be presented.
is called a one-sided max-linear system, some times we may omit 'max-linear' and say one-sided system.This system can be written using the conventional notation as follows The system in (▭) can be written after subtracting the right-hand sides constants as A one-sided max-linear system whose all right hand side constants are zero is called normalised max-linear system or just normalised and the process of subtracting the right-hand side constants is called normalisation.Equivalently, normalisation is the process of multiplying the system (▭) by the matrix B ' from the left.That is where, For instance, consider the following one-sided system: After normalisation, this system is equivalent to That is after multiplying the system (▭) by Consider the first equation of the normalised system above, that is max(x 1 -7, x 2 -4, x 3 -2) = 0.This means that if (x 1 , x 2 , x 3 ) T is a solution to this system then x 1 ≤ 7,x 2 ≤ 4, x 3 ≤ 2 and at least one of these inequalities will be satisfied with equality.From the other equations of the system, we have for x 1 ≤ 3, x 1 ≤ 2, hence we have where -x ¯1 is the column 1 maximum.It is clear that for all j then x j ≤ x ¯j, where -x ¯j is the column j maximum.At the same time equality must be attained in some of these inequalities so that in every row there is at least one column maximum which is attained by x j .This observation was made in [3].
Definition 7 A matrix A is called doubly ℝ-astic [14], [15], if it has at least one finite element on each row and on each column.
We introduce the following notations We now consider the cases when A = -∞ and/or b = -∞.Suppose that b = -∞.Then S ( A, b ) can simply be written as

Thus, we may assume in this section
as a result the k th equation could be removed from the system together with every column j in the matrix A where a kj ≠ -∞ (if any), and set the corresponding x j = -∞.Consequently, we may assume without loss of generality that b ∈ ℝ m .Moreover, if b ∈ ℝ m and A has an -∞ row then S ( A, b ) = ∅.If there is an -∞ column j in A then x j may take on any value in a solution x.Thus, in what follows we assume without loss of generality that A is doubly ℝ -astic and b ∈ ℝ m .
A Linear System of Both Equations and Inequalities in Max-Algebra http://dx.doi.org/10.5772/48195

Suppose x ∈ S ( A, b
) .Thus we have, Hence k ∈ M j and x j = x ¯j.
Suppose that x ≤ x ¯ and At the same time k ∈ M j for some j ∈ N satisfying x j = x ¯j.For this j both inequalities in (▭) are equalities and thus A ⊗ x = b.The following is a summary of prerequisites proved in [1] and [12]: , and we will call it likewise.The principal solution will also be used when studying the systems A ⊗ x ≤ b and also when solving the one-sided system containing both equations and inequalities.The one-sided systems containing both equations and inequalities have been studied in [16] and the result will be presented later in this chapter.
Note that the principal solution may not be a solution to the system A ⊗ x = b.More precisely, the following are observed in [12]: Corollary 1 Let A = (a ij ) ∈ ℝ ¯m×n be doubly ℝ -astic and b ∈ ℝ m .Then the following three statements are equivalent: The statements follow from Theorems ▭ and ▭.
For the existence of a unique solution to the max-linear system A ⊗ x = b we have the following corollary: Follows from Theorem ▭.The question of solvability and unique solvability of the system A ⊗ x = b was linked to the set covering and minimal set covering problem of combinatorics in [12].

System of inequalities
In this section we show how a solution to the one-sided system of inequalities can be obtained.
Let A = (a ij ) ∈ ℝ m×n and b = (b 1 , ⋯ , b m ) T ∈ ℝ.A system of the form: is called one-sided max-linear system of inequalities or just one-sided system of inequalities.The one-sided system of inequalities has received some attention in the past, see [3], [1] and [17] for more information.Here, we will only present a result which shows that the principal solution, x ¯(A, b ) is the greatest solution to (▭).That is if (▭) has a solution then x ¯(A, b ) is the greatest of all the solutions.We denote the solution set of (▭) by S ( A, b, ≤ ) .That is

Suppose x ∈ S ( A, b, ≤ ) . Then we have
A Linear System of Both Equations and Inequalities in Max-Algebra http://dx.doi.org/10.5772/4819511 and the proof is now complete.The system of inequalities was discussed in [18] where the following result was presented.

A system containing of both equations and inequalities
In this section a system containing both equations and inequalities will be presented, the results were taken from [16].
A one-sided max-linear system with both equations and inequalities is of the form: We shall use the following notation throughout this paper We also define the vector x ^= (x ^1, x ^2, ..., x ^n) T , where and N x ^= { j ∈ N ; x ^j = x ¯j}.
Then the following three statements are equivalent: and this also proves ( iii ) ( ii ) .
A Linear System of Both Equations and Inequalities in Max-Algebra http://dx.doi.org/10.5772/48195 We introduce the symbol | X | which stands for the number of elements of the set X .Proof of Case (i), that is L ≠ ∅: Suppose that L contains only one element say n That is If L contains more than one element, then the proof is done in a similar way.
Proof of Case (ii), that is L = ∅ ( J = N ) : Suppose that J = N .Then we have The statement follows from Theorem ▭ and Lemma ▭.
Linear Algebra max-linear program with one-sided equations and inequalities and will be denoted by

ML P ≤
min and [ML P ≤ max ].We denote the sets of optimal solutions by S min ( A, C, b, d ) and and the statement now follows.
(ii) Let x, y ∈ ℝ n such that x ≤ y.Since x ≤ y, we have max ( x ) ≤ max ( y ) () Note that it would be possible to convert equations to inequalities and conversely but this would result in an increase of the number of constraints or variables and thus increasing the computational complexity.The method we present here does not require any new constraint or variable.
We denote by A variable x j will be called active if x j = f ( x ) , for some j ∈ N .Also, a variable will be called active on the constraint equation if the value ( A ⊗ x ) i is attained at the term x j respectively.It ONEMLP-EI(Max-linear program with one-sided equations and inequalities) • Set x j small enough (so that it is not active on any equation or inequality) for every • Go to 3 Theorem 8 The algorithm ONEMLP-EI is correct and its computational complexity is The correctness follows from Theorem ▭ and the computational complexity is computed as follows.In

A special case of max-linear program with two-sided constraints
Suppose c = (c 1 , c 2 , ..., c m ) T , d = (d 1 , d 2 , ..., d m ) T ∈ ℝ m , A = (a ij ) and B = (b ij ) ∈ ℝ m×n are given matrices and vectors.The system is called non-homogeneous two-sided max-linear system and the set of solutions of this system will be denoted by S. Two-sided max-linear systems have been studied in [20], [21], [22] and [23].
Optimization problems whose objective function is max-linear and constraint (▭) are called max-linear programs (MLP).Max-linear programs are studied in [24] and solution methods for both minimization and maximization problems were developed.The methods are proved to be pseudopolynomial if all entries are integer.Also non-linear programs with max-linear constraints were dealt with in [25], where heuristic methods were develeoped and tested for a number of instances.
Consider max-linear programs with two-sided constraints (minimization), ML P min are given matrices and vectors.We introduce the following: diag ( f ) means a diagonal matrix whose diagonal elements are f 1 , f 2 , ..., f n and off diagonal elements are -∞.It therefore follows from (▭) that Linear Algebra Hence, by substituting (▭) and (▭) into (▭) we have 0 T ⊗ y min subjectto where 0 T is transpose of the zero vector, Therefore we assume without loss of generality that f = 0 and hence (▭) is equivalent to The set of feasible solutions for (▭) will be denoted by S and the set of optimal solutions by S min .A vector is called constant if all its components are equal.That is a vector x ∈ ℝ n is constant if x 1 = x 2 = ⋯ = x n .For any x ∈ S we define the set We introduce the following notation of matrices.Let A = (a ij ) ∈ R m×n , 1 ≤ i 1 < i 2 < ⋯ < i q ≤ m and 1 ≤ j 1 < j 2 < ⋯ < j r ≤ n.Then, where, Q = {i 1 , ⋯ , i q }, R = { j 1 , ⋯ , j r }.Similar notation is used for vectors Given ML P min with c ≥ d , we define the following sets We also define the following matrices: A Linear System of Both Equations and Inequalities in Max-Algebra http://dx.doi.org/10.5772/48195

Some solvability concepts of a linear system containing of both equations and inequalities
System of max-separable linear equations and inequalities arise frequently in several branches of Applied Mathematics: for instance in the description of discrete-event dynamic system [4], [1] and machine scheduling [10].However, choosing unsuitable values for the matrix entries and right-handside vectors may lead to unsolvable systems.Therefore, methods for restoring solvability suggested in the literature could be employed.These methods include modifying the input data [11], [26] or dropping some equations [11].Another possibility is to replace each entry by an interval of possible values.In doing so, our question will be shifted to asking about weak solvability, strong solvability and control solvability.
Interval mathematics was championed by Moore [27] as a tool for bounding errors in computer programs.The area has now been developed in to a general methodology for investigating numerical uncertainty in several problems.System of interval equations and inequalities in max-algebra have each been studied in the literature.In [26] weak and strong solvability of interval equations were discussed, control sovability, weak control solvability and universal solvability have been dealt with in [28].In [29] a system of linear inequality with interval coefficients was discussed.In this section we consider a system consisting of interval linear equations and inequalities and present solvability concepts for such system.
An algebraic structure ( B, ⊕ , ⊗ ) with two binary operations ⊕ and ⊗ is called max-plus algebra if for any a, b ∈ ℝ.
Let m, n, r be given positive integers and a ∈ ℝ, we use throughout the paper the notation M = { 1, 2, ..., m } , N = { 1, 2, ..., n } , R = { 1, 2, ..., r } and a -1 = -a.The set of all m × n, r × n matrices over B is denoted by B ( m, n ) and B ( r, n ) respectively.The set of all n-dimensional vectors is denoted by B ( n ) .Then for each matrix A ∈ B ( n, m ) and vector x ∈ B ( n ) the product A ⊗ x is define as represents an interval system of linear max-separable equations of the form represents an interval system of linear max-separable inequalities of the form Interval system of linear max-separable equations and inequalities have each been studied in the literature, for more information the reader is reffered to .The following notation represents an interval system of linear max-separable equations and inequalities of the form where A ∈ , C ∈ , b ∈ and d ∈ .
The aim of this section is to consider a system consisting of max-separable linear equations and inequalities and presents some solvability conditions of such system.Note that it is possible to convert equations to inequalities and conversely, but this would result in an increase in the number of equations and inequalities or an increase in the number of unknowns thus increasing the computational complexity when testing the solvability conditions.Each system of the form (▭) is said to be a subsystem of (▭).

Definition 1 Definition 2
The max-plus semiring ℝ ¯ is the set ℝ ∪ { -∞ } , equipped with the addition ( a, b ) ↦ max ( a, b ) and multiplication ( a, b ) ↦ a + b denoted by ⊕ and ⊗ respectively.That is a ⊕ b = max ( a, b ) and a ⊗ b = a + b.The identity element for the addition (or zero) is -∞, and the identity element for the multiplication (or unit) is 0. The min-plus semiring ℝ min is the set ℝ ∪ { + ∞ } , equipped with the addition ( a, b ) ↦ min ( a, b ) and multiplication ( a, b ) ↦ a + b denoted by ⊕ ' and ⊗ ' respectively.The zero is +∞, and the unit is 0. The name tropical semiring is also used as a synonym of minplus when the ground set is ℕ.The completed max-plus semiring ℝ ¯max is the set ℝ ∪ { ± ∞ } , equipped with the addition ( a, b ) ↦ max ( a, b ) and multiplication ( a, b ) ↦ a + b, with the convention that - ¯m×n be doubly ℝ -astic and b ∈ ℝ m .The system A ⊗ x = b has a solution if and only if x ¯(A, b ) is a solution.Follows from Theorem ▭.Since x ¯(A, b ) has played an important role in the solution of A ⊗ x = b.This vector x ¯ is called the principal solution to A ⊗ x = b [1] C, b, d ) , therefore x ∈ S ( A, b ) and x ∈ S ( C, d , ≤ ) .Since x ∈ S ( C, d, ≤ ) , it follows from Theorem ▭ that x ≤ x ¯(C, d ) .Now that x ∈ S ( A, b ) and also x ∈ S ( C, d, ≤ ) , we need to show that x ¯j( C, d ) ≥ x ¯j( A, b ) for all j ∈ N x (that is N x ⊆ J ).Let j ∈ N x then x j = x ¯j( A, b ) .Since x ∈ S ( C, d , ≤ ) we have x ≤ x ¯(C, d ) and therefore x ¯j( A, b ) ≤ x ¯j( C, d ) thus j ∈ J .Hence, N x ⊆ J and by Theorem ▭ ⋃ j∈J K j = K .This also proves we have x ∈ S ( A, b ) and thus S ( A, b ) ≠ ∅.For contradiction, suppose | S ( A, b ) | > 1.We need to check the following two cases: (i) L ≠ ∅ and (ii) L = ∅ where L = N ∖ J , and show in each case that | S ( A, C, b, d ) | > 1.
follows from Theorem ▭ and Lemma ▭ that x ^(A, C, b, d ) ∈ S max ( A, C, b, d ) .We now present a polynomial algorithm which finds x ∈ S min ( A, C, b, d ) or recognizes that S min ( A, B, c, d ) = ∅.Due to Theorem ▭ either x ^(A, C, b, d ) ∈ S ( A, C, b, d ) or S ( A, C, b, d ) = ∅.Therefore, we assume in the following algorithm that S ( A, C, b, d ) ≠ ∅ and also S min ( A, C, b, d ) ≠ ∅.
Step 1 x ¯(A, b ) is O ( kn ) , while x ¯(C, d ) , x ^(A, C, b, d ) and K j can be determined in O ( rn ) , O ( k + r ) n and O ( kn ) respectively.The loop 3-7 can be repeated at most n -1 times, since the number of elements in J is at most n and in Step 4 at least one element will be removed at a time.Step 3 is O ( n ) , Step 6 is O ( kn ) and Step 7 is O ( n ) .Hence loop 3-7 is O ( k n 2 ) .

7 . 1 .Definition 9
An interval system (▭) has constant matrices if A ¯= A ¯ and C ¯= C ¯. Similarly, an interval system has constant right hand side if b ¯= b ¯ and d ¯= d ¯.In what follows we will consider A ∈ ℝ ( k , n ) and C ∈ ℝ ( r, n ) .Weak solvability Definition 8 A vector y is a weak solution to an interval system (▭) if there exists A ∈ , C ∈ , b ∈ and d ∈ such that A ⊗ y = b C ⊗ y ≤ d (id77) Theorem 10 A vector x ∈ ℝ n is a weak solution of (▭) if and only if ≥ b ¯()Let i = { 1, ..., m } be an arbitrary chosen index and x = (x 1 , x 2 , ...,x n ) T ∈ ℝ n fixed.If A ∈ then ( A ⊗ x ) i is isotone and we have ( A ⊗ x ) i ∈ ( A ¯⊗ x ) i , ( A ¯⊗ x ) i ⊆ ℝ ()Hence, x is a weak solution if and only if( A ¯⊗ x ) i , ( A ¯⊗ x ) i ∩ b ¯i, b ¯i (id79) Similarly, if C ¯⊗ x ≤ d ¯ then x is obviously a weak solution to A ¯⊗ x ≤ b C ¯⊗ x ≤ d ¯from (▭)x is a weak solution if and only if( A ¯⊗ x ) i , ( A ¯⊗ x ) i ∩ b ¯i, b ¯i ≠ ∅, ∀ i = 1, 2, ..., m An interval system (▭) is weakly solvable if there exists A ∈ , C ∈ , b ∈ and d ∈ such that (▭) is solvable.Theorem 11 An interval system (▭) with constant matrixA = A ¯= A ¯, C = C ¯= C ¯is weakly solvable if and only if A Linear System of Both Equations and Inequalities in Max-Algebra http://dx.doi.org/10.5772/48195A⊗ x ¯(A b C d ¯) ≥ b ¯()The (if) part follows from the definition.Conversely, LetA ⊗ x ¯(A b C d ) = b () be solvable subsystem for b ∈ b ¯i, b ¯i .Then we have A ⊗ x ¯(A b C d ¯) ≥ A ⊗ x ¯(A b C d ) = b ≥ b ¯()7.2.Strong solvabilityDefinition 10 A vector x is a strong solution to an interval system (▭) if for each A ∈ , C ∈ and each b ∈ , d ∈ there is an x ∈ ℝ such that (▭) holds.Theorem 12 a vector x is a strong solution to (▭) if and only if it is a solution toE ⊗ x = f C ¯⊗ x ≤ d ¯()whereE = ( A Ā ¯), f = ( b b ¯) (id86)If x is a strong solution of (▭), it obviously satisfies (▭).Conversely, suppose x satisfies (▭)and let A ˜∈ , C ˜∈ , b ˜∈ , d ˜∈ such that A ˜⊗ x ≠ b ˜ and C ˜⊗ x > d ˜.Then ∃ i ∈ ( 1,2, ..., m ) such that either ( A ˜⊗ x ) i < b ˜i or ( A ˜⊗ x ) i > b ˜i and ( C ˜⊗ x ) i > d ˜i.Therefore, ( A ¯⊗ x ) i < ( A ˜⊗ x ) i < b i , ( A ¯⊗ x ) i ≥ ( A ˜⊗ x ) i > b i and ( C ¯⊗ x ) i > ( C ˜⊗ x ) i > d i and the theorem statement follows.
Similarly, for a given matrix interval = A ¯, A ¯ with C ¯, C ¯∈ B ( r, n ) , C ¯≤ C ¯ and given vector interval