周期随机规划的对偶界

Oper. Res. Pub Date : 2022-01-14 DOI:10.1287/opre.2021.2245
A. Shapiro, Yi Cheng
{"title":"周期随机规划的对偶界","authors":"A. Shapiro, Yi Cheng","doi":"10.1287/opre.2021.2245","DOIUrl":null,"url":null,"abstract":"A construction of the dual of a periodical formulation of infinite-horizon linear stochastic programs with a discount factor is discussed. The dual problem is used for computing a deterministic upper bound for the optimal value of the considered multistage stochastic program. Numerical experiments demonstrate behavior of that upper bound, especially when the discount factor is close to one.","PeriodicalId":19546,"journal":{"name":"Oper. Res.","volume":"49 1","pages":"120-128"},"PeriodicalIF":0.0000,"publicationDate":"2022-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Dual Bounds for Periodical Stochastic Programs\",\"authors\":\"A. Shapiro, Yi Cheng\",\"doi\":\"10.1287/opre.2021.2245\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A construction of the dual of a periodical formulation of infinite-horizon linear stochastic programs with a discount factor is discussed. The dual problem is used for computing a deterministic upper bound for the optimal value of the considered multistage stochastic program. Numerical experiments demonstrate behavior of that upper bound, especially when the discount factor is close to one.\",\"PeriodicalId\":19546,\"journal\":{\"name\":\"Oper. Res.\",\"volume\":\"49 1\",\"pages\":\"120-128\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-01-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Oper. Res.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1287/opre.2021.2245\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Oper. Res.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/opre.2021.2245","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

讨论了带折现因子的无限视界线性随机规划周期公式的对偶构造。对偶问题用于计算所考虑的多阶段随机规划的最优值的确定性上界。数值实验证明了该上界的行为,特别是当折现因子接近于1时。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Dual Bounds for Periodical Stochastic Programs
A construction of the dual of a periodical formulation of infinite-horizon linear stochastic programs with a discount factor is discussed. The dual problem is used for computing a deterministic upper bound for the optimal value of the considered multistage stochastic program. Numerical experiments demonstrate behavior of that upper bound, especially when the discount factor is close to one.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A web-based multi-criteria decision support system for benchmarking marketing decisions alternatives Integrated optimization of wagon flow routing and train formation plan Two-machine decentralized flow shop scheduling problem with inter-factory batch delivery system A simplified swarm optimization algorithm to minimize makespan on non-identical parallel machines with unequal job release times under non-renewable resource constraints Meta-frontier: literature review and toolkit
×
引用
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