Journal article
On interior algorithms for linear programming with no regularity assumptions
Operations research letters, Vol.11(4), pp.209-212
05/01/1992
DOI: 10.1016/0167-6377(92)90026-Y
Abstract
The linear programming algorithm of Karmarkar (1984), and all interior methods subsequently devised, require a regularity assumption that the primal and/or dual problem possess a nonempty interior. In this note we devise a polynomial-time interior algorithm which will directly ‘process’ and linear program, with no regularity assumptions whatsoever, without the addition of any ‘
M’ terms. Our method is based on the application of a combined phase I–phase II algorithm to a combined primal-dual problem.
Details
- Title: Subtitle
- On interior algorithms for linear programming with no regularity assumptions
- Creators
- Kurt M Anstreicher - University of Iowa
- Resource Type
- Journal article
- Publication Details
- Operations research letters, Vol.11(4), pp.209-212
- Publisher
- Elsevier B.V
- DOI
- 10.1016/0167-6377(92)90026-Y
- ISSN
- 0167-6377
- eISSN
- 1872-7468
- Language
- English
- Date published
- 05/01/1992
- Academic Unit
- Industrial and Systems Engineering; Computer Science; Business Analytics
- Record Identifier
- 9984380505302771
Metrics
4 Record Views