An exact explicit dual for the linear copositive programming problem

Recently, for a linear copositive programming problem, we formulated an exact explicit dual problem in the form of the extended Lagrange-Slater dual. This dual problem is formulated using only the data of the primal copositive problem, satisfies the strong duality relation, and is obtained without a...

Full description

Bibliographic Details
Main Author: Kostyukova, O. I. (author)
Other Authors: Tchemisova, T. V. (author)
Format: article
Language:eng
Published: 2022
Subjects:
Linear Copositive Programming
Strong duality
Normalized immobile index set
Extended dual problem
Constraint qualifications
Online Access:http://hdl.handle.net/10773/33974
Country:Portugal
Oai:oai:ria.ua.pt:10773/33974

Internet

http://hdl.handle.net/10773/33974

Similar Items