A note on generalized semi-infinite program bounding methods
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:WLT4NPD7record.jsonopen to challenge →
read the original abstract
Generalized semi-infinite programs (GSIP) are a class of mathematical optimization problems that generalize semi-infinite programs, which have a finite number of decision variables and infinite constraints. Mitsos et al. (Mitsos and Tsoukalas. "Global optimization of generalized semi-infinite programs via restriction of the right hand side." Journal of Global Optimization 61.1 (2015): 1-17.) present a method for global optimization of GSIP. This method involves a lower bounding method, and they claim that these lower bounds converge to the optimal objective value of the GSIP. A counterexample is presented that shows that this claim is false.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.