发布求助
文献互助 智能选刊 最新文献

Yugoslav Journal of Operations Research最新文献

筛选
英文 中文
A new type of difference I-convergent sequence in IFnNS IFnNS中一类新的差分i收敛序列
Yugoslav Journal of Operations Research Pub Date : 2021-01-01 DOI: 10.2298/yjor210318022k
A. Khan, Izhar Ali, M. Ahmad
{"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":null,"pages":null},"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}
引用次数: 1
Optimal decisions on software release and post-release testing: A unified approach 软件发布和发布后测试的最佳决策:统一的方法
Yugoslav Journal of Operations Research Pub Date : 2021-01-01 DOI: 10.2298/YJOR200218001K
Vivek Kumar, Saurabh Panwar, P. K. Kapur, Ompal Singh
{"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":null,"pages":null},"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}
引用次数: 3
Sufficiency and duality of set-valued fractional programming problems via second-order contingent epiderivative 二阶偶然表皮下集值分式规划问题的充分性和对偶性
Yugoslav Journal of Operations Research Pub Date : 2021-01-01 DOI: 10.2298/yjor210218019d
K. Das
{"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":null,"pages":null},"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}
引用次数: 1
Set-valued optimization problems via second-order contingent epiderivative 二阶偶然表皮的集值优化问题
Yugoslav Journal of Operations Research Pub Date : 2021-01-01 DOI: 10.2298/yjor191215041d
K. Das, C. Nahak
{"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":null,"pages":null},"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}
引用次数: 5
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) 关于基于Mordukhovich次微分的数据不确定性多目标半无限规划的最优性条件和对偶性的勘误(南斯拉夫运筹学杂志，vol. 31, no . 4, doi: https://doi.org/10.2298/YJOR201017013P)
Yugoslav Journal of Operations Research Pub Date : 2021-01-01 DOI: 10.2298/yjor211117025e
E. Editoral
{"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":null,"pages":null},"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}
引用次数: 0
Branch and bound algorithm for solving the total weighted tardiness criterion for the permutation flowshop scheduling problem with time lags 求解时滞置换流水调度问题总加权延迟准则的分支定界算法
Yugoslav Journal of Operations Research Pub Date : 2021-01-01 DOI: 10.2298/yjor210615023a
F. Almathkour, Omar Belgacem, Said Toumi, B. Jarboui
{"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":null,"pages":null},"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}
引用次数: 1
Higher order symmetric duality for multiobjective fractional programming problems over cones 锥上多目标分式规划问题的高阶对称对偶性
Yugoslav Journal of Operations Research Pub Date : 2021-01-01 DOI: 10.2298/YJOR200615012K
Arshpreet Kaur, M. Sharma
{"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":null,"pages":null},"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}
引用次数: 2
An inventory routing problem for deteriorating items with dynamic demand and spoilage rate 具有动态需求和腐败率的变质物品库存路径问题
Yugoslav Journal of Operations Research Pub Date : 2021-01-01 DOI: 10.2298/YJOR200516037W
Gede Widyadana Agus, Krisna Wahyudi, N. Sutapa
{"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":null,"pages":null},"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}
引用次数: 0
Complexity indices for the traveling salesman problem continued 旅行商问题的复杂性指数继续存在
Yugoslav Journal of Operations Research Pub Date : 2021-01-01 DOI: 10.2298/YJOR201121014C
D. Cvetkovic, Zorica Dražić, V. Kovacevic-Vujcic
{"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":null,"pages":null},"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}
引用次数: 0
Modified projected Newton scheme for non-convex function with simple constraints 具有简单约束的非凸函数的改进投影牛顿格式
Yugoslav Journal of Operations Research Pub Date : 2021-01-01 DOI: 10.2298/YJOR200515002C
Suvra Chakraborty Kanti, G. Panda
{"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":null,"pages":null},"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}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信