Match the ancient Rigvedic names of the Indus tributaries with their modern names: 1. Vitasta - Jhelum 2. Asikni - Chenab 3. Parushni - Ravi 4. Vipasa - Beas Which of the pairs given above are correctly matched?

Options:

• A: All of the above
• B: 1, 2 and 3 only
• C: 2, 3 and 4 only
• D: 1 and 3 only

Related Practice Questions:

• Let $S_1$ and $S_2$ be two disjoint, non-empty convex sets in $\mathbb{R}^n$. Under which of the following conditions is there guaranteed to exist a hyperplane that strictly separates $S_1$ and $S_2$?
• Let the primal linear programming problem be: Maximize $Z = c^T x$ subject to $Ax \le b, x \ge 0$. If this primal problem has an unbounded optimal objective value, then which of the following statements is always true regarding its dual problem?
• Let $S = \{(x, y) \in \mathbb{R}^2 \mid x^2 + y^2 \le 9\}$ be a convex set in $\mathbb{R}^2$. The set of all extreme points of $S$ is given by:
• In a linear programming problem with $3$ independent equality constraints and $5$ variables (including slack/surplus variables), what is the maximum possible number of basic solutions?