Equivalent Reformulations of Generalized Semi-infinite Min-Max Programming

Jinchuan Zhou, Mei-xia Li, Wenling Zhao, Xiuhua Xu
{"title":"Equivalent Reformulations of Generalized Semi-infinite Min-Max Programming","authors":"Jinchuan Zhou, Mei-xia Li, Wenling Zhao, Xiuhua Xu","doi":"10.1109/CCCM.2008.196","DOIUrl":null,"url":null,"abstract":"New equivalent reformulations of generalized semi-infinite min-max programming (GSMMP) is derived by addressing the perturbed problem of the lower-level programming. Based on these, we obtain an exact penalty representations for the lower-level programming, which allows us to convert (GSSMP) into the standard semi-infinite programming problems (SMMP) via a class of exact penalty functions, including not only the function used in [9] but also some smooth exact penalty functions as special cases.This fact makes it possible to solve (GSMMP) by using any available standard semi-infinite optimization algorithms.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCCM.2008.196","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

New equivalent reformulations of generalized semi-infinite min-max programming (GSMMP) is derived by addressing the perturbed problem of the lower-level programming. Based on these, we obtain an exact penalty representations for the lower-level programming, which allows us to convert (GSSMP) into the standard semi-infinite programming problems (SMMP) via a class of exact penalty functions, including not only the function used in [9] but also some smooth exact penalty functions as special cases.This fact makes it possible to solve (GSMMP) by using any available standard semi-infinite optimization algorithms.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
广义半无限最小最大规划的等价重表述
通过求解底层规划的摄动问题,导出了广义半无限最小最大规划的新的等价重表述。在此基础上,我们得到了低级规划的精确惩罚表示,这使得我们可以通过一类精确惩罚函数将(GSSMP)转化为标准的半无限规划问题(SMMP),这些精确惩罚函数不仅包括[9]中使用的函数,还包括一些光滑的精确惩罚函数作为特例。这一事实使得使用任何可用的标准半无限优化算法求解(GSMMP)成为可能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Design and Analyze the Model of the Management System Based on Active Network Dynamic Test and Evaluating System for Flight Control System Analyzing the Impact of Organizational Constraints on Performance of E-Business: A Research Perspective D-Stable H8 Fault-Tolerant Control for Delta Operator Systems with Actuator Failure The Logistic Management for E-Commerce
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1