Skip to search formSkip to main contentSkip to account menu

Generalized semi-infinite programming

Known as: Gsip 
In mathematics, a semi-infinite programming (SIP) problem is an optimization problem with a finite number of variables and an infinite number of… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Models to compute global horizontal irradiance (GHI) and direct normal irradiance (DNI) have been in development over the last… 
2012
2012
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the… 
2011
2011
The feasible set $M$ in generalized semi-infinite programming (GSIP) need not be closed. Under the so-called symmetric… 
2011
2011
This paper aims to study a broad class of generalized semi-infinite programming problems with (upper and lower level) objectives… 
2010
2010
Models to compute global horizontal irradiance (GHI) and direct normal irradiance (DNI) have been in development over the last… 
2010
2010
A classic idea to improve text compression is to replace words with references to a text dictionary, either external or stored… 
2008
2008
We introduce the Symmetric Reduction Ansatz at a point from the closure of the feasible set in generalized semi-infinite… 
2008
2008
We consider the feasible set of a generalized semi-infinite programming problem with a one-dimensional index set of inequality… 
2005
2005
This paper deals with the class of generalized semi-infinite programming problems (GSIPs) in which the index set of the… 
1999
1999
In this paper, we consider a generalized semi-infinite optimization problem where the index set of the corresponding inequality…