DocumentCode
2714866
Title
Equivalent Reformulations of Generalized Semi-infinite Min-Max Programming
Author
Zhou, Jinchuan ; Li, Meixia ; Zhao, Wenling ; Xu, Xiuhua
Author_Institution
Dept. of Math., Beijing Jiaotong Univ., Beijing
Volume
1
fYear
2008
fDate
3-4 Aug. 2008
Firstpage
754
Lastpage
757
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.
Keywords
minimax techniques; equivalent reformulation; generalized semi infinite min-max programming; lower-level programming problem; penalty function; Books; Communication system control; Entropy; Functional programming; Information science; Mathematical programming; Mathematics; Newton method; Optimal control; Technology management;
fLanguage
English
Publisher
ieee
Conference_Titel
Computing, Communication, Control, and Management, 2008. CCCM '08. ISECS International Colloquium on
Conference_Location
Guangzhou
Print_ISBN
978-0-7695-3290-5
Type
conf
DOI
10.1109/CCCM.2008.196
Filename
4609614
Link To Document