Formulation of multiple-choice situations in linear programming models using binary coding matrices (Q1058985)

In order to reduce the number of binary variables in a mixed integer LP model, the principle of binary coding is employed for the formulation of various multiple-choice situations. On the basis of a given coding matrix it is possible to find powerful constraints which define the binary coding procedure within an LP model. This procedure may be employed if the LP code available has not the potential to handle special ordered sets of type 1 algorithmically.