Forms of Optimal Solutions for Separated Continuous Linear Programs

Authors:
Malcolm C. Pullan
Affiliations:
-
Venue:
SIAM Journal on Control and Optimization
Year:
1995

Citing 0
Cited 4

Approximately optimal control of fluid networks

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions

Mathematics of Operations Research
Minimizing makespan in a multiclass fluid network with parameter uncertainty

Probability in the Engineering and Informational Sciences
Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses the nature of optimal solutions for a class of continuous linear programs called separated continuous linear Programs. It is shown that under various different assumptions on the problem data there exist optimal solutions that are piecewise constant, piecewise polynomial, or, more generally, piecewise analytic. These results are reminiscent of bang-bang results in linear optimal control.