Matrix assignments and an associated $\min \max$ problem
نویسندگان
چکیده
منابع مشابه
Matrix Assignments and an Associated Min Max Problem
We are concerned with an algorithm for determining p which is more efficient than the obvious one of generating the n\ possible assignments then straightforwardly selecting p. A method for demonstrating an assignment containing p. is also of concern, but such a method is easily evolved using the tools necessary to determine p. Before proceeding we define a nonzero column of a set of r rows of A...
متن کاملMax-min Intuitionistic Fuzzy Matrix of an Intuitionistic Fuzzy Graph
In this paper we introduce the Max-Min intuitionistic fuzzy matrix M (G) of an intuitionistic fuzzy graph. And the extreme energy of M (G) is defined. And also we give the explicit expression for the coefficients of the characteristic polynomial of M (G) . These concepts are illustrated with real time example. AMS Subject Classification: 03E72, 05C50
متن کاملMax-min distance nonnegative matrix factorization
Nonnegative Matrix Factorization (NMF) has been a popular representation method for pattern classification problems. It tries to decompose a nonnegative matrix of data samples as the product of a nonnegative basis matrix and a nonnegative coefficient matrix. The columns of the coefficient matrix can be used as new representations of these data samples. However, traditional NMF methods ignore cl...
متن کاملEigenspace of a circulant max-min matrix
Eigenvectors of a max-min matrix characterize stable states of the corresponding discrete-events system. Investigation of the max-min eigenvectors of a given matrix is therefore of a great practical importance. The eigenproblem in max-min algebra has been studied by many authors. Interesting results were found in describing the structure of the eigenspace, and algorithms for computing the maxim...
متن کاملMin-max and min-max (relative) regret approaches to representatives selection problem
The following optimization problem is studied. There are several sets of integer positive numbers whose values are uncertain. The problem is to select one representative of each set such that the sum of the selected numbers is minimum. The uncertainty is modeled by discrete and interval scenarios, and the min–max and min–max (relative) regret approaches are used for making a selection decision....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1963
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1963-0148567-0