Igor LitvinchevYasmin Agueda Rios-SolisDeniz ÖzdemirLeonardo Gabriel Hernández-Landa2025-10-06201410642307, 155565300002-338810.1134/S1064230714020129https://www.scopus.com/inward/record.uri?eid=2-s2.0-84899530985&doi=10.1134%2FS1064230714020129&partnerID=40&md5=1d8f955d9b9f1c86e9dec470ec8b9bffhttps://gcris.yasar.edu.tr/handle/123456789/10045Reverse logistics network design problem we focus on is about locating distribution centers inspection centers and remanufacturing facilities and determining the acquisition price as well as the amount of returned goods to be collected depending on the unit cost savings and competitor's acquisition price. We introduce the multiple periods setting and stochastic demand formulated by scenarios. We develop two mathematical programming models to determine the pricing strategy of the recovered products together with the optimal network that must be designed to be the most profitable closed cycle. Our methodology is based on a Golden Section Search with some flexibility that enables us to fix the used product acquisition price and then solve the model as an integer linear programming. Moreover we establish dependent size fixed costs of opening a distribution an inspection and a remanufacturing centers and show that they have a strong impact on the Golden Section search behavior. © 2014 Pleiades Publishing Ltd. © 2014 Elsevier B.V. All rights reserved.EnglishGold, Integer Programming, Logistics, Mergers And Acquisitions, Supply Chains, Acquisition Price, Closed-loop Supply Chain, Distribution Centers, Golden Section Search, Integer Linear Programming, Mathematical Programming Models, Reverse Logistics Network Design, Stochastic Formulation, CostsGold, Integer programming, Logistics, Mergers and acquisitions, Supply chains, Acquisition price, Closed-loop supply chain, Distribution centers, Golden section search, Integer Linear Programming, Mathematical programming models, Reverse logistics network design, Stochastic formulation, CostsArticle