Problem

Source: China TST 2023 Problem 18

Tags: matrix, combinatorics, square grid



Find the greatest constant $\lambda$ such that for any doubly stochastic matrix of order 100, we can pick $150$ entries such that if the other $9850$ entries were replaced by $0$, the sum of entries in each row and each column is at least $\lambda$. Note: A doubly stochastic matrix of order $n$ is a $n\times n$ matrix, all entries are nonnegative reals, and the sum of entries in each row and column is equal to 1.