Let $a_{1}, a_{2}, \cdots, a_{k}$ be relatively prime positive integers. Determine the largest integer which cannot be expressed in the form \[x_{1}a_{2}a_{3}\cdots a_{k}+x_{2}a_{1}a_{3}\cdots a_{k}+\cdots+x_{k}a_{1}a_{2}\cdots a_{k-1}\] for some nonnegative integers $x_{1}, x_{2}, \cdots, x_{k}$.
To determine the largest integer which cannot be expressed in the form 
\[ x_{1}a_{2}a_{3}\cdots a_{k} + x_{2}a_{1}a_{3}\cdots a_{k} + \cdots + x_{k}a_{1}a_{2}\cdots a_{k} \]
for some nonnegative integers \( x_{1}, x_{2}, \cdots, x_{k} \), we can use the concept of the Frobenius number in the context of the given problem.

1. **Understanding the Problem:**
   The given problem involves finding the largest integer that cannot be expressed as a linear combination of the products of \( k-1 \) of the \( k \) relatively prime integers \( a_1, a_2, \ldots, a_k \) with nonnegative coefficients.

2. **General Formulation:**
   Let \( A_i = \prod_{j \neq i} a_j \) for \( i = 1, 2, \ldots, k \). The problem reduces to finding the largest integer that cannot be expressed as:
   \[ x_1 A_1 + x_2 A_2 + \cdots + x_k A_k \]
   where \( x_i \geq 0 \) for all \( i \).

3. **Using the Frobenius Number:**
   The Frobenius number \( g(a_1, a_2, \ldots, a_k) \) for \( k \) numbers is the largest integer that cannot be expressed as a nonnegative integer combination of \( a_1, a_2, \ldots, a_k \). For \( k \geq 3 \), there is no general formula for the Frobenius number, but for \( k = 2 \), the Frobenius number \( g(a, b) \) is given by:
   \[ g(a, b) = ab - a - b \]
   when \( a \) and \( b \) are coprime.

4. **Applying the Concept:**
   In our case, since \( a_1, a_2, \ldots, a_k \) are relatively prime, the largest integer that cannot be expressed as a nonnegative integer combination of \( A_1, A_2, \ldots, A_k \) is given by:
   \[ g(A_1, A_2, \ldots, A_k) = (k-1) \prod_{i=1}^k a_i - \sum_{i=1}^k A_i \]

5. **Simplifying the Expression:**
   Since \( A_i = \prod_{j \neq i} a_j \), we have:
   \[ \sum_{i=1}^k A_i = \sum_{i=1}^k \prod_{j \neq i} a_j \]
   This sum is equal to the sum of all products of \( k-1 \) of the \( k \) numbers.

6. **Conclusion:**
   The largest integer that cannot be expressed in the given form is:
   \[ (k-1) \prod_{i=1}^k a_i - \sum_{i=1}^k \prod_{j \neq i} a_j \]

The final answer is \( \boxed{ (k-1) \prod_{i=1}^k a_i - \sum_{i=1}^k \prod_{j \neq i} a_j } \)