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...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2022
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10773/33974 |
| País: | Portugal |
| Oai: | oai:ria.ua.pt:10773/33974 |