Vector processing in simplex and interior methods for linear programming

1990 ◽  
Vol 22 (1) ◽  
pp. 71-100 ◽  
Author(s):  
J. J. H. Forrest ◽  
J. A. Tomlin
1991 ◽  
Vol 38 (3) ◽  
pp. 269-281 ◽  
Author(s):  
M.A. Baddourah ◽  
D.T. Nguyen

Acta Numerica ◽  
1992 ◽  
Vol 1 ◽  
pp. 341-407 ◽  
Author(s):  
Margaret H. Wright

Interior methods for optimization were widely used in the 1960s, primarily in the form of barrier methods. However, they were not seriously applied to linear programming because of the dominance of the simplex method. Barrier methods fell from favour during the 1970s for a variety of reasons, including their apparent inefficiency compared with the best available alternatives. In 1984, Karmarkar's announcement of a fast polynomial-time interior method for linear programming caused tremendous excitement in the field of optimization. A formal connection can be shown between his method and classical barrier methods, which have consequently undergone a renaissance in interest and popularity. Most papers published since 1984 have concentrated on issues of computational complexity in interior methods for linear programming. During the same period, implementations of interior methods have displayed great efficiency in solving many large linear programs of ever-increasing size. Interior methods have also been applied with notable success to nonlinear and combinatorial problems. This paper presents a self-contained survey of major themes in both classical material and recent developments related to the theory and practice of interior methods.


1997 ◽  
Vol 48 (7) ◽  
pp. 757-758
Author(s):  
B Kolman ◽  
R E Beck ◽  
M J Panik
Keyword(s):  

1985 ◽  
Vol 132 (3) ◽  
pp. 123 ◽  
Author(s):  
B.C. Clewer ◽  
M.R. Irving ◽  
M.J.H. Sterling

Sign in / Sign up

Export Citation Format

Share Document