Disjunctive inequalities

From optimization
Revision as of 15:28, 28 May 2015 by Cbilodeau (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Introduction A disjunctive inequality is a type of constraint that occurs in mixed integer linear programming (MILP). It involves constraining a solution space with multiple inequalities or sets of inequalities related by an OR statement. For example a solution space may be constrained by

Failed to parse(syntax error): ' 'y ' ' 0 &lt ' 'x' '<sub>1</sub> &lt 3