A. Angelika, Mohamed Boualem, M. Cherfaoui, Latifa Medjahri
We consider a single server Markovian feedback queue with variant of multiple vacation policy, balking, server's states-dependent reneging, and retention of reneged customers. We obtain the steady-state solution of the considered queue based on the use of probability generating functions. Then, the closed-form expressions of different system characteristics are derived. Finally, we present some numerical results in order to show the impact of the parameters of impatience timers on the performance measures of the system.
{"title":"Variant vacation queueing system with Bernoulli feedback, balking and server's states-dependent reneging","authors":"A. Angelika, Mohamed Boualem, M. Cherfaoui, Latifa Medjahri","doi":"10.2298/YJOR200418003B","DOIUrl":"https://doi.org/10.2298/YJOR200418003B","url":null,"abstract":"We consider a single server Markovian feedback queue with variant of multiple\u0000 vacation policy, balking, server's states-dependent reneging, and retention\u0000 of reneged customers. We obtain the steady-state solution of the considered\u0000 queue based on the use of probability generating functions. Then, the\u0000 closed-form expressions of different system characteristics are derived.\u0000 Finally, we present some numerical results in order to show the impact of the\u0000 parameters of impatience timers on the performance measures of the system.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"18 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74492541","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Our model deals with the stock-dependent demand as exhibiting huge volume of commodities leads to more costumers and augment the trading of the goods. As some goods like vegetables, fruits, medicines deteriorate after a period of time, resulting in economical and financial losses, we took this factor into consideration and included a constant deterioration rate, controlled by suitable preservation technologies. Preservation technology investments are made for the valuable business as it helps to decrease the rate of deterioration. Our model allows shortages, and back-ordering is permissible to manage the loss that occurs due to perishable objects and shortages. The objectives are to find the optimal cycle time, preservation technology cost, and positive inventory time. The paper also proves the convexity of total cost through graphs with respect to decision variables. A sensitivity analysis of decision variables with respect to different inventory parameters is carried out.
{"title":"Inventory and preservation investment for deteriorating system with stock-dependent demand and partial backlogged shortages","authors":"Nita Shah, Kavita Rabari, Ekta Patel","doi":"10.2298/YJOR200217038S","DOIUrl":"https://doi.org/10.2298/YJOR200217038S","url":null,"abstract":"Our model deals with the stock-dependent demand as exhibiting huge volume of commodities leads to more costumers and augment the trading of the goods. As some goods like vegetables, fruits, medicines deteriorate after a period of time, resulting in economical and financial losses, we took this factor into consideration and included a constant deterioration rate, controlled by suitable preservation technologies. Preservation technology investments are made for the valuable business as it helps to decrease the rate of deterioration. Our model allows shortages, and back-ordering is permissible to manage the loss that occurs due to perishable objects and shortages. The objectives are to find the optimal cycle time, preservation technology cost, and positive inventory time. The paper also proves the convexity of total cost through graphs with respect to decision variables. A sensitivity analysis of decision variables with respect to different inventory parameters is carried out.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86716694","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Increased competition in market leads to the interaction between marketing and production of a firm in segmented market. This paper considers the problem of finding an optimal promotion and production strategy, where the consumer demand rate depends on differentiated and mass promotion efforts. Differentiated promotions can reach each segment independently and mass promotion reaches it with a fixed segmentspectrum. Under reasonable conditions, two optimal control problems are formulated. The first one considers a single source inventory and multi-segmented demand problem. In the second, a multi-segmented inventory and demand problem is considered, where it is assumed that the firm chooses an inventory directed to each segment. The solution to both problems is obtained by using Pontryagin?s maximum principle. Numerical examples are provided to illustrate the applicability of proposed models. The discretized version of the problem is formulated and solved on some numeric data.
{"title":"Optimal control policy to production and inventory system with promotion effort dependent demand in segmented market","authors":"Sunita Mehta, Kuldeep Chaudhary","doi":"10.2298/YJOR200219040M","DOIUrl":"https://doi.org/10.2298/YJOR200219040M","url":null,"abstract":"Increased competition in market leads to the interaction between marketing and production of a firm in segmented market. This paper considers the problem of finding an optimal promotion and production strategy, where the consumer demand rate depends on differentiated and mass promotion efforts. Differentiated promotions can reach each segment independently and mass promotion reaches it with a fixed segmentspectrum. Under reasonable conditions, two optimal control problems are formulated. The first one considers a single source inventory and multi-segmented demand problem. In the second, a multi-segmented inventory and demand problem is considered, where it is assumed that the firm chooses an inventory directed to each segment. The solution to both problems is obtained by using Pontryagin?s maximum principle. Numerical examples are provided to illustrate the applicability of proposed models. The discretized version of the problem is formulated and solved on some numeric data.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"18 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90470857","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Let n weighted points be given in the plane. The inverse version of the minisum circle location problem deals with modifying the weights of points with minimum cost, such that the sum of the weighted distances from the circumference of a given circle C with radius r, to the given points is minimized. The classical model of this problem contains infinite constraints. In this paper, a mathematical model with finite constraints is presented. Then an efficient method is developed for solving this problem.
{"title":"The inverse minisum circle location problem","authors":"Mehraneh Gholami, J. Fathali","doi":"10.2298/yjor200715027g","DOIUrl":"https://doi.org/10.2298/yjor200715027g","url":null,"abstract":"Let n weighted points be given in the plane. The inverse version of the minisum circle location problem deals with modifying the weights of points with minimum cost, such that the sum of the weighted distances from the circumference of a given circle C with radius r, to the given points is minimized. The classical model of this problem contains infinite constraints. In this paper, a mathematical model with finite constraints is presented. Then an efficient method is developed for solving this problem.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"14 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84979435","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Patching service provides software firms an option to deal with the leftover bugs and is thereby helping them to keep a track of their product. More and more software firms are making use of this concept of prolonged testing. But this framework of releasing unprepared software in market involves a huge risk. The hastiness of vendors in releasing software patch at times can be dangerous as there are chances that firms release an infected patch. The infected patch (es) might lead to a hike in bug occurrence and error count and might make the software more vulnerable. The current work presents an understanding of such situation through mathematical modeling framework; wherein, the distinct behavior of testers (during in-house testing and field testing) and users is described. The proposed model has been validated on two software failure data sets of Tandem Computers and Brazilian Electronic Switching System, TROPICO R-1500.
{"title":"Measuring software reliability under the influence of an infected patch","authors":"J. Kaur, Adarsh Anand, Ompal Singh, Vijay Kumar","doi":"10.2298/YJOR200117005K","DOIUrl":"https://doi.org/10.2298/YJOR200117005K","url":null,"abstract":"Patching service provides software firms an option to deal with the leftover bugs and is thereby helping them to keep a track of their product. More and more software firms are making use of this concept of prolonged testing. But this framework of releasing unprepared software in market involves a huge risk. The hastiness of vendors in releasing software patch at times can be dangerous as there are chances that firms release an infected patch. The infected patch (es) might lead to a hike in bug occurrence and error count and might make the software more vulnerable. The current work presents an understanding of such situation through mathematical modeling framework; wherein, the distinct behavior of testers (during in-house testing and field testing) and users is described. The proposed model has been validated on two software failure data sets of Tandem Computers and Brazilian Electronic Switching System, TROPICO R-1500.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"46 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90636701","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
R. Dubey, Rajnish Kumar, Khursheed Alam, L. Mishra, V. Mishra
In the present paper, a newly combined higher-order non-differentiable symmetric duality in scalar-objective programming over arbitrary cones is formulated. In literature we have discussed primal-dual results with arbitrary cones, while in this article, we have derived combined result with one model over arbitrary cones. The theorems of duality are derived for these problems under ?-pseudoinvexity/?-invexity/C-pseudoconvexity/C-convexity speculations over arbitrary cones.
{"title":"A class of new type unified non-differentiable higher order symmetric duality theorems over arbitrary cones under generalized assumptions","authors":"R. Dubey, Rajnish Kumar, Khursheed Alam, L. Mishra, V. Mishra","doi":"10.2298/yjor210218020d","DOIUrl":"https://doi.org/10.2298/yjor210218020d","url":null,"abstract":"In the present paper, a newly combined higher-order non-differentiable symmetric duality in scalar-objective programming over arbitrary cones is formulated. In literature we have discussed primal-dual results with arbitrary cones, while in this article, we have derived combined result with one model over arbitrary cones. The theorems of duality are derived for these problems under ?-pseudoinvexity/?-invexity/C-pseudoconvexity/C-convexity speculations over arbitrary cones.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"11 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74067886","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The paper considers the method of correction of thermographic images (thermograms) obtained by recording in the infrared range of radiation from the surface of the object under study using a thermal imager. A thermogram with a certain degree of reliability transmits an image of the heat-generating structure inside the body. In this paper, the mathematical correction of images on a thermogram is performed based on an analytical continuation of the stationary temperature distribution as a harmonic function from the surface of the object under study towards the heat sources. The continuation is carried out by solving an ill-posed mixed problem for the Laplace equation in a cylindrical region of rectangular cross-section. To construct a stable solution to the problem, the principle of the minimum of the Tikhonov smoothing functional we used.
{"title":"Correction of thermographic images based on the minimization method of Tikhonov functional","authors":"O. Baaj, Nataliayu Chernikova, E. Laneev","doi":"10.2298/yjor211015026b","DOIUrl":"https://doi.org/10.2298/yjor211015026b","url":null,"abstract":"The paper considers the method of correction of thermographic images (thermograms) obtained by recording in the infrared range of radiation from the surface of the object under study using a thermal imager. A thermogram with a certain degree of reliability transmits an image of the heat-generating structure inside the body. In this paper, the mathematical correction of images on a thermogram is performed based on an analytical continuation of the stationary temperature distribution as a harmonic function from the surface of the object under study towards the heat sources. The continuation is carried out by solving an ill-posed mixed problem for the Laplace equation in a cylindrical region of rectangular cross-section. To construct a stable solution to the problem, the principle of the minimum of the Tikhonov smoothing functional we used.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"68 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83187925","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper deals with knapsack problem in fuzzy nature, where both the objective function and constraints are considered to be fuzzy. Three different models for fuzzy knapsack problem are proposed including, expected value model, chance-constrained model, and dependent-chance model. Credibility ranking method is applied to convert the fuzzy models into a crisp equivalent linear one considering triangular and trapezoidal fuzzy numbers. The solution of the fuzzy problem is obtained with respect to different satisfaction degrees in the objective function and constraints. Several numerical examples are given to demonstrate different models and concepts. The proposed approaches are applied to model and to solve a fuzzy pre-disaster investment decision problem.
{"title":"Knapsack problem in fuzzy nature: Different models based on credibility ranking method","authors":"M. Niksirat, S. H. Nasseri","doi":"10.2298/yjor210219021n","DOIUrl":"https://doi.org/10.2298/yjor210219021n","url":null,"abstract":"This paper deals with knapsack problem in fuzzy nature, where both the objective function and constraints are considered to be fuzzy. Three different models for fuzzy knapsack problem are proposed including, expected value model, chance-constrained model, and dependent-chance model. Credibility ranking method is applied to convert the fuzzy models into a crisp equivalent linear one considering triangular and trapezoidal fuzzy numbers. The solution of the fuzzy problem is obtained with respect to different satisfaction degrees in the objective function and constraints. Several numerical examples are given to demonstrate different models and concepts. The proposed approaches are applied to model and to solve a fuzzy pre-disaster investment decision problem.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"604 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77437491","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we proposed the non-smooth G-?-preinvexity by generalizing ?-invexity and G-preinvexity, and discussed some solution properties about non-smooth vector optimization problems and vector variational-like inequality problems under the condition of non-smooth G-?-preinvexity. Moreover, we also proved that the vector critical points, the weakly efficient points and the solutions of the non-smooth weak vector variational-like inequality problem are equivalent under non-smooth pseudo-G-?-preinvexity assumptions.
{"title":"G-α-preinvex functions and non-smooth vector optimization problems","authors":"Yu Chen","doi":"10.2298/YJOR200527008C","DOIUrl":"https://doi.org/10.2298/YJOR200527008C","url":null,"abstract":"In this paper, we proposed the non-smooth G-?-preinvexity by generalizing ?-invexity and G-preinvexity, and discussed some solution properties about non-smooth vector optimization problems and vector variational-like inequality problems under the condition of non-smooth G-?-preinvexity. Moreover, we also proved that the vector critical points, the weakly efficient points and the solutions of the non-smooth weak vector variational-like inequality problem are equivalent under non-smooth pseudo-G-?-preinvexity assumptions.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"8 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82911201","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The aim of our paper is to obtain efficient solutions to the interval multi-objective linear programming (IMOLP) models. In this paper, we propose a new method to determine the efficient solutions in the IMOLP models by using the expected value and variance operators (EVV operators). First, we define concepts of the expected value, variance, and uncertainty distributions, and present some properties of the EVV operators. Then, we introduce the IMOLP model under these operators. An IMOLP model consist of separate ILPs, but using the EVV operators and the uncertainty distributions, it can be converted into the interval linear programming (ILP) models under the EVV operators (EVV-ILP model). We show that optimal solutions of the EEV-ILP model are the efficient solutions of IMOLP models with uncertainty variables. The proposed method, which is called EVV, is not hard to solve. Finally, Monte Carlo simulation is used to show its performance assessment.
{"title":"Finding efficient solutions in the interval multi-objective linear programming models","authors":"A. Batamiz, M. Allahdadi","doi":"10.2298/yjor190817034b","DOIUrl":"https://doi.org/10.2298/yjor190817034b","url":null,"abstract":"The aim of our paper is to obtain efficient solutions to the interval multi-objective linear programming (IMOLP) models. In this paper, we propose a new method to determine the efficient solutions in the IMOLP models by using the expected value and variance operators (EVV operators). First, we define concepts of the expected value, variance, and uncertainty distributions, and present some properties of the EVV operators. Then, we introduce the IMOLP model under these operators. An IMOLP model consist of separate ILPs, but using the EVV operators and the uncertainty distributions, it can be converted into the interval linear programming (ILP) models under the EVV operators (EVV-ILP model). We show that optimal solutions of the EEV-ILP model are the efficient solutions of IMOLP models with uncertainty variables. The proposed method, which is called EVV, is not hard to solve. Finally, Monte Carlo simulation is used to show its performance assessment.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"64 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82975097","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：