Two fundamental classes of problems in large-scale linear and quadratic programming are described. Multistage problems covering a wide variety of models in dynamic programming and stochastic programming are represented in a new way. Strong properties of duality are revealed which support the development of iterative approximate techniques of solution in terms of saddlepoints. Optimality conditions are derived in a form that emphasizes the possibilities of decomposition.
No takes yet. Share an insight, caveat, or question.
Rockafellar et al. (1990) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: