Review on the Research for Separated Continuous Linear Programming: With Applications on Service Operations

We give a review on the research for a class of optimization model—separated continuous linear programming (SCLP). SCLP takes several similar forms and can be used to find the dynamic control of a multiclass fluid network. We review the duality theory and solution methods for it. We also present application examples of SCLP on service operations

Robust Fluid Processing Networks

Fluid models provide a tractable and useful approach in approximating multiclass processing networks. However, they ignore the inherent stochasticity in arrival and service processes. To address this shortcoming, we develop a robust fluid approach to the control of processing networks. We provide insights into the mathematical structure, modeling power, tractability, and performance of the resulting model. Specifically, we show that the robust fluid model preserves the computational tractability of the classical fluid problem and retains its original structure. From the robust fluid model, we derive a (scheduling) policy that regulates how fluid from various classes is processed at the servers of the network. We present simulation results to compare the performance of our policies to several commonly used traditional methods. The results demonstrate that our robust fluid policies are near-optimal (when the optimal can be computed) and outperform policies obtained directly from the fluid model and heuristic alternatives (when it is computationally intractable to compute the optimal).National Science Foundation (U.S.) (Grant CNS-1239021)National Science Foundation (U.S.) (Grant IIS-1237022)United States. Army Research Office (Grant W911NF-11-1-0227)United States. Army Research Office (Grant W911NF-12-1-0390)United States. Office of Naval Research (Grant N00014-10-1-0952

Polynomial Approximations for Infinite-Dimensional Optimization Problems

Many real-life decision problems in management science and engineering involve decisions that are functions of time and/or uncertainty. The resulting optimization models are therefore naturally formulated on infinite-dimensional function spaces. However, such infinite-dimensional optimization problems are notoriously difficult, and to solve them one usually has to resort to approximation methods. The objective of this thesis is to devise polynomial approximations for solving continuous linear programs and multi-stage stochastic programs, both of which constitute important classes of infinite-dimensional optimization problems with manifold practical applications. Approximating the functional decision variables by polynomials allows us to apply sum-of-squares techniques from algebraic geometry to reformulate the resulting problems as tractable semidefinite programs, which can be solved efficiently with interior point algorithms. Continuous linear programs represent deterministic optimization problems whose decision variables are functions of time subject to pointwise and dynamic linear constraints. They have attracted considerable interest due to their potential for modelling manufacturing, scheduling and routing problems. While efficient simplex-type algorithms have been developed for separated continuous linear programs, crude time discretization remains the method of choice for solving general (non-separated) problem instances. In this thesis we propose a more generic approximation scheme for non-separated continuous linear programs, which are believed to be NP-hard. We approximate the functional decision variables (policies) by polynomial and piecewise polynomial decision rules. To estimate the approximation error, we also compute a lower bound by solving a dual continuous linear program in (piecewise) polynomial decision rules. Multi-stage stochastic programming provides a versatile framework for optimal decision making under uncertainty, but it gives rise to hard functional optimization problems since the adaptive recourse decisions must be modelled as functions of some or all uncertain parameters. We propose to approximate these recourse decisions by polynomial decision rules and show that the best polynomial decision rule of a fixed degree can be computed efficiently. Again, we show that the suboptimality of the best polynomial decision rule can be estimated efficiently by solving a dual version of the stochastic program in polynomial decision rules. Recent progress in the theory of dynamic risk measures has found a strong echo in stochastic programming, where the time-consistency of dynamic decision making under uncertainty is currently under scrutiny. We extend the concepts of coherence and time consistency to stochastic programming models subject to distributional ambiguity, which motivates us to introduce robust dynamic risk measures. We discuss conditions under which these robust risk measures inherit coherence and time-consistency from their nominal counterparts. We also propose an approximation scheme based on polynomial decision rules for solving linear multi-stage stochastic programs involving robust dynamic risk measures