The LP-Newton method for standard form linear programming problems

Tomonari Kitahara, Shinji Mizuno, Jianming Shi

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

Abstract

Fujishige et al. propose the LP-Newton method, a new algorithm for solving linear programming problems (LPs). They address LPs which have a lower and an upper bound for each variable. They reformulate the problem by introducing a related zonotope. Their algorithm solves the problem by repeating projections to the zonotope. In this paper, we develop the LP-Newton method for solving standard form LPs. We recast the LP by introducing a related convex cone. Our algorithm solves the problem by iterating projections to the convex cone.

Original languageEnglish
Pages (from-to)426-429
Number of pages4
JournalOperations Research Letters
Volume41
Issue number5
DOIs
Publication statusPublished - 2013
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'The LP-Newton method for standard form linear programming problems'. Together they form a unique fingerprint.

Cite this