Formulation of multiple-choice situations in linear programming models using binary coding matrices (Q1058985)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Formulation of multiple-choice situations in linear programming models using binary coding matrices |
scientific article; zbMATH DE number 3902399
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Formulation of multiple-choice situations in linear programming models using binary coding matrices |
scientific article; zbMATH DE number 3902399 |
Statements
Formulation of multiple-choice situations in linear programming models using binary coding matrices (English)
0 references
1985
0 references
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.
0 references
combinatorial analysis
0 references
binary coding
0 references
multiple-choice situations
0 references
0.8490233
0 references
0.8417938
0 references
0.83859146
0 references
0.83731294
0 references
0.8335775
0 references
