REOPTIMIZATION PROCEDURES FOR NETWORKS WITH SIDE CONSTRAINTS
- Additional Document Info
- View All
Many large scale planning models require solutions to a series of side constrained network problems. More often than not, these side constrained problems are closely-related in that there have been minor changes in the objective function, constraints and/or bounds. Solving these problems from scratch every time may be prohibitively expensive. Instead, reoptimization procedures can be used which modify an existing basic feasible solution to reflect changes occurred in the problem parameters. This article develops and presents such procedures in a manner appropriate for implementation with a primal partitioning algorithm. A primal partitioning code containing our reoptimization procedures is applied to a set of test problems. The test results indicate that the procedures can be effective in reducing the overall computation time for side constrained network problems. 1991.
COMPUTERS & INDUSTRIAL ENGINEERING
author list (cited authors)
complete list of authors