Boolean facility location problem with client preferences

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...

Full description

Bibliographic Details
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
id doaj-dddf06a02eb54872af312cb9add6290b
record_format Article
spelling doaj-dddf06a02eb54872af312cb9add6290b2021-09-02T13:44:13ZengState University “Uzhhorod National University”Науковий вісник Ужгородського університету. Серія: Математика і інформатика2616-77002018-06-0101(32)71410.24144/2616-7700.2018.1(32).7-14157956Boolean 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 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.http://visnyk-math.uzhnu.edu.ua/article/view/157956
collection DOAJ
language English
format Article
sources DOAJ
author Ю. В. Андрашко
В. В. Максим
spellingShingle Ю. В. Андрашко
В. В. Максим
Boolean facility location problem with client preferences
Науковий вісник Ужгородського університету. Серія: Математика і інформатика
author_facet Ю. В. Андрашко
В. В. Максим
author_sort Ю. В. Андрашко
title Boolean facility location problem with client preferences
title_short Boolean facility location problem with client preferences
title_full Boolean facility location problem with client preferences
title_fullStr Boolean facility location problem with client preferences
title_full_unstemmed Boolean facility location problem with client preferences
title_sort boolean facility location problem with client preferences
publisher State University “Uzhhorod National University”
series Науковий вісник Ужгородського університету. Серія: Математика і інформатика
issn 2616-7700
publishDate 2018-06-01
description 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.
url http://visnyk-math.uzhnu.edu.ua/article/view/157956
work_keys_str_mv AT ûvandraško booleanfacilitylocationproblemwithclientpreferences
AT vvmaksim booleanfacilitylocationproblemwithclientpreferences
_version_ 1721174846494212096

Similar Items