Enviar artigo por via de e-mail A Variant of the Dual Simplex Method for a Linear Semidefinite Programming Problem
- Autores: Zhadan V.G.1
-
Afiliações:
- Dorodnitsyn Computing Center of the Russian Academy of Sciences
- Edição: Volume 299, Nº Suppl 1 (2017)
- Páginas: 246-256
- Seção: Article
- URL: https://journals.rcsi.science/0081-5438/article/view/175383
- DOI: https://doi.org/10.1134/S0081543817090267
- ID: 175383
Citar
Acesso aberto
Acesso está concedido
Somente assinantes
Resumo
A linear semidefinite programming problem in the standard statement is considered, and a variant of the dual simplex method is proposed for its solution. This variant generalizes the corresponding method used for linear programming problems. The transfer from an extreme point of the feasible set to another extreme point is described. The convergence of the method is proved.
Sobre autores
V. Zhadan
Dorodnitsyn Computing Center of the Russian Academy of Sciences
Autor responsável pela correspondência
Email: zhadan@ccas.ru
Rússia, Moscow, 119333
Arquivos suplementares
