ON SURROGATE DUALITY FOR ROBUST SEMI-INFINITE OPTIMIZATION PROBLEM

Article Sidebar

PDF
Published: Aug 15, 2014
DOI: https://doi.org/10.14403/jcms.2014.27.3.433
Keywords:
quasi-convex objective function, surrogate duality, semiinfinite optimization problem with data uncertainty, constraint qualification
Mathematics Subject Classification (2020):
Primary 90C46, Secondary 90C34

Main Article Content

Gue Myung Lee
Department of Applied Mathematics, Pukyong National University
Jae Hyoung Lee
Department of Applied Mathematics, Pukyong National University

Abstract





A semi-infinite optimization problem involving a quasiconvex objective function and infinitely many convex constraint functions with data uncertainty is considered. A surrogate duality theorem for the semi-infinite optimization problem is given under a closed and convex cone constraint qualification.





This article was migrated from the previous system via automation. The abstract may not be written correctly. Please view the PDF file.




Article Details

Issue
Vol. 27 No. 3 (2014)
Section
Articles