An extended algorithm for separated continuous linear programs

An extended algorithm for separated continuous linear programs

0.00 Avg rating0 Votes
Article ID: iaor20032523
Country: Germany
Volume: 93
Issue: 3
Start Page Number: 415
End Page Number: 451
Publication Date: Jan 2002
Journal: Mathematical Programming
Authors:
Keywords: networks
Abstract:

Separated continuous linear programs (SCLP) are a class of continuous linear programs which, among other things, can serve as a useful model for dynamic network problems where storage is permitted at the nodes. Recent work on SCLP has produced a detailed duality theory, conditions under which an optimal solution exists with a finite number of breakpoints, a purification algorithm, as well as a convergent algorithm for solving SCLP under certain assumptions on the problem data. This paper combines much of this work to develop a possible approach for solving a wider range of SCLP problems, namely those wih fairly general costs. The techniques required to implement the algorithm are no more than standard (finite-dimensional) linear programming and line searching, and the resulting algorithm is simplex-like in nature. We conclude the paper with the numerical results obtained by using a simple implementation of the algorithm to solve a small problem.

Reviews

Required fields are marked *. Your email address will not be published.