Convex Semi-Infinite programming: explicit optimality conditions

We consider the convex Semi-In¯nite Programming (SIP) problem where objec- tive function and constraint function are convex w.r.t. a ¯nite-dimensional variable x and all of these functions are su±ciently smooth in their domains. The constraint function depends also on so called time variable t that...

Full description

Bibliographic Details
Main Author: Kostyukova, O. I. (author)
Other Authors: Tchemisova, T. V. (author)
Format: workingPaper
Language:eng
Published: 2012
Subjects:
Semi-infinite programming
Nonlinear programming
The slater condition
Optimality conditions
Online Access:http://hdl.handle.net/10773/6234
Country:Portugal
Oai:oai:ria.ua.pt:10773/6234

Internet

http://hdl.handle.net/10773/6234

Similar Items