1
vote
Accepted
Mutually exclusive non-zero variables in Linear Programming, without using binary variables or objective function
The disjunction $a = 0 \lor b = 0$ is nonconvex, so you cannot enforce it with linear constraints.
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
linear-programming × 5124optimization × 2034
linear-algebra × 942
convex-optimization × 642
integer-programming × 449
operations-research × 340
duality-theorems × 260
simplex × 255
mixed-integer-programming × 211
convex-analysis × 200
nonlinear-optimization × 177
polyhedra × 147
matrices × 142
constraints × 139
simplex-method × 134
algorithms × 133
discrete-optimization × 126
graph-theory × 122
inequality × 119
combinatorics × 102
mathematical-modeling × 95
polytopes × 92
systems-of-equations × 82
binary-programming × 82
geometry × 81