Abstract
A piecewise convex program is a convex program such that the constraint set can be decomposed in a finite number of closed convex sets, called the cells of the decomposition, and such that on each of these cells the objective function can be described by a continuously differentiable convex function.
In a first part, a cutting hyperplane method is proposed, which successively considers the various cells of the decomposition, checks whether the cell contains an optimal solution to the problem, and, if not, imposes a convexity cut which rejects the whole cell from the feasibility region. This elimination, which is basically a dual decomposition method but with an efficient use of the specific structure of the problem is shown to be finitely convergent.
The second part of this paper is devoted to the study of some special cases of piecewise convex program and in particular the piecewise quadratic program having a polyhedral constraint set. Such a program arises naturally in stochastic quadratic programming with recourse, which is the subject of the last section.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J.F. Benders, “Partition procedures for solving mixed-variables programming problems”,Numerische Mathematik 4 (1962) 238–252.
G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, 1963).
G.B. Dantzig and A. Madansky, “On the solution of the two-stage linear programs under uncertainty”, in:Proceedings of the fourth Berkeley symposium on mathematical statistics, University of California, Berkeley, 1 (1961) pp. 165–176.
S.J. Garstka, “Stochastic programs with quadratic recourse”, Tech. Rept., University of Chicago (1974).
S.J. Garstka and R.J. Wets, “On decisions rules in stochastic programming”,Mathematical Programming 7 (1974) 117–143.
P. Kall,Stochastic linear programming (Springer, Berlin, 1974).
F. Louveaux, “Piecewise quadratic programs with recourse, applications to stochastic quadratic programming”, CORE DP 7713.
R.T. Rockafellar,Convex analysis, (Princeton University Press, Princeton, 1970).
C. Van de Panne,Methods for linear and quadratic programming (North-Holland, Amsterdam, 1975).
R. Van Slyke and R.J. Wets, “L-shaped linear programs with applications to optimal control and stochastic linear programming”,SIAM Journal on Applied Mathematics 17 (1969) 638–663.
D. Walkup and R.J. Wets, “Stochastic programs with recourse”,SIAM Journal on Applied Mathematics 15 (1967) 1299–1314.
D. Walkup and R.J. Wets, “Stochastic program with recourse: special forms”, in:Proceedings of the Princeton symposium on mathematical programming (Princeton University Press, Princeton, 1970) pp. 139–162.
R.J. Wets, “Programming under uncertainty, the equivalent convex program,SIAM Journal on Applied Mathematics 14 (1966) 89–105.
R.J. Wets, “Stochastic program with fixed recourse, the equivalent deterministic problem”,SIAM Review 16 (1974) 309–339.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Louveaux, F.V. Piecewise convex programs. Mathematical Programming 15, 53–62 (1978). https://doi.org/10.1007/BF01608999
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01608999