In several optimization problems, we found what we called the balanced constraint(c^T • x = z ) For exp: C^T • 1 = 0 (C is a binary Matrix)
- Can I have an intuitive explanation about the concept and how it is balanced?
In several optimization problems, we found what we called the balanced constraint(c^T • x = z ) For exp: C^T • 1 = 0 (C is a binary Matrix)