| DC Field | Value | Language |
|---|
| dc.contributor.author | Kostyukova, O. I. | - |
| dc.contributor.author | Tchemisova, T. V. | - |
| dc.date.accessioned | 2018-10-04T08:17:13Z | - |
| dc.date.available | 2018-10-04T08:17:13Z | - |
| dc.date.issued | 2018 | - |
| dc.identifier.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. | ru_RU |
| dc.identifier.uri | https://libeldoc.bsuir.by/handle/123456789/33127 | - |
| dc.description.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. | ru_RU |
| dc.language.iso | en | ru_RU |
| dc.publisher | University of Bordeaux | ru_RU |
| dc.subject | публикации ученых | ru_RU |
| dc.subject | copositive programming | ru_RU |
| dc.subject | constraints qualifications | ru_RU |
| dc.subject | optimality conditions | ru_RU |
| dc.title | On optimality conditions for linear copositive programming | ru_RU |
| dc.type | Статья | ru_RU |
| Appears in Collections: | Публикации в зарубежных изданиях
|
