Robust Optimization Model for Internet Shopping Online Problems with Endorsement Costs in the Fashion Industry

Olivia Anjanette, B. Subartini, D. Chaerani
{"title":"Robust Optimization Model for Internet Shopping Online Problems with Endorsement Costs in the Fashion Industry","authors":"Olivia Anjanette, B. Subartini, D. Chaerani","doi":"10.24198/jmi.v19.n1.45096.67-76","DOIUrl":null,"url":null,"abstract":"Online business is a business activity carried out via the internet or digitally. Buying, selling, and advertising are done online through e-commerce, social media, or online shops. The products offered vary, including services, food, household needs, and fashion. Selling online is not limited by time and distance, and consumers can obtain information about products and services that can influence their decisions. At the same time, sellers also have the opportunity to advertise their products in a broader range by making endorsements. An endorsement is a form of advertising using well-known figures who are recognized, trusted, and respected by people. In this thesis, a model for optimizing the problem of online internet shopping with endorsement fees is formulated. This optimization model aims to maximize the profits gained by sellers in marketing their products online. In marketing products, there is uncertainty in the number of requests. To overcome this uncertainty, an approach is needed that can handle this uncertainty, namely Robust optimization. The Robust optimization model is solved using the polyhedral uncertainty set approach, resulting in a computationally tractable optimal solution. Keywords: internet shopping online; endorsement costs; robust optimization.","PeriodicalId":53096,"journal":{"name":"Jurnal Matematika Integratif","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Jurnal Matematika Integratif","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.24198/jmi.v19.n1.45096.67-76","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Online business is a business activity carried out via the internet or digitally. Buying, selling, and advertising are done online through e-commerce, social media, or online shops. The products offered vary, including services, food, household needs, and fashion. Selling online is not limited by time and distance, and consumers can obtain information about products and services that can influence their decisions. At the same time, sellers also have the opportunity to advertise their products in a broader range by making endorsements. An endorsement is a form of advertising using well-known figures who are recognized, trusted, and respected by people. In this thesis, a model for optimizing the problem of online internet shopping with endorsement fees is formulated. This optimization model aims to maximize the profits gained by sellers in marketing their products online. In marketing products, there is uncertainty in the number of requests. To overcome this uncertainty, an approach is needed that can handle this uncertainty, namely Robust optimization. The Robust optimization model is solved using the polyhedral uncertainty set approach, resulting in a computationally tractable optimal solution. Keywords: internet shopping online; endorsement costs; robust optimization.
时尚行业具有背书成本的网络购物问题的鲁棒优化模型
在线商业是通过互联网或数字方式进行的商业活动。购买、销售和广告都是通过电子商务、社交媒体或网上商店在线完成的。提供的产品各不相同,包括服务、食品、家庭需求和时尚。在线销售不受时间和距离的限制,消费者可以获得影响其决策的产品和服务信息。与此同时,卖家也有机会通过代言在更广泛的范围内为自己的产品做广告。背书是一种广告形式,使用人们认可、信任和尊重的知名人物。本文建立了一个带有背书费的网上购物问题的优化模型。这种优化模型旨在最大限度地提高卖家在网上营销产品时获得的利润。在营销产品时,请求数量存在不确定性。为了克服这种不确定性,需要一种能够处理这种不确定性的方法,即鲁棒优化。使用多面体不确定性集方法求解鲁棒优化模型,得到可计算的最优解。关键词:网上购物;背书费用;稳健优化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
20
审稿时长
12 weeks
×
引用
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学术官方微信