Primal-dual Interior Point Algorithm for Linear Programming

被引：0
|
作者：
Yong, Longquan [1 ]
机构：
[1] Shaanxi Univ Technol, Dept Math, Hanzhong 723001, Peoples R China
来源：
PROCEEDINGS OF FIRST INTERNATIONAL CONFERENCE OF MODELLING AND SIMULATION, VOL II: MATHEMATICAL MODELLING | 2008年
关键词：
Linear programming; Primal-dual interior point algorithm; Polynomial complexity;
D O I：
暂无
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
The linear programming and its importance is well known, over the past decade, an increasing number of studies have focused on this problem. In this paper we present a primal-dual interior point algorithm for linear programming which is based on the Newton direction. We showed that if a strictly feasible starting point is available, then the algorithms have the polynomial complexity. Primary numerical results are reported which demonstrate very good computational performance on linear programming.
引用
收藏
页码：432 / 436
页数：5
相关论文
共 50 条
12345