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 language | English |
---|---|
Pages (from-to) | 426-429 |
Number of pages | 4 |
Journal | Operations Research Letters |
Volume | 41 |
Issue number | 5 |
DOIs | |
Publication status | Published - 2013 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Software
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics