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?
To solve this problem, we need to perform the following steps:
Understanding the Cost Matrix: The problem provides a cost matrix with sources \( S_1, S_2, S_3 \) and destinations \( D_1, D_2, D_3, D_4 \). The costs, supply, and demand are depicted in the table below:
| \( D_1 \) | \( D_2 \) | \( D_3 \) | \( D_4 \) | Supply | |
|---|---|---|---|---|---|
| \( S_1 \) | 2 | 6 | 20 | 11 | \( \alpha + 10 \) |
| \( S_2 \) | 12 | 7 | 4 | 10 | \( \alpha + \lambda + 10 \) |
| \( S_3 \) | 8 | 14 | 16 | 11 | 5 |
| Demand | \( \alpha + 5 \) | 10 | \( \lambda + 5 \) | \( \alpha + \lambda \) |
Using the North-West Corner Rule for Initial Basic Feasible Solution: Here, the North-West corner method is used to find an initial basic feasible solution. The given cost for this solution is 290, which implies:
Evaluating the Given Options: We need to check the validity of each statement based on the implied conditions:
Conclusion: Thus, the correct options based on the information and context given are: