利用最大加区间线性方程的l -定域解的可接受产品定价问题

Worrawate Leela-apiradee, P. Thipwiwatpotjana
{"title":"利用最大加区间线性方程的l -定域解的可接受产品定价问题","authors":"Worrawate Leela-apiradee, P. Thipwiwatpotjana","doi":"10.1109/NAFIPS.2016.7851577","DOIUrl":null,"url":null,"abstract":"Product pricing is one of the most important strategies in doing any business. In this paper, we propose a specific marketing situation as an acceptable product pricing problem when the data on purchasing power and transportation cost cannot be measured exactly but can be shown as intervals of possible values. This problem is formulated as a minimization problem of a differentiable convex objective function with max-plus interval linear constraints A ⊗ x = b where x is called an L-localized solution. Its feasible region is nonconvex but could be viewed by the union of box constraints. The steepest descent algorithm is applied to optimize the objective function with respect to each of these box constraints and obtained an optimal solution from the best value.","PeriodicalId":208265,"journal":{"name":"2016 Annual Conference of the North American Fuzzy Information Processing Society (NAFIPS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Acceptable product pricing problem using L-localized solutions of max-plus interval linear equations\",\"authors\":\"Worrawate Leela-apiradee, P. Thipwiwatpotjana\",\"doi\":\"10.1109/NAFIPS.2016.7851577\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Product pricing is one of the most important strategies in doing any business. In this paper, we propose a specific marketing situation as an acceptable product pricing problem when the data on purchasing power and transportation cost cannot be measured exactly but can be shown as intervals of possible values. This problem is formulated as a minimization problem of a differentiable convex objective function with max-plus interval linear constraints A ⊗ x = b where x is called an L-localized solution. Its feasible region is nonconvex but could be viewed by the union of box constraints. The steepest descent algorithm is applied to optimize the objective function with respect to each of these box constraints and obtained an optimal solution from the best value.\",\"PeriodicalId\":208265,\"journal\":{\"name\":\"2016 Annual Conference of the North American Fuzzy Information Processing Society (NAFIPS)\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 Annual Conference of the North American Fuzzy Information Processing Society (NAFIPS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NAFIPS.2016.7851577\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 Annual Conference of the North American Fuzzy Information Processing Society (NAFIPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAFIPS.2016.7851577","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

产品定价是任何商业活动中最重要的策略之一。在本文中,我们提出了一个特定的营销情况作为可接受的产品定价问题,当购买力和运输成本的数据不能精确测量,但可以显示为可能值的区间。该问题被表述为具有最大+区间线性约束a⊗x = b的可微凸目标函数的最小化问题,其中x称为l -局域解。它的可行域是非凸的,但可以用盒形约束的并集来表示。应用最陡下降算法对每个框约束进行优化,从最优值求出最优解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Acceptable product pricing problem using L-localized solutions of max-plus interval linear equations
Product pricing is one of the most important strategies in doing any business. In this paper, we propose a specific marketing situation as an acceptable product pricing problem when the data on purchasing power and transportation cost cannot be measured exactly but can be shown as intervals of possible values. This problem is formulated as a minimization problem of a differentiable convex objective function with max-plus interval linear constraints A ⊗ x = b where x is called an L-localized solution. Its feasible region is nonconvex but could be viewed by the union of box constraints. The steepest descent algorithm is applied to optimize the objective function with respect to each of these box constraints and obtained an optimal solution from the best value.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信