Please use this identifier to cite or link to this item:
|Title:||Interior dual proximal point algorithm for linear programs|
Proximal point method
|Citation:||Setiono, R. (1994-08-25). Interior dual proximal point algorithm for linear programs. European Journal of Operational Research 77 (1) : 96-110. ScholarBank@NUS Repository.|
|Abstract:||A new algorithm for solving a linear program based on an interior point method applied to the dual of a proximal point formulation of the linear program is presented. This dual formulation contains only the nonnegativity constraint on some of the variables. This simple constraint allows us to start the algorithm without a Phase 1 method required by many other variants of the interior point method. Numerical results from a large set of test problems show that the proposed algorithm can be very competitive with other interior point methods and with MINOS 5.3, a state-of-the-art linear programming package based on the simplex method. Global convergence of the algorithm is also established. © 1994.|
|Source Title:||European Journal of Operational Research|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 16, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.