MCQ
Minimise $\text{Z}=\sum\limits^{\text{n}}_{\text{j}=1}\sum\limits^{\text{m}}_{\text{i}=1}\text{c}_{\text{ij}}\cdot\text{x}_{\text{ij}}$ Subject to $\sum\limits^{\text{m}}_{\text{i}=1}\text{x}_{\text{ji}}=\text{b}_{\text{j}},\text{j}=1,2,....\text{n}$ $\sum\limits^{\text{n}}_{\text{j}=1}\text{x}_{\text{ji}}=\text{b}_{\text{j}},\text{j}=1,2,.....,\text{m}$ is a $\text{LPP}$ with number of constraints.
- A$\text{m}-\text{n}$
- B$\text{m}\text{n}$
- ✓$\text{m}+\text{n}$
- D$\frac{\text{m}}{\text{n}}$