Skip navigation
Please use this identifier to cite or link to this item:
Title: On optimality conditions for linear copositive programming
Authors: Kostyukova, O. I.
Костюкова, О. И.
Tchemisova, T. V.
Keywords: публикации ученых
copositive programming
constraints qualifications
optimality conditions
Issue Date: 2018
Publisher: University of Bordeaux, France
Citation: Kostyukova, O. I. On optimality conditions for linear copositive programming / O. I. Kostyukova, T. V. Tchemisova // 23rd International Symposium on Mathematical Programming, July 1-6, 2018 / University of Bordeaux. – France, 2018. - P.198.
Abstract: A linear problem of Copositive Programming consists in minimization of a linear function subject to linear constraints defined in a conic (infinite) index set. Using the equivalent formulation of the linear copositive problem in the form of a convex Semi-infinite Programming problem and “using” the previously developed approach based on the immobile indices of constraints, we obtain new optimality conditions that do not need any additional conditions for the constraints.
Appears in Collections:Публикации в изданиях других стран

Files in This Item:
File Description SizeFormat 
Kostyukova_On1.pdf111,36 kBAdobe PDFView/Open
Show full item record

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