A note on generalized semi-infinite program bounding methods

Stuart M. Harwood

REVIEW

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1912.01075 v1 pith:WLT4NPD7 submitted 2019-12-02 math.OC

A note on generalized semi-infinite program bounding methods

Stuart M. Harwood This is my paper

classification math.OC

keywords optimizationsemi-infinitegeneralizedglobalgsipmethodprogramsbounding

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

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.

A note on generalized semi-infinite program bounding methods

discussion (0)