Question:

Minimise Z=sumᵢ=1ⁿsumj=1ᵐ cᵢjxᵢj Subject to sumᵢ=1ⁿ xᵢj=bj, j=1,2,…,m sumj=1ᵐ xᵢj=bᵢ, i=1,2,…,n is a LPP with number of constraints

Show Hint

In transportation-type LPPs, constraints come from both rows and columns.
Updated On: Mar 20, 2026
  • \(m-n\)
  • \(mn\)
  • \(m+n\)
  • (m)/(n)
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is C

Solution and Explanation

There are m column constraints and n row constraints. Hence, total number of constraints =m+n.
Was this answer helpful?
0
0

Top Questions on Linear Programming Problem

View More Questions