On the Uniform Duality in Copositive Optimization

Abstract

AbstractIn this paper, we establish new necessary and sufficient conditions guaranteeing the uniform LP duality for linear problems of Copositive Programming and formulate these conditions in different equivalent forms. The main results are obtained using the approach developed in previous papers of the authors and based on a concept of immobile indices that permits alternative representations of the set of feasible solutions.