This thesis studies the problem of extending the concept of γ-active constraints to Convex Semi-Inαnite Programming. To achieve this goal, extensive knowledge of topology, convex analysis, real analysis and optimization is needed. We base ourselves on the deαnition and results shown in previous publications and present two approaches to extend this deαnition to the case of Convex Semi-Inαnite Programming. We also provide a comparison of the two approaches, where we state their limitations and advantages. / Key Words: Semi-Inαnite Programming, Extended Active Constraints, Convex Program-ming, Optimality Conditions.
| Identifer | oai:union.ndltd.org:UDLA-Thesis/oai:ciria.udlap.mx:u-dl-a/tesis/4042037287681 |
| Date | 08 December 2011 |
| Creators | Zetina Villamor, Carlos Armando |
| Contributors | Dr. Maxim Todorov Ivanov, Dr. Andr��s Ramos Ram��rez, Dr. Francisco Guerra V��zquez |
| Publisher | Universidad de las Am��ricas Puebla |
| Source Sets | UDLA-Thesis |
| Language | English |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation, Tesis o Disertaci��n Electr��nica |
| Format | application/pdf, text/html |
| Coverage | Maestr��a |
Page generated in 0.002 seconds