Please use this identifier to cite or link to this item:
Title: Optimality conditions for linear copositive programming problems with isolated immobile indices
Author: Kostyukova, O. I.
Tchemisova, T. V.
Keywords: Convex programming
Semi-infinite programming
Copositive programming
Constraint qualifications
Immobile index
Optimality conditions
Strong duality
Issue Date: 15-Nov-2018
Publisher: Taylor & Francis
Abstract: In the present paper, we apply our recent results on optimality for convex semi-infinite programming to a problem of linear copositive programming (LCP). We prove explicit optimality conditions that use concepts of immobile indices and their immobility orders and do not require the Slater constraint qualification to be satisfied. The only assumption that we impose here is that the set of immobile indices consists of isolated points and hence is finite. This assumption is weaker than the Slater condition; therefore, the optimality conditions obtained in the paper are more general when compared with those usually used in LCP. We present an example of a problem in which the new optimality conditions allow one to test the optimality of a given feasible solution while the known optimality conditions fail to do this. Further, we use the immobile indices to construct a pair of regularized dual copositive problems and show that regardless of whether the Slater condition is satisfied or not, the duality gap between the optimal values of these problems is zero. An example of a problem is presented for which the standard strict duality fails, but the duality gap obtained by using the regularized dual problem vanishes.
Peer review: yes
DOI: 10.1080/02331934.2018.1539482
ISSN: 0233-1934
Appears in Collections:DMat - Artigos

Files in This Item:
File Description SizeFormat 
Optimization WGSCO KostTchem19.10.18.pdf112.68 kBAdobe PDFView/Open

Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.