Explicit optimality conditions for convex semi-infinite programming problems

Explicit optimality conditions for convex semi-infinite programming problems

0.00 Avg rating0 Votes
Article ID: iaor2009682
Country: Belarus
Volume: 52
Issue: 1
Start Page Number: 38
End Page Number: 43
Publication Date: Jan 2008
Journal: Doklady of the National Academy of Sciences of Belarus
Authors: , ,
Keywords: programming (semidefinite)
Abstract:

The article deals with convex Semi-Infinite Programming (SIP) problems. On the basis of the notion of immobile points, new first and second order optimality conditions are obtained. The obtained results are compared with some known optimality conditions for SIP. It is shown that in the case of the convex SIP problem not satisfying the Slater condition the proposed optimality conditions are more efficient.

Reviews

Required fields are marked *. Your email address will not be published.