On a variant of the simplex method for a linear semidefinite programming problem

被引：0
|
作者：
Zhadan, V. G.
机构：
来源：
TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN | 2015年 / 21卷 / 03期
关键词：
linear semidefinite programming problem; extreme points; primal simplex-type method;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A linear semidefinite programming problem is considered. A variant of the primal simplex method, which generalizes the corresponding method for linear programming problems, is proposed for this problem. A passage from an extreme point of the admissible set to another extreme point is described.
引用
收藏
页码：117 / 127
页数：11
相关论文
共 50 条
12345