Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization
From MaRDI portal
Publication:3030594
DOI10.1007/BF02591693zbMath0626.90078MaRDI QIDQ3030594
Hanif D. Sherali, Suvrajeet Sen
Publication date: 1987
Published in: Mathematical Programming (Search for Journal in Brave)
inequality constraintsdisjunctive programsgeneral linear complementarityintersection cuts, facet inequalities, reverse convex constraints
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem, Intersection Disjunctions for Reverse Convex Sets, Outer-product-free sets for polynomial optimization and oracle-based cuts, On the use of cuts in reverse convex programs, Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs, Lagrangean duality for facial programs with applications to integer and complementarity problems, Calculation of bounds on variables satisfying nonlinear inequality constraints, On the implementation and strengthening of intersection cuts for QCQPs, On the implementation and strengthening of intersection cuts for QCQPs, Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints, A level set algorithm for a class of reverse convex programs, Sequential convexification in reverse convex and disjunctive programming, The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification, Stability in disjunctive optimization II:continuity of the feasible and optimal set
Cites Work
- Unnamed Item
- Unnamed Item
- A branch and bound algorithm for extreme point mathematical programming problems
- Linear programs with an additional reverse convex constraint
- Optimization with disjunctive constraints
- Reverse convex programming
- An algorithm for optimizing network flow capacity under economies of scale
- Characterization of local solutions for a class of nonconvex programs
- Complementary pivot theory of mathematical programming
- On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs
- Facet inequalities from simple disjunctions in cutting plane theory
- On the generation of deep disjunctive cutting planes
- A complementary variant of Lemke's method for the linear complementary problem
- Complementary Geometric Programming
- Optimization Problems Subject to a Budget Constraint with Economies of Scale
- Bilinear programming: An exact algorithm
- Cutting-Planes for Complementarity Constraints
- Polyhedral convexity cuts and negative edge extensions
- Numerical treatment of a class of semi‐infinite programming problems
- Application of disjunctive programming to the linear complementarity problem
- Bimatrix Equilibrium Points and Mathematical Programming
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- Convex Analysis
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Iterative Solution of Nonlinear Optimal Control Problems
- Convexity Cuts and Cut Search
