Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: Algorithms for network piecewise-linear programs: A comparative study
Author: Marins, FAS
Senne, ELF
DarbyDowman, K
Machado, AF
Perin, C
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 are. Results and conclusions on performance of the algorithms are reported.
Subject: network programming
convex piecewise-linear costs
computational analysis
experimental design
Country: Holanda
Editor: Elsevier Science Bv
Citation: European Journal Of Operational Research. Elsevier Science Bv, v. 97, n. 1, n. 183, n. 199, 1997.
Rights: fechado
Identifier DOI: 10.1016/S0377-2217(96)00109-9
Date Issue: 1997
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOSA1997WJ29000018.pdf1.57 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.