{"title":"$ l^{p,q/2} $-Singular values of a real partially symmetric rectangular tensor","authors":"Jianxing Zhao","doi":"10.3934/jimo.2023111","DOIUrl":"https://doi.org/10.3934/jimo.2023111","url":null,"abstract":"","PeriodicalId":16022,"journal":{"name":"Journal of Industrial and Management Optimization","volume":"50 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70081368","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Government intervention in a recycling supply chain system: A strategy to make sustainable and clean environment","authors":"Mritunjoy Saha, R. Giri","doi":"10.3934/jimo.2023114","DOIUrl":"https://doi.org/10.3934/jimo.2023114","url":null,"abstract":"","PeriodicalId":16022,"journal":{"name":"Journal of Industrial and Management Optimization","volume":"60 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70081407","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Dynamic analysis of product and process innovation for a price-regulated firm in a market exhibiting network externality","authors":"Shoude Li, Changzhi Wu","doi":"10.3934/jimo.2023133","DOIUrl":"https://doi.org/10.3934/jimo.2023133","url":null,"abstract":"","PeriodicalId":16022,"journal":{"name":"Journal of Industrial and Management Optimization","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134981060","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we introduce a new class of generalized convexity for an $ E $-differentiable multiobjective variational problem, and to solve this problem, an associated multiobjective $ E $-variational problem is formulated with the help of an $ E $-operator. The necessary and sufficient optimality conditions are derived under the assumption of $ E $-convexity. The so-called Wolfe and Mond-Weir $ E $-dual problems are defined for the considered $ E $-differentiable multiobjective variational programming problem, and several Wolfe and Mond-Weir $ E $-duality theorems are derived under the $ E $-convexity assumption. Furthermore, to emphasize the significance of the results of this study, we considered a cake-eating problem, and the solution obtained by constructing its associated $ E $-differentiable problem and the sufficiency theorem. Throughout the paper, non-trivial illustrations are presented to support the findings.
本文引入了$ E $可微多目标变分问题的一类新的广义凸性，并利用$ E $-算子构造了相应的$ E $-变分问题。在E -凸性的假设下，导出了最优性的充分必要条件。针对所考虑的$ E $可微多目标变分规划问题，定义了所谓的Wolfe和Mond-Weir $ E $-对偶问题，并在$ E $-凸性假设下导出了几个Wolfe和Mond-Weir $ E $-对偶定理。进一步，为了强调本研究结果的意义，我们考虑了一个吃蛋糕问题，并通过构造其关联的$ E $可微问题和充分性定理得到了解。在整个论文中，提出了非琐碎的插图来支持研究结果。
{"title":"$ E $-Optimality and $ E $-duality results for multiobjective variational problems and application to the cake-eating problem","authors":"Nisha Pokharna, Indira P. Tripathi","doi":"10.3934/jimo.2023146","DOIUrl":"https://doi.org/10.3934/jimo.2023146","url":null,"abstract":"In this paper, we introduce a new class of generalized convexity for an $ E $-differentiable multiobjective variational problem, and to solve this problem, an associated multiobjective $ E $-variational problem is formulated with the help of an $ E $-operator. The necessary and sufficient optimality conditions are derived under the assumption of $ E $-convexity. The so-called Wolfe and Mond-Weir $ E $-dual problems are defined for the considered $ E $-differentiable multiobjective variational programming problem, and several Wolfe and Mond-Weir $ E $-duality theorems are derived under the $ E $-convexity assumption. Furthermore, to emphasize the significance of the results of this study, we considered a cake-eating problem, and the solution obtained by constructing its associated $ E $-differentiable problem and the sufficiency theorem. Throughout the paper, non-trivial illustrations are presented to support the findings.","PeriodicalId":16022,"journal":{"name":"Journal of Industrial and Management Optimization","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135319726","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Peiya Zhu, Xiaofei Qian, Xinbao Liu, Panos M. Pardalos
{"title":"Sales or rentals? price and service decisions for electric vehicle manufacturers","authors":"Peiya Zhu, Xiaofei Qian, Xinbao Liu, Panos M. Pardalos","doi":"10.3934/jimo.2023116","DOIUrl":"https://doi.org/10.3934/jimo.2023116","url":null,"abstract":"","PeriodicalId":16022,"journal":{"name":"Journal of Industrial and Management Optimization","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135400794","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Previous studies believed that reducing search costs would make niches better catered to consumers, and therefore, more sellers would switch to producing niches, thus leading to the long tail effect. However, although E-commerce and related technologies have brought search costs down enough, plenty of broad products are still on the market. To address this, by introducing platform decision, this study constructs a three-way game model to analyze the proportion of broad products on the platform. The results show that when search costs are sufficiently small, the proportion of niches will decrease with the further reduction of search costs, which is inconsistent with the long tail effect. By adding platform decision, this study summarizes the relationship between search costs and the long tail effect more comprehensively and explains that a large number of broad products on the market is deliberately arranged by the platform. In addition, this article studied the extended scenario with a recommendation mechanism to supplement the basic model in which consumers search randomly. The study found that the findings in the basic model were strengthened.
{"title":"Broad or niche? decision-making options based on e-commerce platforms","authors":"Ruwen Tan, Rujin Liao, Jing Zhang, Minjiu Yu, Qinhong Yu","doi":"10.3934/jimo.2023137","DOIUrl":"https://doi.org/10.3934/jimo.2023137","url":null,"abstract":"Previous studies believed that reducing search costs would make niches better catered to consumers, and therefore, more sellers would switch to producing niches, thus leading to the long tail effect. However, although E-commerce and related technologies have brought search costs down enough, plenty of broad products are still on the market. To address this, by introducing platform decision, this study constructs a three-way game model to analyze the proportion of broad products on the platform. The results show that when search costs are sufficiently small, the proportion of niches will decrease with the further reduction of search costs, which is inconsistent with the long tail effect. By adding platform decision, this study summarizes the relationship between search costs and the long tail effect more comprehensively and explains that a large number of broad products on the market is deliberately arranged by the platform. In addition, this article studied the extended scenario with a recommendation mechanism to supplement the basic model in which consumers search randomly. The study found that the findings in the basic model were strengthened.","PeriodicalId":16022,"journal":{"name":"Journal of Industrial and Management Optimization","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136367264","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper concentrates on the scheduling problem in seru production system (SPS), which is a new-type advanced system with high manufacturing flexibility to response the volatile market. Motivated by practical scenarios, the seru scheduling problem in this paper considers the sequence-dependent setup time and release date to minimize the total weighted tardiness. A mixed integer programming (MIP) model is formulated, and the branch-and-bound (B & B) algorithm combining dominance propositions and the lower bound strategy is designed subsequently. Finally, computational experiments are conducted. A series of experimental results show that the proposed B & B algorithm performs very well in finding high-quality solutions, and it can find exact and near-exact solutions for 216 randomly generated instances quickly. Even when CPLEX is unable to solve the problems in five-hour, the B & B algorithm can return optimal solutions for as many as 5 serus and 22 products in a very short CPU time.
{"title":"An exact branch-and-bound algorithm for <i>seru</i> scheduling problem with sequence-dependent setup time and release date","authors":"Xiaohong Zhang, Zhe Zhang, Xiaoling Song, Xue Gong, Yong Yin","doi":"10.3934/jimo.2023139","DOIUrl":"https://doi.org/10.3934/jimo.2023139","url":null,"abstract":"This paper concentrates on the scheduling problem in seru production system (SPS), which is a new-type advanced system with high manufacturing flexibility to response the volatile market. Motivated by practical scenarios, the seru scheduling problem in this paper considers the sequence-dependent setup time and release date to minimize the total weighted tardiness. A mixed integer programming (MIP) model is formulated, and the branch-and-bound (B & B) algorithm combining dominance propositions and the lower bound strategy is designed subsequently. Finally, computational experiments are conducted. A series of experimental results show that the proposed B & B algorithm performs very well in finding high-quality solutions, and it can find exact and near-exact solutions for 216 randomly generated instances quickly. Even when CPLEX is unable to solve the problems in five-hour, the B & B algorithm can return optimal solutions for as many as 5 serus and 22 products in a very short CPU time.","PeriodicalId":16022,"journal":{"name":"Journal of Industrial and Management Optimization","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135010496","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The optimal derivative-based investment and proportional reinsurance problems with stochastic volatility and jump risks are investigated. Assume that insurer possesses the constant absolute risk aversion preference. The insurer transfers part of insurance risk via purchasing proportional reinsurance and invests surplus in financial market with a risk-free bond, a risky stock described by the stochastic volatility jump diffusion model, and two non-redundant derivatives. The optimal strategies of reinsurance and investment with derivative trading are obtained in closed-form, while the optimal strategies with no derivative trading are numerically analyzed. The gain from derivative trading is analyzed by the method of certainty-equivalence. Our results illustrate that the value of derivative trading is always positive and sizeable, compared with the size of positions in the financial market. Moreover, under the assumption that the risks in the financial market are independent of those in the insurance market, the optimal strategy of reinsurance is independent of that of investment.
{"title":"Investigations to the optimal derivative-based investment and proportional reinsurance strategies","authors":"Jun Feng, Shaoyong Lai, Liting Zhou","doi":"10.3934/jimo.2023143","DOIUrl":"https://doi.org/10.3934/jimo.2023143","url":null,"abstract":"The optimal derivative-based investment and proportional reinsurance problems with stochastic volatility and jump risks are investigated. Assume that insurer possesses the constant absolute risk aversion preference. The insurer transfers part of insurance risk via purchasing proportional reinsurance and invests surplus in financial market with a risk-free bond, a risky stock described by the stochastic volatility jump diffusion model, and two non-redundant derivatives. The optimal strategies of reinsurance and investment with derivative trading are obtained in closed-form, while the optimal strategies with no derivative trading are numerically analyzed. The gain from derivative trading is analyzed by the method of certainty-equivalence. Our results illustrate that the value of derivative trading is always positive and sizeable, compared with the size of positions in the financial market. Moreover, under the assumption that the risks in the financial market are independent of those in the insurance market, the optimal strategy of reinsurance is independent of that of investment.","PeriodicalId":16022,"journal":{"name":"Journal of Industrial and Management Optimization","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135319720","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we consider a class of interval-valued multiobjective optimization problems (in short, (IVMOP)) and formulate an associated multiobjective optimization problem, referred to as (MOP). We establish that the Pareto optimal solution of the associated (MOP) is an effective solution of (IVMOP). Using this characteristic of the associated (MOP), we introduce a variant of Newton's algorithm for the considered (IVMOP). The proposed algorithm exhibits superlinear convergence to a locally effective solution of (IVMOP), provided the objective function of (IVMOP) is twice generalized Hukuhara differentiable and locally strongly convex. Furthermore, if the second-order generalized Hukuhara partial derivatives of the objective function of (IVMOP) are generalized Hukuhara Lipschitz continuous, the rate of convergence is quadratic. We provide a suitable numerical example to illustrate the developed methodology. Moreover, we employ the proposed algorithm to solve a real-life portfolio optimization problem.
{"title":"Newton's method for interval-valued multiobjective optimization problem","authors":"Balendu Bhooshan Upadhyay, Rupesh Krishna Pandey, Shanli Liao","doi":"10.3934/jimo.2023138","DOIUrl":"https://doi.org/10.3934/jimo.2023138","url":null,"abstract":"In this paper, we consider a class of interval-valued multiobjective optimization problems (in short, (IVMOP)) and formulate an associated multiobjective optimization problem, referred to as (MOP). We establish that the Pareto optimal solution of the associated (MOP) is an effective solution of (IVMOP). Using this characteristic of the associated (MOP), we introduce a variant of Newton's algorithm for the considered (IVMOP). The proposed algorithm exhibits superlinear convergence to a locally effective solution of (IVMOP), provided the objective function of (IVMOP) is twice generalized Hukuhara differentiable and locally strongly convex. Furthermore, if the second-order generalized Hukuhara partial derivatives of the objective function of (IVMOP) are generalized Hukuhara Lipschitz continuous, the rate of convergence is quadratic. We provide a suitable numerical example to illustrate the developed methodology. Moreover, we employ the proposed algorithm to solve a real-life portfolio optimization problem.","PeriodicalId":16022,"journal":{"name":"Journal of Industrial and Management Optimization","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135784585","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Uncertain noncausal systems (UNCSs) are uncertain singular systems that are supposed to be regular along.This study investigates two-player zero-sum games (TPZSGs) for UNCSs using the optimistic value criterion. The first step is to introduce a method to convert a linear uncertain noncausal system (UNCS) considering linear control terms into subsystems including two kinds of uncertain difference equations. Recurrence equations are derived for tackling a TPZSG subject to linear UNCSs. Using recurrence equations, we give an algorithm for solving the TPZSG subject to linear UNCSs and show how to apply the algorithm to find the saddle-point solution and the equilibrium value of this kind of game by a numerical example. To expand on these results, we provide the corresponding equations for solving TPZSGs subject to nonlinear UNCSs. Moreover, we give the saddle-point solution and equilibrium value of a TPZSG for a nonlinear UNCS considering quadratic control terms by solving the equations.
{"title":"Saddle-point solution to zero-sumgame for uncertain noncausal systems based on optimistic value","authors":"Xin Chen, Yan Wang, Fuzhen Li, Yu Shao","doi":"10.3934/jimo.2023135","DOIUrl":"https://doi.org/10.3934/jimo.2023135","url":null,"abstract":"Uncertain noncausal systems (UNCSs) are uncertain singular systems that are supposed to be regular along.This study investigates two-player zero-sum games (TPZSGs) for UNCSs using the optimistic value criterion. The first step is to introduce a method to convert a linear uncertain noncausal system (UNCS) considering linear control terms into subsystems including two kinds of uncertain difference equations. Recurrence equations are derived for tackling a TPZSG subject to linear UNCSs. Using recurrence equations, we give an algorithm for solving the TPZSG subject to linear UNCSs and show how to apply the algorithm to find the saddle-point solution and the equilibrium value of this kind of game by a numerical example. To expand on these results, we provide the corresponding equations for solving TPZSGs subject to nonlinear UNCSs. Moreover, we give the saddle-point solution and equilibrium value of a TPZSG for a nonlinear UNCS considering quadratic control terms by solving the equations.","PeriodicalId":16022,"journal":{"name":"Journal of Industrial and Management Optimization","volume":"274 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136306360","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：