1Editorial office, Statistics and Mathematics, India
Visit for more related articles at Research & Reviews: Journal of Statistics and Mathematical Sciences
The matrix has been used to solve linear equations for a long time. Until the 1800s, they were referred to as arrays. James Joseph Sylvester coined the term matrix (Latin for "womb," derived from mater - mother) in 1850, understanding a matrix as an object that gives rise to a number of determinants now known as minors, that is, determinants of smaller matrices derived from the original one by removing columns and rows. In 1913, an English mathematician named Cullis was the first to utilize current bracket notation for matrices, as well as the first important usage of the notation A = aij to express a matrix, where aij refers to the component in the I th row and the j th column.
Matrices can also be used to express and work with many system of equations (a system of linear equations) in a compact manner. When it comes to linear transforms, often referred as regular maps, matrices and matrix multiplication show their true colors. A data structure is a data array of numbers, symbols, or expressions that are arranged in rows and columns in rows and columns. Box brackets are widely used to write matrices. Rows and columns refer to the horizontal and vertical lines of entries in a matrix. A matrix's size is determined by the number of rows and columns it contains. M n matrix or m – by–n matrix is a matrix with m rows and n columns, while m and n are the dimensions. Thomason was the first to mention fuzzy matrices when he addressed the convergence of fuzzy matrix powers. Fuzzy matrices are important in scientific research. A fuzzy matrix can be defined as a matrix whose elements have values that fall inside the fuzzy interval. Fuzzy matrices are used to simulate a variety of fuzzy systems, and their products are usually defined by the "max(min)" rule. In the physical, biological, medical, social, and engineering sciences, fuzzy matrices are crucial in the development and analysis of many types of discrete structural models. Because fuzzy matrices do not satisfy many of the essential features of real or complex matrices, they require a fundamentally different treatment than matrices over the real or complex fields.
Transportation problems are a form of linear programming problem that can be found in a wide range of applications. TP is a robust structure that facilitates the effective transportation of raw materials and their timely availability. It is one of the most effective optimization methods for a variety of real-world human activities. It was originally created to determine the best shipment pattern; it is known as the transportation problem. As a result, it is concerned with the transportation of commodities from any of m origins I = 1,2,3,..., m to any of n destinations j = 1,2,3,..., n. The amount xij to be delivered from all the origins I = 1,2,3,..... m to all the destinations j = 1,2,3,..... n must be determined in such a way that the overall cost is minimized. All transportation problems that are characterized by several objective functions and are not single goal are studied here. MOTP is a form of linear programming problem in which all of the objectives are in conflict with each other and the constraints are of the equal type. A vector minimum problem is the multi-objective cost way. Only the targets are fuzzy in the multi-objective fuzzy linear programming technique. For the cross problem, the fuzzy linear programming technique yields an optimal negotiated settlement. The concept and ideas of the "Fuzzy Incident Matrix" are defined in this thesis, and utilizing the definition theorems are proved from the adjacency matrix. Matrix properties such as commutative in addition and multiplication, associative in addition and multiplication, absorption, and distributive are also calculated and proven using nilpotent matrices. created a method for determining the answer to a multi-objective transportation problem for a linear multi-objective transportation problem, method for discovering all non-dominated solutions.
Some attributes are computed for a linked graph, whereas others are computed for a complete graph. It can be shown for certain types of matrices, as well as for connected or complete graphs.