We consider the separated continuous linear programming problem with linear data. We characterize the form of its optimal solution, and present an algorithm which solves it in a finite number of steps, using an analog of the simplex method, in the space of bounded measurable functions.
- Continuous linear programming
- Simplex method
ASJC Scopus subject areas
- General Mathematics