RT Journal Article
SR 00
ID 10.1016/0377-2217(93)E0323-P
A1 Gondzio, J.
A1 Makowski, M.
T1 Solving a class of LP problems with primal-dual logarithmic barrier method
JF European Journal of Operational Research
YR 1995
FD 1995
VO 80
IS 1
SP 184
OP 192
K1 Agriculture; Applications; Linear programming; Primal-dual method
AB Applying a higher order primal-dual logarithmic barrier method for solving large real-life linear programming problems is addressed in this paper. The efficiency of an interior point algorithm on these problems is compared with the one of the state-of-the-art simplex code MINOS version 5.3. Based on such experience, a wide class of LP problems is identified for which logarithmic barrier approach seems advantageous over the simplex one. Additionally, some practical rules for model builders are derived that should allow them to create problems that can easily be solved with logarithmic barrier algorithms.
PB Elsevier
SN 0377-2217
LK https://pure.iiasa.ac.at/id/eprint/4280/