期刊
MATHEMATICAL PROGRAMMING
卷 90, 期 2, 页码 229-261出版社
SPRINGER-VERLAG
DOI: 10.1007/PL00011423
关键词
sensitivity analysis; interior-point methods; linear programming; semidefinite programming
We analyze perturbations of the right-hand side and the cost parameters in linear programming (LP) and semidefinite programming (SDP). We obtain tight bounds on the perturbations that allow interior-point method:, to recover feasible and near-optimal solutions in a single interior-point iteration. For the unique. nondegenerate solution case in LP, we show that the bounds obtained using interior-point methods compare nicely with the hounds arising from using the optimal basis. We also present explicit bounds for SDP using the Monteiro-Zhang family of search directions and specialize them to the AHO, H..K..M, and NT directions.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据