A Novel Algorithm to Compute All Vertex- Matrices of an Interval Matrix: A Computational Approach
Mohammed T. Hussein · 2004
In this paper an algorithm was developed and implemented to obtain all possible vertex matrices for nxn interval matrix. Given a matrix ARnxn with entries aij �(aijL , aijH) � R for i.j=1,…,n. The uncertain parameters generate an infinite family of nxn matrices. From the above matrix let's generate all of the vertex matrices, by allowing each uncertain entry of A to vary over the entire interval. The problem treated in this research is of considerable practical significance. Illustrative examples are given to validate the proposed method