In this paper, we introduce the notion of a generalized difference I-convergent (i.e.?m-I-convergent) and difference I-Cauchy (i.e.?m-I-Cauchy) sequence in intuitionistic fuzzy n-normed spaces. Further, we prove some results related to this notion. Also, we study the concepts of a generalized difference I+-convergent (i.e.?m-I+-convergent) sequence in intuitionistic fuzzy n-normed spaces and show the relation between them.
本文引入了直觉模糊n赋范空间中广义差分i -收敛序列(即?m- i -收敛)和差分I-Cauchy序列(即?m-I-Cauchy)的概念。进一步，我们证明了与这一概念相关的一些结果。研究了直觉模糊n赋范空间中广义差分I+-收敛(即?m-I+-收敛)序列的概念，并给出了它们之间的关系。
{"title":"A new type of difference I-convergent sequence in IFnNS","authors":"A. Khan, Izhar Ali, M. Ahmad","doi":"10.2298/yjor210318022k","DOIUrl":"https://doi.org/10.2298/yjor210318022k","url":null,"abstract":"In this paper, we introduce the notion of a generalized difference I-convergent (i.e.?m-I-convergent) and difference I-Cauchy (i.e.?m-I-Cauchy) sequence in intuitionistic fuzzy n-normed spaces. Further, we prove some results related to this notion. Also, we study the concepts of a generalized difference I+-convergent (i.e.?m-I+-convergent) sequence in intuitionistic fuzzy n-normed spaces and show the relation between them.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"75 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89232910","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}
Vivek Kumar, Saurabh Panwar, P. K. Kapur, Ompal Singh
In this research, a novel approach is developed where a testing team delivers the software product first and extends the testing process for additional time in the user environment. During the operational phase, users also participate in the fault detection process and notify the defects to the software. In this study, a reliability growth model is proposed using a unified approach based on the expenditure of efforts during the testing process. Besides, debugging process is considered imperfect as new faults may enter the software during each fault removal. The developed model further considers that the developer?s rate of defect identification changes with a software release. Thus, the software time-to-market acts as a change-point for the failure observation phenomenon. It is asserted that the accuracy of a software reliability estimation improves by implementing the concept of change-point. The main aim of the paper is to evaluate the optimal release time and testing termination time based on two attributes, particularly, reliability, and cost. A multi-attribute utility theory (MAUT) is applied to find a trade-off between the two conflicting attributes. Finally, a numerical example is presented by using the historical fault count data. The behavior of two decision variables is measured and compared with the existing release time strategy.
{"title":"Optimal decisions on software release and post-release testing: A unified approach","authors":"Vivek Kumar, Saurabh Panwar, P. K. Kapur, Ompal Singh","doi":"10.2298/YJOR200218001K","DOIUrl":"https://doi.org/10.2298/YJOR200218001K","url":null,"abstract":"In this research, a novel approach is developed where a testing team delivers the software product first and extends the testing process for additional time in the user environment. During the operational phase, users also participate in the fault detection process and notify the defects to the software. In this study, a reliability growth model is proposed using a unified approach based on the expenditure of efforts during the testing process. Besides, debugging process is considered imperfect as new faults may enter the software during each fault removal. The developed model further considers that the developer?s rate of defect identification changes with a software release. Thus, the software time-to-market acts as a change-point for the failure observation phenomenon. It is asserted that the accuracy of a software reliability estimation improves by implementing the concept of change-point. The main aim of the paper is to evaluate the optimal release time and testing termination time based on two attributes, particularly, reliability, and cost. A multi-attribute utility theory (MAUT) is applied to find a trade-off between the two conflicting attributes. Finally, a numerical example is presented by using the historical fault count data. The behavior of two decision variables is measured and compared with the existing release time strategy.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"65 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89773815","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 establish second-order sufficient KKT optimality conditions of a set-valued fractional programming problem under second-order generalized cone convexity assumptions. We also prove duality results between the primal problem and second-order dual problems of parametric, Mond-Weir, Wolfe, and mixed types via the notion of second-order contingent epiderivative.
{"title":"Sufficiency and duality of set-valued fractional programming problems via second-order contingent epiderivative","authors":"K. Das","doi":"10.2298/yjor210218019d","DOIUrl":"https://doi.org/10.2298/yjor210218019d","url":null,"abstract":"In this paper, we establish second-order sufficient KKT optimality conditions of a set-valued fractional programming problem under second-order generalized cone convexity assumptions. We also prove duality results between the primal problem and second-order dual problems of parametric, Mond-Weir, Wolfe, and mixed types via the notion of second-order contingent epiderivative.","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":"82958163","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 establish second-order KKT conditions of a set-valued optimization problem and study second-order Mond-Weir, Wolfe, and mixed types duals with the help of second-order contingent epiderivative and second-order generalized cone convexity assumptions.
{"title":"Set-valued optimization problems via second-order contingent epiderivative","authors":"K. Das, C. Nahak","doi":"10.2298/yjor191215041d","DOIUrl":"https://doi.org/10.2298/yjor191215041d","url":null,"abstract":"In this paper, we establish second-order KKT conditions of a set-valued optimization problem and study second-order Mond-Weir, Wolfe, and mixed types duals with the help of second-order contingent epiderivative and second-order generalized cone convexity assumptions.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"76 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86584062","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 author of the article "Optimality Conditions and Duality for Multiobjective Semi-Infinite Programming with Data Uncertainity via Mordukhovich Subdifferential", Thanh-Hung Pham has informed the Editor about necessary corrections of the paper.
{"title":"Corrigendum on: Optimality conditions and duality for multiobjective semi-infinite programming with data uncertainty via Mordukhovich subdifferential (Yugoslav Journal of Operations Research, vol. 31, no 4, doi: https://doi.org/10.2298/YJOR201017013P)","authors":"E. Editoral","doi":"10.2298/yjor211117025e","DOIUrl":"https://doi.org/10.2298/yjor211117025e","url":null,"abstract":"The author of the article \"Optimality Conditions and Duality for Multiobjective Semi-Infinite Programming with Data Uncertainity via Mordukhovich Subdifferential\", Thanh-Hung Pham has informed the Editor about necessary corrections of the paper. <br><br><font color=\"red\"><b> Link to the corrected article <u><a href=\"http://dx.doi.org/10.2298/YJOR201017013P\">10.2298/YJOR201017013P</a></b></u>","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"9 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87030084","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}
F. Almathkour, Omar Belgacem, Said Toumi, B. Jarboui
This paper deals with the permutation flowshop scheduling problem with time lags constraints to minimize the total weighted tardiness criterion by using the Branch and Bound algorithm. A new lower bound was developed for the flowshop scheduling problem. The computational experiments indicate that the proposed algorithm provides good solution in terms of quality and time requirements.
{"title":"Branch and bound algorithm for solving the total weighted tardiness criterion for the permutation flowshop scheduling problem with time lags","authors":"F. Almathkour, Omar Belgacem, Said Toumi, B. Jarboui","doi":"10.2298/yjor210615023a","DOIUrl":"https://doi.org/10.2298/yjor210615023a","url":null,"abstract":"This paper deals with the permutation flowshop scheduling problem with time lags constraints to minimize the total weighted tardiness criterion by using the Branch and Bound algorithm. A new lower bound was developed for the flowshop scheduling problem. The computational experiments indicate that the proposed algorithm provides good solution in terms of quality and time requirements.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"2014 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88206520","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 article studies a pair of higher order nondifferentiable symmetric fractional programming problem over cones. First, higher order cone convex function is introduced. Then using the properties of this function, duality results are set up, which give the legitimacy of the pair of primal dual symmetric model.
{"title":"Higher order symmetric duality for multiobjective fractional programming problems over cones","authors":"Arshpreet Kaur, M. Sharma","doi":"10.2298/YJOR200615012K","DOIUrl":"https://doi.org/10.2298/YJOR200615012K","url":null,"abstract":"This article studies a pair of higher order nondifferentiable symmetric fractional programming problem over cones. First, higher order cone convex function is introduced. Then using the properties of this function, duality results are set up, which give the legitimacy of the pair of primal dual symmetric model.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"23 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85568602","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}
Inventory routing problems (IRP) are among important tools to be used for implementing vendor manage inventory. Many researchers try to develop methods for solving inventory routing problem, however, only a few developed methods for inventory routing problems for spoilage items. In reality, many items are deteriorated and spoiled during transportation and storage period. In this paper, we developed a model and methods to solve the inventory routing problem for deteriorating items with dynamic demand and spoilage rate, i.e., demand varies and items spoil during planning periods. Those cases are more realistic since many commodities such as fruits and vegetables have dynamic demand and spoilage rate. A Genetic Algorithm and Particle Swarm Optimization are developed to solve the problem with various demands in a specific planning period since the problem is Np-hard. A numerical example and sensitivity analysis are conducted to verify the model, and to get management insight it. The result is interesting and support general hypothesis that dynamic demands result in higher inventory cost than the static demands, and the increasing demand results in increasing inventory cost. Also, the results show that increasing demand and deteriorating rates significantly affect the total cost, therefore, the developed model is important and significantly useful to be used for solving IRP with dynamic demand and spoilage items
{"title":"An inventory routing problem for deteriorating items with dynamic demand and spoilage rate","authors":"Gede Widyadana Agus, Krisna Wahyudi, N. Sutapa","doi":"10.2298/YJOR200516037W","DOIUrl":"https://doi.org/10.2298/YJOR200516037W","url":null,"abstract":"Inventory routing problems (IRP) are among important tools to be used for implementing vendor manage inventory. Many researchers try to develop methods for solving inventory routing problem, however, only a few developed methods for inventory routing problems for spoilage items. In reality, many items are deteriorated and spoiled during transportation and storage period. In this paper, we developed a model and methods to solve the inventory routing problem for deteriorating items with dynamic demand and spoilage rate, i.e., demand varies and items spoil during planning periods. Those cases are more realistic since many commodities such as fruits and vegetables have dynamic demand and spoilage rate. A Genetic Algorithm and Particle Swarm Optimization are developed to solve the problem with various demands in a specific planning period since the problem is Np-hard. A numerical example and sensitivity analysis are conducted to verify the model, and to get management insight it. The result is interesting and support general hypothesis that dynamic demands result in higher inventory cost than the static demands, and the increasing demand results in increasing inventory cost. Also, the results show that increasing demand and deteriorating rates significantly affect the total cost, therefore, the developed model is important and significantly useful to be used for solving IRP with dynamic demand and spoilage items","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"12 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75197172","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}
We consider the symmetric traveling salesman problem (TSP) with instances represented by complete graphs G with distances between cities as edge weights. A complexity index is an invariant of an instance I by which we predict the execution time of an exact TSP algorithm for I. In the paper [5] we have considered some short edge subgraphs of G and defined several new invariants related to their connected components. Extensive computational experiments with instances on 50 vertices with the uniform distribution of integer edge weights in the interval [1,100] show that there exists correlation between the sequences of selected invariants and the sequence of execution times of the well-known TSP Solver Concorde. In this paper we extend these considerations for instances up to 100 vertices.
{"title":"Complexity indices for the traveling salesman problem continued","authors":"D. Cvetkovic, Zorica Dražić, V. Kovacevic-Vujcic","doi":"10.2298/YJOR201121014C","DOIUrl":"https://doi.org/10.2298/YJOR201121014C","url":null,"abstract":"We consider the symmetric traveling salesman problem (TSP) with instances represented by complete graphs G with distances between cities as edge weights. A complexity index is an invariant of an instance I by which we predict the execution time of an exact TSP algorithm for I. In the paper [5] we have considered some short edge subgraphs of G and defined several new invariants related to their connected components. Extensive computational experiments with instances on 50 vertices with the uniform distribution of integer edge weights in the interval [1,100] show that there exists correlation between the sequences of selected invariants and the sequence of execution times of the well-known TSP Solver Concorde. In this paper we extend these considerations for instances up to 100 vertices.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"24 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85300320","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, a descent line search scheme is proposed to find a local minimum point of a non-convex optimization problem with simple constraints. The idea ensures that the scheme escapes the saddle points and finally settles for a local minimum point of the non-convex optimization problem. A positive definite scaling matrix for the proposed scheme is formed through symmetric indefinite matrix factorization of the Hessian matrix of the objective function at each iteration. A numerical illustration is provided, and the global convergence of the scheme is also justified.
{"title":"Modified projected Newton scheme for non-convex function with simple constraints","authors":"Suvra Chakraborty Kanti, G. Panda","doi":"10.2298/YJOR200515002C","DOIUrl":"https://doi.org/10.2298/YJOR200515002C","url":null,"abstract":"In this paper, a descent line search scheme is proposed to find a local minimum point of a non-convex optimization problem with simple constraints. The idea ensures that the scheme escapes the saddle points and finally settles for a local minimum point of the non-convex optimization problem. A positive definite scaling matrix for the proposed scheme is formed through symmetric indefinite matrix factorization of the Hessian matrix of the objective function at each iteration. A numerical illustration is provided, and the global convergence of the scheme is also justified.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"22 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73636457","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
扫码关注我们
求助内容：
应助结果提醒方式：