{"title":"具有平衡约束的半无限规划的近似混合对偶性","authors":"Tamanna Yadav, S.K. Gupta, Bishal Biswas","doi":"10.1016/j.orl.2025.107324","DOIUrl":null,"url":null,"abstract":"<div><div>This research delves into the study of a multiobjective non-smooth semi-infinite programming problem with equilibrium constraints. Utilizes the locally Lipschitz property of functions, we develop an approximate sufficient optimality result for the semi-infinite program using the approximate <em>M</em>-stationary point. Additionally, we construct an approximate mixed-type dual problem for the considered semi-infinite model and establish approximate duality relations under the generalized convexity assumptions and using the notion of the approximate <em>M</em>-stationary point.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"62 ","pages":"Article 107324"},"PeriodicalIF":0.8000,"publicationDate":"2025-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Approximate mixed type duality for semi-infinite programs having equilibrium constraints\",\"authors\":\"Tamanna Yadav, S.K. Gupta, Bishal Biswas\",\"doi\":\"10.1016/j.orl.2025.107324\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>This research delves into the study of a multiobjective non-smooth semi-infinite programming problem with equilibrium constraints. Utilizes the locally Lipschitz property of functions, we develop an approximate sufficient optimality result for the semi-infinite program using the approximate <em>M</em>-stationary point. Additionally, we construct an approximate mixed-type dual problem for the considered semi-infinite model and establish approximate duality relations under the generalized convexity assumptions and using the notion of the approximate <em>M</em>-stationary point.</div></div>\",\"PeriodicalId\":54682,\"journal\":{\"name\":\"Operations Research Letters\",\"volume\":\"62 \",\"pages\":\"Article 107324\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2025-06-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Operations Research Letters\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0167637725000859\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research Letters","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167637725000859","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
Approximate mixed type duality for semi-infinite programs having equilibrium constraints
This research delves into the study of a multiobjective non-smooth semi-infinite programming problem with equilibrium constraints. Utilizes the locally Lipschitz property of functions, we develop an approximate sufficient optimality result for the semi-infinite program using the approximate M-stationary point. Additionally, we construct an approximate mixed-type dual problem for the considered semi-infinite model and establish approximate duality relations under the generalized convexity assumptions and using the notion of the approximate M-stationary point.
期刊介绍:
Operations Research Letters is committed to the rapid review and fast publication of short articles on all aspects of operations research and analytics. Apart from a limitation to eight journal pages, quality, originality, relevance and clarity are the only criteria for selecting the papers to be published. ORL covers the broad field of optimization, stochastic models and game theory. Specific areas of interest include networks, routing, location, queueing, scheduling, inventory, reliability, and financial engineering. We wish to explore interfaces with other fields such as life sciences and health care, artificial intelligence and machine learning, energy distribution, and computational social sciences and humanities. Our traditional strength is in methodology, including theory, modelling, algorithms and computational studies. We also welcome novel applications and concise literature reviews.