Algorithms for network piecewise-linear programs: A comparative study
Nenhuma Miniatura disponível
Data
1997-02-16
Orientador
Coorientador
Pós-graduação
Curso de graduação
Título da Revista
ISSN da Revista
Título de Volume
Editor
Tipo
Artigo
Direito de acesso
Acesso restrito
Resumo
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.
Descrição
Palavras-chave
Algorithms , Computational analysis , Convex piecewise-linear costs , Experimental design , Network programming , Computational methods , Piecewise linear techniques , Polynomials , Problem solving , Response time (computer systems) , Statistical methods , Network piecewise linear programming , Linear programming
Idioma
Inglês
Como citar
European Journal of Operational Research, v. 97, n. 1, p. 183-199, 1997.