Journal of Jilin University Science Edition

Previous Articles     Next Articles

WideNeighborhood InteriorPoint Algorithm Based on Modified Newton Direction for Linear Programming

WANG Weiwei1,2, LIU Hongwei1, BI Hongmei3   

  1. 1. School of Mathematics and Statistics, Xidian University, Xi’an 710126, China;2. School of Science, Xi’an Technological University, Xi’an
    710032, China;3. School of Science, Air Force Engineering University, Xi’an 710051, China
  • Received:2013-08-29 Online:2014-05-26 Published:2014-08-27
  • Contact: LIU Hongwei E-mail:hwliu@mail.xidian.edu.cn

Abstract:

Based on modifying the search direction of classic wideneighborhood algorithm, a new wideneighborhood interior point algorithm for linear programming was proposed. The convergence analysis of the new algorithm was presented. And the algorithm enjoys the iteration bound  O(nL), the same as the complexity result for classic wideneighborhood interior point method. The numerical calculation shows that the new algorithm is efficient.

Key words: linear programming, interiorpoint methods, wideneighborhood algorithm, polynomial complexity

CLC Number: 

  • O221.1