Artigo
Algorithms for network piecewise-linear programs: A comparative study
Date
1997-02-16Registration in:
European Journal of Operational Research, v. 97, n. 1, p. 183-199, 1997.
0377-2217
10.1016/S0377-2217(96)00109-9
WOS:A1997WJ29000018
2-s2.0-0031078453
1338008237590056
0000-0002-6544-2964
Author
Universidade Estadual Paulista (Unesp)
Brunel University
Universidade Estadual de Campinas (UNICAMP)
Abstract
Piecewise-Linear Programming (PLP) is an important area of Mathematical Programming and concerns the minimisation of a convex separable piecewise-linear objective function, subject to linear constraints. In this paper a subarea of PLP called Network Piecewise-Linear Programming (NPLP) is explored. The paper presents four specialised algorithms for NPLP: (Strongly Feasible) Primal Simplex, Dual Method, Out-of-Kilter and (Strongly Polynomial) Cost-Scaling and their relative efficiency is studied. A statistically designed experiment is used to perform a computational comparison of the algorithms. The response variable observed in the experiment is the CPU time to solve randomly generated network piecewise-linear problems classified according to problem class (Transportation, Transshipment and Circulation), problem size, extent of capacitation, and number of breakpoints per arc. Results and conclusions on performance of the algorithms are reported.
Related items
Showing items related by title, author, creator and subject.
-
Low cost BIST techniques for linear and non-linear analog circuits
Negreiros, Marcelo -
Comparação de sistemas de formulação lineares e não lineares para frangos de corte
Renz, Sandro Volnei