On the generation of deep disjunctive cutting planes
From MaRDI portal
Publication:3885524
DOI10.1002/nav.3800270310zbMath0442.90066OpenAlexW2056777571MaRDI QIDQ3885524
C. M. Shetty, Hanif D. Sherali
Publication date: 1980
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800270310
valid inequalitiescutslogical constraintsdisjunctive programdisjunctive cutting planesdepth measuredepth of a cutnonconvex disjunctive programs
Related Items
Facet inequalities from simple disjunctions in cutting plane theory, On the redundancy of cutting planes for linear complementarity problems, A finitely convergent procedure for facial disjunctive programs, Mixed-integer bilinear programming problems, Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs, Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization, Partial convexification cuts for 0--1 mixed-integer programs, Strong IP formulations need large coefficients, Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization, A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions, On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs, Stability in disjunctive optimization II:continuity of the feasible and optimal set, Global optimization algorithms for linearly constrained indefinite quadratic problems
Cites Work
