Abstract
Disjunctive Programs can often be transcribed as reverse convex constrained problems with nondifferentiable constraints and unbounded feasible regions. We consider this general class of nonconvex programs, called Reverse Convex Programs (RCP), and show that under quite general conditions, the closure of the convex hull of the feasible region is polyhedral. This development is then pursued from a more constructive standpoint, in that, for certain special reverse convex sets, we specify a finite linear disjunction whose closed convex hull coincides with that of the special reverse convex set. When interpreted in the context of convexity/intersection cuts, this provides the capability of generating any (negative edge extension) facet cut. Although this characterization is more clarifying than computationally oriented, our development shows that if certain bounds are available, then convexity/intersection cuts can be strengthened relatively inexpensively.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Avriel, “Methods for solving signomial and reverse convex programming problems,” in: M. Avriel, M.J. Rijckaert and D.J. Wilde, eds.,Optimization and Design (Prentice-Hall, Englewood Cliffs, NJ, 1973) pp. 307–320.
M. Avriel,Nonlinear Programming: Analysis and Methods (Prentice-Hall, Englewood Cliffs, NJ, 1976).
M. Avriel and A.C. Williams, “Complementary geometric programming,”SIAM Journal of Applied Mathematics 19 (1970) 125–141.
E. Balas, “Intersection cuts—a new type of cutting planes for integer programming,”Operations Research 19 (1971) 19–39.
E. Balas, “Disjunctive programming: Cutting planes from logical conditions,” in: O.L. Mangasarian, R.R. Meyer and S.M. Robinson, eds.,Nonlinear Programming (Academic Press, New York, 1975) pp. 279–312.
P.P. Bansal and S.E. Jacobsen, “Characterization of local solutions for a class of nonconvex programs,”Journal of Optimization Theory and Application 15 (1975a) 549–564.
P.P. Bansal and S.E. Jacobsen, “An algorithm for optimizing network flow capacity under economies of scale,Journal of Optimization Theory and Application 15 (1975b) 565–586.
J. Bard and J.E. Falk, “An explicit solution to the multi-level programming problem”,Computers and Operations Research 9 (1982a) 77–100.
J. Bard and J.E. Falk, “A separable programming approach to the linear complementarity problem,”Computers and Operations Research 9 (1982b) 153–159.
R.W. Cottle and G.B. Dantzig, “Complementary pivot theory of mathematical programming,”Linear Algebra and Applications 1 (1968) 103–125.
R.S. Dembo, “Solution of complementary geometric programming problems,” M.Sc. Thesis, Technion, Israel Institute of Technology, Haifa (1972).
G. Gallo and A. Ulkucu, “Bilinear programming: An exact algorithm,”Mathematical Programming 12 (1977) 173–194.
F. Glover, “Convexity cuts and cut search,”Operations Research 21 (1973) 123–124.
F. Glover, “Polyhedral convexity cuts and negative edge extensions,”Zeitschrift für Operations Research 18 (1974) 181–186.
S.A. Gustafson and K.O. Kortanek, “Numerical solution of a class of semiinfinite programming problems,”Naval Research Logistics Quarterly 20 (1973) 477–504.
R.J. Hillestad, “Optimization problems subject to a budget constraint with economies of scale,”Operations Research 23 (1975) 1091–1098.
R.J. Hillestad and S.E. Jacobsen, “Reverse convex programming,”Applied Mathematics and Optimization 6 (1980a) 63–78.
R.J. Hillestad and S.E. Jacobsen, “Linear programs with an additional reverse convex constraint,”Applied Mathematics and Optimization 6 (1980b) 257–269.
R.G. Jeroslow, “Cutting planes for complementarity constraints,”SIAM Journal on Control and Optimization 16 (1978) 56–62.
C.E. Lemke, “Bimatrix equilibrium points and mathematical programming,”Management Science 11 (1965) 681–689.
M. Raghavachari, “On the zero-one integer programming problem,”Operations Research 17 (1969) 680–685.
B. Ramarao and C.M. Shetty, “Development of valid inequalities for disjunctive programming,”Naval Research Logistics Quarterly 31 (1984) 581–600.
R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, NJ, 1970).
J.B. Rosen, “Iterative solution of nonlinear optimal control problems,”SIAM Journal on Control 4 (1966) 223–244.
S. Sen and H.D. Sherali, “On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs,”Mathematical Programming 31 (1985a) 42–56.
S. Sen and H.D. Sherali, “A branch and bound algorithm for extreme point mathematical programming problems,”Discrete Applied Mathematics 11 (1985b) 265–280.
S. Sen and H.D. Sherali, “Facet inequalties from simple disjunctions in cutting plane theory,”Mathematical Programming 34 (1986) 72–83.
S. Sen and A. Whiteson, “A cone splitting algorithm for reverse convex programming,”Proceedings, IEEE Conference on Systems, Man and Cybernetics (Tucson, AZ, 1985) pp. 656–660.
H.D. Sherali and C.M. Shetty,Optimization with Disjunctive Constraints (Springer-Verlag, Berlin-Heidelberg-New York, 1980a).
H.D. Sherali and C.M. Shetty, “Deep cuts in disjunctive programming,”Naval Research Logistics Quarterly 27 (1980b) 453–357.
J. Stoer and C. Witzgall,Convexity and Optimization in Finite Dimensions I (Springer-Verlag, Berlin, 1970).
C. Van de Panne,Methods for Linear and Quadratic Programming (North-Holland, Amsterdam, 1974).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sen, S., Sherali, H.D. Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization. Mathematical Programming 37, 169–183 (1987). https://doi.org/10.1007/BF02591693
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02591693