Step 1: Definition of an identity matrix.
An identity matrix \( A = [a_{ij}] \) is a square matrix in which all the diagonal elements are \( 1 \), and all off-diagonal elements are \( 0 \). Mathematically:
\[ a_{ij} = \begin{cases} 1, & \text{if } i = j, \\ 0, & \text{if } i \neq j. \end{cases} \]
Step 2: Analyze each option.
(A) \( a_{ij} = 0 \) if \( i = j \) and \( a_{ij} = 1 \) if \( i \neq j \): This is incorrect because it contradicts the definition of an identity matrix.
(B) \( a_{ij} = 1, \forall i, j \): This is incorrect because an identity matrix has \( 0 \) for all off-diagonal elements.
(C) \( a_{ij} = 0, \forall i, j \): This is incorrect because it implies all elements are \( 0 \), which is not an identity matrix.
(D) \( a_{ij} = 0 \) if \( i \neq j \) and \( a_{ij} = 1 \) if \( i = j \): This is correct, as it matches the definition of an identity matrix.
Final Answer: \( \boxed{(D)} \)
Let $ A = \begin{bmatrix} 2 & 2 + p & 2 + p + q \\4 & 6 + 2p & 8 + 3p + 2q \\6 & 12 + 3p & 20 + 6p + 3q \end{bmatrix} $ If $ \text{det}(\text{adj}(\text{adj}(3A))) = 2^m \cdot 3^n, \, m, n \in \mathbb{N}, $ then $ m + n $ is equal to:
Consider the balanced transportation problem with three sources \( S_1, S_2, S_3 \), and four destinations \( D_1, D_2, D_3, D_4 \), for minimizing the total transportation cost whose cost matrix is as follows:
where \( \alpha, \lambda>0 \). If the associated cost to the starting basic feasible solution obtained by using the North-West corner rule is 290, then which of the following is/are correct?