|
Optimality conditions for convex Copositive Programming
O. I. Kostyukovaab, T. V. Tchemisovaba a Mathematical Department, University of Aveiro
b Institute of Mathematics, National Academy of Sciences of Belarus
Abstract:
For convex copositive programming problems, several forms of new optimality conditions are formulated and proved. These conditions are based on a concept of immobile indices and do not require the fulfillment of any additional conditions (constraint qualifications or other).
Received: 15.10.2021
Citation:
O. I. Kostyukova, T. V. Tchemisova, “Optimality conditions for convex Copositive Programming”, Tr. Inst. Mat., 29:1-2 (2021), 165–175
Linking options:
https://www.mathnet.ru/eng/timb353 https://www.mathnet.ru/eng/timb/v29/i1/p165
|
|