This paper investigates the relationship between bank ownership and efficiency before and after the COVID-19 pandemic in a sample of 20 Croatian commercial banks in the period from 2015 to 2020. The interconnection between these variables is examined with the use of a dynamic data envelopment analysis (window DEA) framework. Other goals are to measure the relative efficiency of Croatian banks in the observed period as well as the evolvement of the banking sector as a whole. The findings reveal that domestic banks outperform by little foreign-owned Croatian banks during the COVID-19 crisis year 2020, but, moreover, domestic and small-sized banks have experienced the least negative impact of COVID-19 in 2020. The results regarding the impact of bank size on bank efficiency are inconsistent and require additional study. The used methodology and the findings of this empirical research could be of interest to academic members, bank management and policymakers. The latter should be especially interested in the results and the resilience of domestic and foreign banks to external shocks, in order to re-examine their current bank policies and the national attitude towards attracting foreign capital in the banking sector.
{"title":"Does ownership structure affect bank performance in the COVID-19 pandemic period? Evidence from Croatia","authors":"Katerina Fotova-Cikovic, Damira Keček, J. Lozić","doi":"10.2298/yjor220615018f","DOIUrl":"https://doi.org/10.2298/yjor220615018f","url":null,"abstract":"This paper investigates the relationship between bank ownership and efficiency before and after the COVID-19 pandemic in a sample of 20 Croatian commercial banks in the period from 2015 to 2020. The interconnection between these variables is examined with the use of a dynamic data envelopment analysis (window DEA) framework. Other goals are to measure the relative efficiency of Croatian banks in the observed period as well as the evolvement of the banking sector as a whole. The findings reveal that domestic banks outperform by little foreign-owned Croatian banks during the COVID-19 crisis year 2020, but, moreover, domestic and small-sized banks have experienced the least negative impact of COVID-19 in 2020. The results regarding the impact of bank size on bank efficiency are inconsistent and require additional study. The used methodology and the findings of this empirical research could be of interest to academic members, bank management and policymakers. The latter should be especially interested in the results and the resilience of domestic and foreign banks to external shocks, in order to re-examine their current bank policies and the national attitude towards attracting foreign capital in the banking sector.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"5 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87597779","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 fixed point problem of piecewise constant mappings in Rn is investigated. This is a polyhedral complementarity problem, which is a generalization of the linear complementarity problem. Such mappings arose in the author?s research on the problem of economic equilibrium in exchange models, where mappings were considered on the price simplex. The author proposed an original approach of polyhedral complementarity, which made it possible to obtain simple algorithms for solving the problem. The present study is a generalization of linear complementarity methods to related problems of a more general nature and reveals a close relationship between linear complementarity and polyhedral complementarity. The investigated method is an analogue of the well-known Lemke method for linear complementarity problems. A class of mappings is described for which the process is monotone, as it is for the linear complementarity problems with positive principal minors of the constraint matrix (class P). It is shown that such a mapping has always unique fixed point.
{"title":"Polyhedral complementarity problem with quasimonotone decreasing mappings","authors":"V. Shmyrev","doi":"10.2298/yjor2111016031s","DOIUrl":"https://doi.org/10.2298/yjor2111016031s","url":null,"abstract":"The fixed point problem of piecewise constant mappings in Rn is investigated. This is a polyhedral complementarity problem, which is a generalization of the linear complementarity problem. Such mappings arose in the author?s research on the problem of economic equilibrium in exchange models, where mappings were considered on the price simplex. The author proposed an original approach of polyhedral complementarity, which made it possible to obtain simple algorithms for solving the problem. The present study is a generalization of linear complementarity methods to related problems of a more general nature and reveals a close relationship between linear complementarity and polyhedral complementarity. The investigated method is an analogue of the well-known Lemke method for linear complementarity problems. A class of mappings is described for which the process is monotone, as it is for the linear complementarity problems with positive principal minors of the constraint matrix (class P). It is shown that such a mapping has always unique fixed point.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"107 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76422157","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}
Classical combinatorial optimization concerns finding a feasible subset of a ground set in order to optimize an objective function. We address in this article the inverse optimization problem with the k-max function. In other words, we attempt to perturb the weights of elements in the ground set at minimum total cost to make a predetermined subset optimal in the fashion of the k-max objective with respect to the perturbed weights. We first show that the problem is in general NP-hard. Regarding the case of independent feasible subsets, a combinatorial O(n2 log n) time algorithm is developed, where n is the number of elements in E. Special cases with improved complexity are also discussed.
{"title":"The inverse k-max combinatorial optimization problem","authors":"T. Nhan, K. Nguyen, Nguyen Hung, N. Toan","doi":"10.2298/yjor220516037n","DOIUrl":"https://doi.org/10.2298/yjor220516037n","url":null,"abstract":"Classical combinatorial optimization concerns finding a feasible subset of a ground set in order to optimize an objective function. We address in this article the inverse optimization problem with the k-max function. In other words, we attempt to perturb the weights of elements in the ground set at minimum total cost to make a predetermined subset optimal in the fashion of the k-max objective with respect to the perturbed weights. We first show that the problem is in general NP-hard. Regarding the case of independent feasible subsets, a combinatorial O(n2 log n) time algorithm is developed, where n is the number of elements in E. Special cases with improved complexity are also discussed.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"20 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79595352","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 green vehicle routing problem (GVRP) is a relatively new topic, which aims to minimize greenhouse gasses (GHG) emissions produced by a fleet of vehicles. Both internal combustion vehicles (ICV) and alternative fuel vehicles (AFV) are considered, dividing GVRP into two separate subclasses: ICV-based GVRP and AFV-based GVRP. In the ICV-based subclass, the environmental aspect comes from the objective function which aims to minimize GHG emissions or fuel usage of ICVs. On the other hand, the environmental aspect of AFV-based GVRP is implicit and comes from using AFVs in transport. Since GVRP is NP-hard, finding the exact solution in a reasonable amount of time is often impossible for larger instances, which is why metaheuristic approaches are predominantly used. The purpose of this study is to detect gaps in the literature and present suggestions for future research in the field. For that purpose, we review recent papers in which GVRP was tackled by some metaheuristic methods and describe algorithm specifics, VRP attributes, and objectives used in them.
{"title":"Metaheuristic approaches for the green vehicle routing problem","authors":"Luka Matijević","doi":"10.2298/yjor211120016m","DOIUrl":"https://doi.org/10.2298/yjor211120016m","url":null,"abstract":"The green vehicle routing problem (GVRP) is a relatively new topic, which aims to minimize greenhouse gasses (GHG) emissions produced by a fleet of vehicles. Both internal combustion vehicles (ICV) and alternative fuel vehicles (AFV) are considered, dividing GVRP into two separate subclasses: ICV-based GVRP and AFV-based GVRP. In the ICV-based subclass, the environmental aspect comes from the objective function which aims to minimize GHG emissions or fuel usage of ICVs. On the other hand, the environmental aspect of AFV-based GVRP is implicit and comes from using AFVs in transport. Since GVRP is NP-hard, finding the exact solution in a reasonable amount of time is often impossible for larger instances, which is why metaheuristic approaches are predominantly used. The purpose of this study is to detect gaps in the literature and present suggestions for future research in the field. For that purpose, we review recent papers in which GVRP was tackled by some metaheuristic methods and describe algorithm specifics, VRP attributes, and objectives used in them.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"3 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89114120","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}
Preety Poswal, A. Chauhan, Y. Rajoria, R. Boadh, Abhinav Goel
In this paper, a fuzzy inventory model with a Weibull deterioration rate, a quadratic demand rate, and a variable holding cost under permissible shortages has been developed. The deterioration rate is expressed by a two-parameter Weibull distribution. During a shortage, some buyers wait for the actual product, while others do not. This shortfall is considered partially backlogged in this model. Some buyers wait for the actual product during such shortages, but many do not. Therefore, partially backlogged shortages are taken into account in this approach. In a traditional inventory model, all parameters such as purchasing cost, shortage cost, holding cost, etc. are predetermined. However, there will be some variations. As a result, fuzzy factors are more accurate to deal with the real world?s problems. This research attempts to cut down the cost in a fuzzy environment by using quadratic demand, shortage, Weibull deterioration rate, and variable holding cost. Costs such as ordering, shortage, and deterioration are addressed as pentagonal fuzzy numbers that are defuzzified using a graded mean representation approach. Finally, sensitivity analysis was carried out to investigate the influence of cost parameters on total inventory cost. A numerical example is used to validate the proposed model in a real-world system.
{"title":"Fuzzy optimization model of two parameter Weibull deteriorating rate with quadratic demand and variable holding cost under allowable shortages","authors":"Preety Poswal, A. Chauhan, Y. Rajoria, R. Boadh, Abhinav Goel","doi":"10.2298/yjor220115021p","DOIUrl":"https://doi.org/10.2298/yjor220115021p","url":null,"abstract":"In this paper, a fuzzy inventory model with a Weibull deterioration rate, a quadratic demand rate, and a variable holding cost under permissible shortages has been developed. The deterioration rate is expressed by a two-parameter Weibull distribution. During a shortage, some buyers wait for the actual product, while others do not. This shortfall is considered partially backlogged in this model. Some buyers wait for the actual product during such shortages, but many do not. Therefore, partially backlogged shortages are taken into account in this approach. In a traditional inventory model, all parameters such as purchasing cost, shortage cost, holding cost, etc. are predetermined. However, there will be some variations. As a result, fuzzy factors are more accurate to deal with the real world?s problems. This research attempts to cut down the cost in a fuzzy environment by using quadratic demand, shortage, Weibull deterioration rate, and variable holding cost. Costs such as ordering, shortage, and deterioration are addressed as pentagonal fuzzy numbers that are defuzzified using a graded mean representation approach. Finally, sensitivity analysis was carried out to investigate the influence of cost parameters on total inventory cost. A numerical example is used to validate the proposed model in a real-world system.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"186 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86497791","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 consider a nonlinear semidefinite semi-infinite convex multiobjective optimization problem where the feasible region is determined by finite number of equality and infinite number of inequality constraints. We establish saddle point necessary and sufficient optimality conditions under some suitable constraint qualification. We establish Karush-Kuhn-Tucker optimality conditions using the saddle point optimality conditions for the differentiable case and construct some examples to illustrate our results.
{"title":"Saddle point criteria for semidefinite semi-infinite convex multiobjective optimization problems","authors":"Vivek Laha, Rahul Kumar, J. Maurya","doi":"10.2298/yjor201223001l","DOIUrl":"https://doi.org/10.2298/yjor201223001l","url":null,"abstract":"In this paper, we consider a nonlinear semidefinite semi-infinite convex multiobjective optimization problem where the feasible region is determined by finite number of equality and infinite number of inequality constraints. We establish saddle point necessary and sufficient optimality conditions under some suitable constraint qualification. We establish Karush-Kuhn-Tucker optimality conditions using the saddle point optimality conditions for the differentiable case and construct some examples to illustrate our results.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"80 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90280556","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}
S. Sveshnikov, V. Bocharnikov, Anatoly Pavlikovsky, Andrey Prima
Estimation of the potential willingness of the state to use military force is an integral part of the analysis of international relations and the preparation of key decisions in security sphere. Our problem was to develop a method for numerically estimating the potential willingness of any state to use military force. This method should take into account a large number of quantitative and qualitative criteria, the uncertainty of their relationships, as well as the uncertainty of the initial data, some of which can only be obtained with the help of experts. Our analysis has shown that the known methods have a number of serious shortcomings. We proposed to solve this problem based on the representation of partial estimations of states in the form of fuzzy sets, and the importance of criteria in the form of a fuzzy measure. We also proposed to aggregate the partial estimations using the Sugeno fuzzy integral. We developed a hierarchical structure of estimation criteria, determined the importance of the criteria, built an observation channel based on the Harrington curve to obtain input estimations, and also developed an aggregation algorithm. As a result, we calculated estimations for 137 states and examined their potential willingness to use military force. The results disclose new aspects of using fuzzy-integral calculus to construct hierarchical models of multi-criteria estimating, and also demonstrate the possibility of using artificial intelligence methods to obtain numerical estimations in the sphere of international relations.
{"title":"Estimating the potential willingness of the state to use military force based on the Sugeno fuzzy integral","authors":"S. Sveshnikov, V. Bocharnikov, Anatoly Pavlikovsky, Andrey Prima","doi":"10.2298/yjor210515002s","DOIUrl":"https://doi.org/10.2298/yjor210515002s","url":null,"abstract":"Estimation of the potential willingness of the state to use military force is an integral part of the analysis of international relations and the preparation of key decisions in security sphere. Our problem was to develop a method for numerically estimating the potential willingness of any state to use military force. This method should take into account a large number of quantitative and qualitative criteria, the uncertainty of their relationships, as well as the uncertainty of the initial data, some of which can only be obtained with the help of experts. Our analysis has shown that the known methods have a number of serious shortcomings. We proposed to solve this problem based on the representation of partial estimations of states in the form of fuzzy sets, and the importance of criteria in the form of a fuzzy measure. We also proposed to aggregate the partial estimations using the Sugeno fuzzy integral. We developed a hierarchical structure of estimation criteria, determined the importance of the criteria, built an observation channel based on the Harrington curve to obtain input estimations, and also developed an aggregation algorithm. As a result, we calculated estimations for 137 states and examined their potential willingness to use military force. The results disclose new aspects of using fuzzy-integral calculus to construct hierarchical models of multi-criteria estimating, and also demonstrate the possibility of using artificial intelligence methods to obtain numerical estimations in the sphere of international relations.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"89 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91115340","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}
Uncertainty is an inherent characteristic of a decision-making process. Occasionally, historical data may be insufficient to accurately estimate the probability distribution suitable for an unknown variable. In these situations, we deal with fuzzy stochastic variables in solving a problem. As a result, decision-makers, particularly those in the military, are confronted with numerous issues. This article discusses the maximum network flow interdiction under fuzzy stochastic hybrid conditions. The capacity of arcs has been treated as a fuzzy stochastic variable in this problem. The primary objective of this paper is to propose a model to the decision-maker that can be used to manage unknown factors in the network. Since this topic is explored concurrently in a stochastic and fuzzy environment, it is impossible to solve it directly. Consequently, three probability-possibility, probability-necessity, and probability-credibility techniques are utilized to transform it into a deterministic state. Eventually, the proposed model?s efficacy is demonstrated by presenting a numerical example.
{"title":"A maximum flow network interdiction model in fuzzy stochastic hybrid uncertainty environments","authors":"S. Bavandi, H. Bigdeli","doi":"10.2298/yjor220415038b","DOIUrl":"https://doi.org/10.2298/yjor220415038b","url":null,"abstract":"Uncertainty is an inherent characteristic of a decision-making process. Occasionally, historical data may be insufficient to accurately estimate the probability distribution suitable for an unknown variable. In these situations, we deal with fuzzy stochastic variables in solving a problem. As a result, decision-makers, particularly those in the military, are confronted with numerous issues. This article discusses the maximum network flow interdiction under fuzzy stochastic hybrid conditions. The capacity of arcs has been treated as a fuzzy stochastic variable in this problem. The primary objective of this paper is to propose a model to the decision-maker that can be used to manage unknown factors in the network. Since this topic is explored concurrently in a stochastic and fuzzy environment, it is impossible to solve it directly. Consequently, three probability-possibility, probability-necessity, and probability-credibility techniques are utilized to transform it into a deterministic state. Eventually, the proposed model?s efficacy is demonstrated by presenting a numerical example.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"3 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79456812","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}
Shakuntla Singla, U. Modibbo, M. Mijinyawa, Subhash Malik, Shubham Verma, Pooja Khurana
Obtaining system availability in an engineering design is trickish and challenging, especially when there is a reduction in capacity; however, it supports system maintainability. In this paper, a mathematical model for finding the availability under the reduced capacity has been proposed using the Chapman Kolmogorov approach with the help of transition diagrams associated with various possible combinations of probabilities. The paper observes the most critical subsystem by selecting variable failure and repair rates from different subsystems. It deals with the sensitivity analysis of a complex repairable threshing combined machine comprising subsystems in a series configuration and the threshing machine consisting of 21 subsystems. The device works in total capacity when the threshing drum and feeding Hooper work in the complete state, and the concave subsystem and blower work with reduced power. This study dealt with uncertain data and was analyzed analytically using a complex repairable system. The availability of the entire machine has been investigated analytically, and various availability indices such as subsystems extruder have been computed and reported. The study discovered that subsystem extruder has the most impact on some subsystems? overall system availability.
{"title":"Mathematical model for analysing availability of threshing combine machine under reduced capacity","authors":"Shakuntla Singla, U. Modibbo, M. Mijinyawa, Subhash Malik, Shubham Verma, Pooja Khurana","doi":"10.2298/yjor220315019s","DOIUrl":"https://doi.org/10.2298/yjor220315019s","url":null,"abstract":"Obtaining system availability in an engineering design is trickish and challenging, especially when there is a reduction in capacity; however, it supports system maintainability. In this paper, a mathematical model for finding the availability under the reduced capacity has been proposed using the Chapman Kolmogorov approach with the help of transition diagrams associated with various possible combinations of probabilities. The paper observes the most critical subsystem by selecting variable failure and repair rates from different subsystems. It deals with the sensitivity analysis of a complex repairable threshing combined machine comprising subsystems in a series configuration and the threshing machine consisting of 21 subsystems. The device works in total capacity when the threshing drum and feeding Hooper work in the complete state, and the concave subsystem and blower work with reduced power. This study dealt with uncertain data and was analyzed analytically using a complex repairable system. The availability of the entire machine has been investigated analytically, and various availability indices such as subsystems extruder have been computed and reported. The study discovered that subsystem extruder has the most impact on some subsystems? overall system availability.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74877069","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 obtain a converse duality theorem for higher order Wolfe type multiobjective programming with cone constraints under appropriate assumptions. This fills some gaps in the work of Kim et al. [Kim, D.S., Kang, H.S., Lee, Y.J., Seo, Y.Y., Higher order duality in multiobjective programming with cone constraints, Optimization, 59(1), 29-43, (2010)].
本文在适当的假设条件下，得到了具有锥约束的高阶Wolfe型多目标规划的一个逆对偶定理。这填补了Kim等人工作中的一些空白[Kim, D.S s, Kang, H.S, Lee, yjj, Seo, yyy .，锥约束下多目标规划的高阶对偶性，优化，59(1)，29-43，(2010)]。
{"title":"Modified converse duality for multiobjective higher order Wolfe type dual program with cone constraints","authors":"Sonali Sethi, N. Kailey, Shivani Saini","doi":"10.2298/yjor210915014s","DOIUrl":"https://doi.org/10.2298/yjor210915014s","url":null,"abstract":"In this paper, we obtain a converse duality theorem for higher order Wolfe type multiobjective programming with cone constraints under appropriate assumptions. This fills some gaps in the work of Kim et al. [Kim, D.S., Kang, H.S., Lee, Y.J., Seo, Y.Y., Higher order duality in multiobjective programming with cone constraints, Optimization, 59(1), 29-43, (2010)].","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73197096","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
扫码关注我们
求助内容：
应助结果提醒方式：