Minimise Z= _ j=1 ^ n _ i=1 ^ m c_ i j x_ i j Subject to _ i=1 ^ m x_ i j =b_ j , j=1,2, , n _ j=1 ^ n x_ i j =b_ j , i=1,2, , m is a L P P with number of constr

Step-by-step solution

Constraints will be x ₁₁+ x ₂₁+ .+ x _ ml = b ₁ x ₁₂+ x ₂₂+ x _ m 2 = b ₂ x _ + x _ 2 n + .+ x _ mn = b _ n x ₁₁+ x ₁₂+ + x _ 1 n = b ₁ x ₂₁+ x ₂₂+ + x _ 2 n = b ₂ x _ ml + x _ m 2 + + x _ mn = b _ n So, total number of constraints = m + n