Separated Continuous Conic Programming: Strong Duality and an Approximation Algorithm

Motivated by recent applications in robust optimization and in sign-constrained linear-quadratic control, we study in this paper a new class of optimization problems called separated continuous conic programming (SCCP). Focusing on a symmetric primal-dual pair, we develop a strong duality theory for the SCCP. Our idea is to use discretization to connect the SCCP and its dual to two ordinary conic programs. We show if the latter are strongly feasible and with finite optimal values, a condition that is readily verifiable, then the strong duality holds for the SCCP. This approach also leads to a polynomial-time approximation algorithm that solves the SCCP to any required accuracy.

[1]  Andy Philpott,et al.  On the Solutions of a Class of Continuous Linear Programs , 1994 .

[2]  E. Anderson A new continuous model for job-shop scheduling , 1981 .

[3]  D. Bertsimas,et al.  A New Algorithm for State-Constrained Separated Continuous Linear Programs , 1999 .

[4]  Gideon Weiss,et al.  Stability and Instability of Fluid Models for Reentrant Lines , 1996, Math. Oper. Res..

[5]  Xi Chen,et al.  Stochastic Linear-Quadratic Control with Conic Control Constraints on an Infinite Time Horizon , 2004, SIAM J. Control. Optim..

[6]  Arkadi Nemirovski,et al.  Robust Convex Optimization , 1998, Math. Oper. Res..

[7]  David D. Yao,et al.  Fundamentals of Queueing Networks: Performance, Asymptotics, , 2004 .

[8]  M. Pullan Forms of Optimal Solutions for Separated Continuous Linear Programs , 1995 .

[9]  D. Yao,et al.  Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization , 2001, IEEE Transactions on Automatic Control.

[10]  J. Dai On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models , 1995 .

[11]  Malcolm Craig Pullan Convergence of a General Class of Algorithms for Separated Continuous Linear Programs , 2000, SIAM J. Optim..

[12]  Gideon Weiss,et al.  A simplex based algorithm to solve separated continuous linear programs , 2008, Math. Program..

[13]  Malcolm Craig Pullan,et al.  An extended algorithm for separated continuous linear programs , 2002, Math. Program..

[14]  M. Pullan An algorithm for a class of continuous linear programs , 1993 .

[15]  Edward J. Anderson,et al.  A continuous-time network simplex algorithm , 1989, Networks.

[16]  Xun Yu Zhou,et al.  Constrained Stochastic LQ Control with Random Coefficients, and Application to Portfolio Selection , 2005, SIAM J. Control. Optim..

[17]  B. Anderson,et al.  Optimal control: linear quadratic methods , 1990 .

[18]  Sean R Eddy,et al.  What is dynamic programming? , 2004, Nature Biotechnology.

[19]  Lisa Fleischer,et al.  Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions , 2005, Math. Oper. Res..

[20]  E. Anderson,et al.  Some Properties of a Class of Continuous Linear Programs , 1983 .

[21]  Malcolm Craig Pullan,et al.  A Study of General Dynamic Network Programs with Arc Time-Delays , 1997, SIAM J. Optim..

[22]  R Bellman,et al.  Bottleneck Problems and Dynamic Programming. , 1953, Proceedings of the National Academy of Sciences of the United States of America.

[23]  E. Anderson,et al.  Linear programming in infinite-dimensional spaces : theory and applications , 1987 .

[24]  Jos F. Sturm,et al.  A Matlab toolbox for optimization over symmetric cones , 1999 .

[25]  M. Pullan A Duality Theory for Separated Continuous Linear Programs , 1996 .

[26]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[27]  A. Shapiro ON DUALITY THEORY OF CONIC LINEAR PROBLEMS , 2001 .

[28]  M. Pullan,et al.  Linear Optimal Control Problems with Piecewise Analytic Solutions , 1996 .

[29]  David D. Yao,et al.  Theory and algorithms for separated continuous linear programming and its extensions , 2005 .