Boolean facility location problem with client preferences
Boolean facility location problem with client preferences is considered. Mathematical model of the problem is built. Branchs and bounds method to solve the problem is proposed. The lower bound calculation method as the solution of the linear programming problem with constraints that are based on th...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
State University “Uzhhorod National University”
2018-06-01
|
| Series: | Науковий вісник Ужгородського університету. Серія: Математика і інформатика |
| Online Access: | http://visnyk-math.uzhnu.edu.ua/article/view/157956 |
| Summary: | Boolean facility location problem with client preferences is considered. Mathematical model of the problem is built. Branchs and bounds method to solve the problem is proposed. The lower bound calculation method as the solution of the linear programming problem with constraints that are based on the solution of the ancillary transport problem is proposed. Usage of the algorithm for solution of the model problem of the wholesale pharmacy location problem in ukrainian regions is illustrated. The method is compared to the full-fledged method. On average 96\% of variants are rejected by this method of the problem solution. |
|---|---|
| ISSN: | 2616-7700 |