Robust multi-product newsvendor model with uncertain demand and substitution
dc.contributor.author | Zhang, Jie | en |
dc.contributor.author | Xie, Weijun | en |
dc.contributor.author | Sarin, Subhash C. | en |
dc.contributor.department | Industrial and Systems Engineering | en |
dc.date.accessioned | 2021-09-24T23:46:04Z | en |
dc.date.available | 2021-09-24T23:46:04Z | en |
dc.date.issued | 2021-08-16 | en |
dc.date.updated | 2021-09-24T23:46:02Z | en |
dc.description.abstract | This work studies a Robust Multi-product Newsvendor Model with Substitution (R-MNMS), where the demand and the substitution rates are stochastic and are subject to cardinality-constrained uncertainty sets. The goal of this work is to determine the optimal order quantities of multiple products to maximize the worst-case total profit. To achieve this, we first show that for given order quantities, computing the worst-case total profit, in general, is NP-hard. Therefore, we derive the closed-form optimal solutions for the following three special cases: (1) if there are only two products, (2) if there is no substitution among different products, and (3) if the budget of demand uncertainty is equal to the number of products. For a general R-MNMS, we formulate it as a mixed-integer linear program with an exponential number of constraints and develop a branch and cut algorithm to solve it. For large-scale problem instances, we further propose a conservative approximation of R-MNMS and prove that under some certain conditions, this conservative approximation yields an exact optimal solution to R-MNMS. The numerical study demonstrates the effectiveness of the proposed approaches and the robustness of our model. | en |
dc.description.version | Accepted version | en |
dc.format.extent | Pages 190-202 | en |
dc.format.extent | 13 page(s) | en |
dc.format.mimetype | application/pdf | en |
dc.identifier | 1 (Article number) | en |
dc.identifier.doi | https://doi.org/10.1016/j.ejor.2020.12.023 | en |
dc.identifier.eissn | 1872-6860 | en |
dc.identifier.issn | 0377-2217 | en |
dc.identifier.issue | 1 | en |
dc.identifier.orcid | Xie, Weijun [0000-0001-5157-1194] | en |
dc.identifier.uri | http://hdl.handle.net/10919/105059 | en |
dc.identifier.volume | 293 | en |
dc.language.iso | en | en |
dc.publisher | Elsevier | en |
dc.relation.uri | http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000628803700014&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=930d57c9ac61a043676db62af60056c1 | en |
dc.rights | In Copyright | en |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
dc.subject | Social Sciences | en |
dc.subject | Technology | en |
dc.subject | Management | en |
dc.subject | Operations Research & Management Science | en |
dc.subject | Business & Economics | en |
dc.subject | Stochastic programming | en |
dc.subject | Robust | en |
dc.subject | Cardinality-constrained uncertainty set | en |
dc.subject | Mixed-integer program | en |
dc.subject | Branch and cut algorithm | en |
dc.subject | Operations Research | en |
dc.title | Robust multi-product newsvendor model with uncertain demand and substitution | en |
dc.title.serial | European Journal of Operational Research | en |
dc.type | Article - Refereed | en |
dc.type.dcmitype | Text | en |
dc.type.other | Article | en |
dc.type.other | Journal | en |
pubs.organisational-group | /Virginia Tech | en |
pubs.organisational-group | /Virginia Tech/Engineering | en |
pubs.organisational-group | /Virginia Tech/Engineering/Industrial and Systems Engineering | en |
pubs.organisational-group | /Virginia Tech/All T&R Faculty | en |
pubs.organisational-group | /Virginia Tech/Engineering/COE T&R Faculty | en |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- 6891.pdf
- Size:
- 782.14 KB
- Format:
- Adobe Portable Document Format
- Description:
- Accepted version