Disjunctive inequalities

Introduction

Disjunctive inequalities are a form of disjunctive constraints that can be applied to linear programming. Disjunctive constraints are applied in all disjunctive programming, which just refers to the use of logical constraints, which include the “Or” and “And” statements. In order to solve a disjunctive, the constraints have to be converted into multiple integer programming (MIP) constraints, which is called disjunction. Disjunction involves the implementation of a binary variable to create a new set of constraints that can be solved easily. Two common methods for disjunction are the Big-M Reformulation and the Convex-Hull Reformulation.

Method

General

When given a set of inequalities, such as $f_{1}(x)\ \leq \ 0\ \And \ f_{2}(x)\ \leq \ 0$ , the disjunctive form is given by:  ${\begin{bmatrix}y\\f_{1}(x)\ \leq \ 0\ \end{bmatrix}}$ . The constraints would be created by using sufficiently large numbers, such as M1 and M2, and a binary variable y (y1 & y2):

$f_{1}(x)\ \leq \ M_{1}\ast (1-y_{1})$

$f_{2}(x)\ \leq \ M_{2}\ast (1-y_{2})$

$y_{1}\ +y_{2}\ =\ 1$

$y_{1}\ ,\ y_{2}\epsilon \ {0,1}\ \$

References

Authors: Daniel Ladron, Grant Logan, Matthew Dinh, Derek Moore (CBE/SysEn 6800, Fall 2021)