Optimality conditions for convex Copositive Programming

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).