Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Consider the following system of linear equations over $x_{ij}$ for $1\leq i\leq m$ and $1\leq j\leq n$:

$\sum_{j}x_{ij}=a_i$ for $i=1, \cdots, m$ and $\sum_{i}x_{ij}=b_j$ for $j=1, \cdots, n$ where each $a_i$ or $b_j$ is positive and $\sum_i a_i= \sum_j b_j$.

Is it the case that there always exists a positive solution, namely, for each $i,j$, $x_{ij}>0$. If this is true, is there any simple proof?

share|cite|improve this question
up vote 3 down vote accepted

Denote $S=\sum_{i=1}^m a_i=\sum_{j=1}^n b_j$. Then $x_{ij}=\frac{a_ib_j}{S}$ is a positive solution.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.