Performance Evaluation and Policy Selection in Multiclass Networks
Discrete Event Dynamic Systems
Approximately optimal control of fluid networks
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
In Search of Sensitivity in Network Optimization
Queueing Systems: Theory and Applications
Mathematics of Operations Research
Fluid analysis of an input control problem
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
During the last few decades, significant progress has been made in solving large-scale finite-dimensional and semi-infinite linear programming problems. In contrast, little progress has been made in solving linear programs in infinite-dimensional spaces despite their importance as models in manufacturing and communication systems. Inspired by the research on separated continuous linear programs, we propose a new class of continuous linear programming problems that has a variety of important applications in communications, manufacturing, and urban traffic control. This class of continuous linear programs contains the separated continuous linear programs as a subclass. Using ideas from quadratic programming, we propose an efficient algorithm for solving large-scale problems in this new class under mild assumptions on the form of the problem data. We prove algorithmically the absence of a duality gap for this class of problems without any boundedness assumptions on the solution set. We show this class of problems admits piecewise constant optimal control when the optimal solution exists. We give conditions for the existence of an optimal solution. We also report computational results which illustrate that the new algorithm is effective in solving large-scale realistic problems (with several hundred continuous variables) arising in manufacturing systems.