{"title":"Approximation Methods for a Nonlinear Competitive Facility Cost Optimization Problem","authors":"Ngan Ha Duong, Thuy Anh Ta","doi":"10.1109/KSE56063.2022.9953774","DOIUrl":null,"url":null,"abstract":"In this paper, we study a facility cost optimization problem in a competitive market. Our objective is to distribute an available budget to some newly opened facilities to maximize an expected captured customer demand, assuming that customers will select a facility to visit according to a random utility maximization model. In this work, given the fact that the objective function of this problem is highly non-convex and challenging to solve exactly, we propose a technique to approximate the objective function by piece-wise linear functions, making it possible to reformulate the problem as a mixed-integer linear or conic program, which can further be solved by a commercial solver such as CPLEX. We also explore an outer-approximation algorithm to solve the approximate problem. Computational results are provided to demonstrate the performances of our approaches.","PeriodicalId":330865,"journal":{"name":"2022 14th International Conference on Knowledge and Systems Engineering (KSE)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 14th International Conference on Knowledge and Systems Engineering (KSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KSE56063.2022.9953774","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
In this paper, we study a facility cost optimization problem in a competitive market. Our objective is to distribute an available budget to some newly opened facilities to maximize an expected captured customer demand, assuming that customers will select a facility to visit according to a random utility maximization model. In this work, given the fact that the objective function of this problem is highly non-convex and challenging to solve exactly, we propose a technique to approximate the objective function by piece-wise linear functions, making it possible to reformulate the problem as a mixed-integer linear or conic program, which can further be solved by a commercial solver such as CPLEX. We also explore an outer-approximation algorithm to solve the approximate problem. Computational results are provided to demonstrate the performances of our approaches.