An Algorithm for a Class of Continuous Linear Programs
Author:
- Malcolm C. PullanMPMalcolm C. Pullan
- 1 November 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 31 (6) , 1558-1577
Abstract
This paper discusses a class of continuous linear programs posed in a function space called separated continuous linear programs (SCLP). A dual linear program and a corresponding discrete approximation are introduced followed by a discussion of their properties. The discrete approximation gives rise to an improvement step which is constructed from any given feasible (nonoptimal) solution for SCLP. A strong duality result follows from this. There are a variety of possible implementations of an algorithm for solving SCLP problems using this improvement step. Finally some computational results are given from one possible implementation.Keywords
This publication has 9 references indexed in Scilit:
- A continuous‐time network simplex algorithmNetworks, 1989
- Some Properties of a Class of Continuous Linear ProgramsSIAM Journal on Control and Optimization, 1983
- A class of infinite dimensional linear programming problemsJournal of Mathematical Analysis and Applications, 1982
- Numerical solutions to continuous linear programming problemsMathematical Methods of Operations Research, 1973
- Continuous programming part one: Linear objectivesJournal of Mathematical Analysis and Applications, 1969
- An Extended Duality Theorem for Continuous Linear Programming ProblemsSIAM Journal on Applied Mathematics, 1967
- A class of continuous linear programming problemsJournal of Mathematical Analysis and Applications, 1966
- A Duality Theorem for a Class of Continuous Linear Programming ProblemsJournal of the Society for Industrial and Applied Mathematics, 1965
- Linear Programming and Extensions1963