Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/107820
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studies-
dc.creatorHu, Hen_US
dc.creatorGuo, Sen_US
dc.creatorZhen, Len_US
dc.creatorWang, Sen_US
dc.creatorBian, Yen_US
dc.date.accessioned2024-07-12T06:07:02Z-
dc.date.available2024-07-12T06:07:02Z-
dc.identifier.issn0957-4174en_US
dc.identifier.urihttp://hdl.handle.net/10397/107820-
dc.language.isoenen_US
dc.publisherElsevier Ltden_US
dc.subjectIncremental quantity discounten_US
dc.subjectOuter-approximationen_US
dc.subjectPrice-sensitive demanden_US
dc.subjectSecond-order cone programmingen_US
dc.subjectSupply chain network designen_US
dc.titleA multi-product and multi-period supply chain network design problem with price-sensitive demand and incremental quantity discounten_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.volume238en_US
dc.identifier.issueEen_US
dc.identifier.doi10.1016/j.eswa.2023.122005en_US
dcterms.abstractDemand is an important factor in supply chain network design (SCND). Among the many factors that affect demand, the impact of price cannot be underestimated. This study, for the first time, provides enterprises with direct multi-period pricing and demand decision solutions in SCND by simultaneously considering the impact of price-sensitive demand and incremental quantity discounts on the network. In this way, a mixed-integer nonlinear programming model is established based on the relationships between price and demand functions to maximize the overall profit of the supply chain. Due to the nonlinear characteristics of the model, this study proves the existence of the optimal solution of the problem and the feasibility of implementing the following two algorithms by analyzing the nature of the problem. The first algorithm is based on the second-order cone programming (SOCP) method, and the second algorithm is based on the outer-approximation method. The results of numerical experiments at different scales show that the SOCP method can obtain the optimal solution for small and medium-scale experiments. In contrast, the outer-approximation method can find approximate optimal solutions within a reasonable time for large-scale experiments. The results confirm that considering incremental quantity discount can significantly enhance the profitability of supply chain networks in long-term planning. Finally, some future research directions in the field of SCND are discussed.-
dcterms.accessRightsembargoed accessen_US
dcterms.bibliographicCitationExpert systems with applications, 15 Mar. 2024, v. 238, no. E, 122005en_US
dcterms.isPartOfExpert systems with applicationsen_US
dcterms.issued2024-03-15-
dc.identifier.scopus2-s2.0-85175200870-
dc.identifier.eissn1873-6793en_US
dc.identifier.artn122005en_US
dc.description.validate202407 bcch-
dc.identifier.FolderNumbera2987b-
dc.identifier.SubFormID49074-
dc.description.fundingSourceSelf-fundeden_US
dc.description.pubStatusPublisheden_US
dc.date.embargo2026-03-15en_US
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Open Access Information
Status embargoed access
Embargo End Date 2026-03-15
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

63
Citations as of Nov 10, 2025

SCOPUSTM   
Citations

15
Citations as of Dec 19, 2025

WEB OF SCIENCETM
Citations

14
Citations as of Dec 18, 2025

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.