Abstract
Original language  Undefined 

Awarding Institution 

Supervisors/Advisors 

Thesis sponsors  
Award date  28 May 2014 
Place of Publication  Enschede 
Publisher  
Print ISBNs  9789036536721 
DOIs  
Publication status  Published  28 May 2014 
Keywords
 EWI24809
 IR91101
 METIS303647
Cite this
}
Copositive Programming and Related Problems. / Ahmed, F.
Enschede : Universiteit Twente, 2014. 123 p.Research output: Thesis › PhD Thesis  Research UT, graduation UT › Academic
TY  THES
T1  Copositive Programming and Related Problems
AU  Ahmed, F.
PY  2014/5/28
Y1  2014/5/28
N2  Foundation of mathematical optimization relies on the urge to utilize available resources to their optimum. This leads to mathematical programs where an objective function is optimized over a set of constraints. The set of constraints can represent different structures, for example, a polyhedron, a box or a cone. Mathematical programs with cone constraints are called cone programs. A sub area of mathematical optimization is the one where the number of variables isfinite while the number of constraints is infinite, known as semiinfinite programming. In the first section of Chapter 1 we will start with a general introduction into the thesis. In the second section some basic definitions are given which are used throughout the thesis. The third and the fourth section provide a brief review of results on cone programming and semiinfinite programming, respectively. In section five we will briefly discuss cone programming relaxations. In the last section we shall give an overview over results presented in the thesis.
AB  Foundation of mathematical optimization relies on the urge to utilize available resources to their optimum. This leads to mathematical programs where an objective function is optimized over a set of constraints. The set of constraints can represent different structures, for example, a polyhedron, a box or a cone. Mathematical programs with cone constraints are called cone programs. A sub area of mathematical optimization is the one where the number of variables isfinite while the number of constraints is infinite, known as semiinfinite programming. In the first section of Chapter 1 we will start with a general introduction into the thesis. In the second section some basic definitions are given which are used throughout the thesis. The third and the fourth section provide a brief review of results on cone programming and semiinfinite programming, respectively. In section five we will briefly discuss cone programming relaxations. In the last section we shall give an overview over results presented in the thesis.
KW  EWI24809
KW  IR91101
KW  METIS303647
U2  10.3990/1.9789036536721
DO  10.3990/1.9789036536721
M3  PhD Thesis  Research UT, graduation UT
SN  9789036536721
PB  Universiteit Twente
CY  Enschede
ER 