1. Full symmetric duality in continuous linear programming Evgeny ShindinGideon Weiss

2. Introduction  Bellman CLP (1953), economic models  Anderson SCLP (1975), job- shop scheduling  Pullan (1993) non-symmetric dual problem, strong duality, convergent (not finite) algorithm

3. Introduction  Most past approaches (including Pullan) used discrete approximation.  In discrete time CLP and SCLP become LP  (1) LP is large  (2) the solution is only approximate  (3) error bound don’t always known before problem is solved.  (4) problem structure is lost

4. Introduction  Weiss SCLP, symmetric dual, finite algorithm, exact solution  There exist problems which are primal and dual feasible and bounded, but bounded measurable controls do not achieve optimum and strong duality. Infeasible Solution in the space of measures Solution in the space of densities

5. M-CLP: Generalization of SCLP  M-CLP problem and symmetric dual (dual runs in reversed time).  We look for solution ( U,P ) in space of measures. The integrals are Lebeq-Steltjes integrals.  Weiss’ SCLP can be formulated as M-CLP.  Dual of Pullan (which isn’t SCLP) can be formulated as M-CLP.  Weak duality holds between M-CLP and its dual.  Feasibility condition for M-CLP – ordinary LP problem.

6. I-CLP problem  I-CLP problem.  Controls have impulses at 0,T and densities over (0,T). In SCLP we haven’t impulses. In dual of Pullan we haven’t impulses at 0.  I-CLP(T) feasible  M-CLP(T) feasible.  Optimal solution of I-CLP are also optimal for M-CLP.  Strong duality asymptotically holds between I-CLP and it’s dual under Slater type condition.

7. I-CLP: Structure of optimal solution  Controls are piecewise constant, states are piecewise linear and continuous on [0,T) with possible jump at T.  Controls and slopes of states determined by Rates-LP. Impulses, boundary values and interval lengths determined by set of equations. Time partition Bases Interval length

8. I-CLP: Structure of optimal solution  Given an optimal base sequence optimal solution can be found by solving set of equations. The equations determine boundary values as well as time interval lengths.  Optimal base sequence is valid for all time horizons T 1 ≤ T ≤ T 2  Given an optimal time partition optimal solution can be found by solving discrete time LP. But this solution is valid only for specified time horizon T, because time partition is a function of time horizon.  Under non-degeneracy assumption optimal solution of I-CLP is unique. This solution is also unique solution for M-CLP with same time horizon.  Our final goal to find algorithm that can solve I-CLP exactly (in progress).

9. Example