论文标题
线性共同编程问题的强二元性
Strong duality for a problem of linear copositive programming
论文作者
论文摘要
该论文致力于研究强度二元性，以解决线性共同编程的问题。 基于最近引入的一组归一化固定指数的概念，推导了扩展的双重问题。双重问题满足了牢固的二元关系，并且不需要任何其他规律性假设，例如约束资格。与先前获得的结果的主要区别在于一个事实，即现在扩展的双重问题既不使用固定索引本身也不使用有关这些指数凸壳的明确信息。 本文中提出的强二元公式具有与Ramana，L。Tuncel和H. Wolkovicz的作品中所提出的相似的结构和特性，用于半决赛编程，但使用不同的技术获得。
The paper is dedicated to the study of strong duality for a problem of linear copositive programming. Based on the recently introduced concept of the set of normalized immobile indices, an extended dual problem is deduced. The dual problem satisfies the strong duality relations and does not require any additional regularity assumptions such as constraint qualifications. The main difference with the previously obtained results consists in the fact that now the extended dual problem uses neither the immobile indices themselves nor the explicit information about the convex hull of these indices. The strong duality formulations presented in the paper have similar structure and properties as that proposed in the works of M. Ramana, L. Tuncel, and H. Wolkovicz, for semidefinite programming, but are obtained using different techniques.
