Показать сокращенную информацию
dc.contributor.author | Shabanova L. | |
dc.contributor.author | Gafurov I. | |
dc.contributor.author | Safiullin N. | |
dc.contributor.author | Salimov L. | |
dc.date.accessioned | 2018-09-18T20:28:32Z | |
dc.date.available | 2018-09-18T20:28:32Z | |
dc.date.issued | 2015 | |
dc.identifier.issn | 1911-2017 | |
dc.identifier.uri | https://dspace.kpfu.ru/xmlui/handle/net/140277 | |
dc.description.abstract | © 2015, Asian Social Science. All rights reserved. The article provides a critical analysis of the existing economic and mathematical models, summarizes the main deficiencies identified by various researchers and authors themselves, which allowed to recommend greater use of methods of linear programming. In a highly competitive consumer market, and most importantly, in the context of the dynamic expansion and deepening of product range, it is impossible to form the optimal assortment plans, focusing only on maximizing profits, it is also necessary to minimize distribution costs. According to the authors duality theory solves both of these problems. An algorithm for creating the optimal assortment plan commercial enterprise, based on the solution of the primal and dual linear programming problem. Given the economic interpretation of the possible reasons for which the task will not have a solution. Existing computer technologies allow to realize the proposed algorithm and provide a high reliability of the results. | |
dc.relation.ispartofseries | Asian Social Science | |
dc.subject | Algorithms | |
dc.subject | Duality theory | |
dc.subject | Economic and mathematical models | |
dc.subject | Methods of linear programming | |
dc.subject | The assortment plan | |
dc.title | Economic-mathematical methods of forming the optimal assortment plan trade enterprises | |
dc.type | Article | |
dc.relation.ispartofseries-issue | 11 | |
dc.relation.ispartofseries-volume | 11 | |
dc.collection | Публикации сотрудников КФУ | |
dc.relation.startpage | 142 | |
dc.source.id | SCOPUS19112017-2015-11-11-SID84929310807 |