TY  - JOUR
ID  - iiasa4280
UR  - https://pure.iiasa.ac.at/id/eprint/4280/
IS  - 1
A1  - Gondzio, J.
A1  - Makowski, M.
N2  - 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.
VL  - 80
TI  - Solving a class of LP problems with primal-dual logarithmic barrier method
AV  - none
EP  - 192
Y1  - 1995///
PB  - Elsevier
JF  - European Journal of Operational Research
KW  - Agriculture; Applications; Linear programming; Primal-dual method
SN  - 0377-2217
SP  - 184
ER  -