Multi-sourcing under supply uncertainty and Buyer's risk aversion

IF 2.6 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE EURO Journal on Computational Optimization Pub Date : 2021-01-01 DOI:10.1016/j.ejco.2021.100009
Prashant Chintapalli
{"title":"Multi-sourcing under supply uncertainty and Buyer's risk aversion","authors":"Prashant Chintapalli","doi":"10.1016/j.ejco.2021.100009","DOIUrl":null,"url":null,"abstract":"<div><p>We address the combined problem of supplier (or vendor) selection and ordering decision when a buyer can choose to procure from multiple suppliers whose yields are uncertain and potentially correlated. We model this problem as a stochastic program with recourse in which the buyer purchases from the suppliers in the first period and, if needed, chooses to purchase from the spot market or from the suppliers with excess supply, whichever is beneficial, in the second period in order to meet the target procurement quantity. We solve the above problem using <em>sample average approximation</em> (SAA) technique that enables us to solve the problem easily in practice. We compare the performance of our solution with the certainty equivalent problem, which is practiced widely and which we use as the benchmark, to evaluate the efficacy of our approach. Next, we extend our model to incorporate buyer’s risk aversion with respect to the quantity procured. We reformulate the multi-sourcing problem as a mixed integer linear program (MILP) and adopt a statistical approach to account for buyer’s risk aversion. Thus, we design a simple computational technique that provides an optimal sourcing policy from a set of suppliers when each supplier’s yield is uncertain with a generic probability distribution.</p></div>","PeriodicalId":51880,"journal":{"name":"EURO Journal on Computational Optimization","volume":"9 ","pages":"Article 100009"},"PeriodicalIF":2.6000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.ejco.2021.100009","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"EURO Journal on Computational Optimization","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2192440621001362","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 1

Abstract

We address the combined problem of supplier (or vendor) selection and ordering decision when a buyer can choose to procure from multiple suppliers whose yields are uncertain and potentially correlated. We model this problem as a stochastic program with recourse in which the buyer purchases from the suppliers in the first period and, if needed, chooses to purchase from the spot market or from the suppliers with excess supply, whichever is beneficial, in the second period in order to meet the target procurement quantity. We solve the above problem using sample average approximation (SAA) technique that enables us to solve the problem easily in practice. We compare the performance of our solution with the certainty equivalent problem, which is practiced widely and which we use as the benchmark, to evaluate the efficacy of our approach. Next, we extend our model to incorporate buyer’s risk aversion with respect to the quantity procured. We reformulate the multi-sourcing problem as a mixed integer linear program (MILP) and adopt a statistical approach to account for buyer’s risk aversion. Thus, we design a simple computational technique that provides an optimal sourcing policy from a set of suppliers when each supplier’s yield is uncertain with a generic probability distribution.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
供给不确定性和买方风险规避下的多源采购
当买方可以选择从多个产量不确定且潜在相关的供应商处采购时,我们解决了供应商(或卖主)选择和订购决策的组合问题。我们将这一问题建模为一个有追索权的随机计划,在该计划中,买方在第一期向供应商采购,如果需要,在第二期选择从现货市场或从供应过剩的供应商处购买,以满足目标采购数量。我们使用样本平均近似(SAA)技术来解决上述问题,使我们在实践中更容易地解决问题。我们比较了我们的解决方案的性能与确定性等效问题,这是广泛实践和我们使用的基准,以评估我们的方法的有效性。接下来,我们扩展我们的模型,以纳入买方的风险厌恶相对于采购数量。我们将多源问题重新表述为一个混合整数线性规划(MILP),并采用统计方法来考虑买方的风险规避。因此,我们设计了一种简单的计算技术,当每个供应商的产量具有一般概率分布不确定时,它提供了一组供应商的最优采购策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
EURO Journal on Computational Optimization
EURO Journal on Computational Optimization OPERATIONS RESEARCH & MANAGEMENT SCIENCE-
CiteScore
3.50
自引率
0.00%
发文量
28
审稿时长
60 days
期刊介绍: The aim of this journal is to contribute to the many areas in which Operations Research and Computer Science are tightly connected with each other. More precisely, the common element in all contributions to this journal is the use of computers for the solution of optimization problems. Both methodological contributions and innovative applications are considered, but validation through convincing computational experiments is desirable. The journal publishes three types of articles (i) research articles, (ii) tutorials, and (iii) surveys. A research article presents original methodological contributions. A tutorial provides an introduction to an advanced topic designed to ease the use of the relevant methodology. A survey provides a wide overview of a given subject by summarizing and organizing research results.
期刊最新文献
Unboxing Tree ensembles for interpretability: A hierarchical visualization tool and a multivariate optimal re-built tree An effective hybrid decomposition approach to solve the network-constrained stochastic unit commitment problem in large-scale power systems Advances in nonlinear optimization and equilibrium problems – Special issue editorial The Marguerite Frank Award for the best EJCO paper 2023 A variable metric proximal stochastic gradient method: An application to classification problems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1