On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs

DOI10.1007/BF02591860zbMath0562.90076MaRDI QIDQ3675916

Hanif D. Sherali, Suvrajeet Sen

Publication date: 1985

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02591860

zbMATH Keywords

nonconvex programs; convergence of cutting plane algorithms; Generalized Lattice Point Problems

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C30: Nonlinear programming

49M37: Numerical methods based on nonlinear programming

Related Items

An extreme-point-ranking algorithm for the extreme-point mathematical programming problem, Global optimization algorithms for linearly constrained indefinite quadratic problems, A finite cutting plane method for solving linear programs with an additional reverse convex constraint, A branch and bound algorithm for extreme point mathematical programming problems, A finite procedure to generate feasible points for the extreme point mathematical programming problem, A finite algorithm for solving the generalized lattice point problem, A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs, Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs, The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification, Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints, Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization, Facet inequalities from simple disjunctions in cutting plane theory

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization with disjunctive constraints
• Facial disjunctive programs and sequences of cutting-planes
• A finitely convergent procedure for facial disjunctive programs
• Quasi-concave minimization subject to linear constraints
• A Cutting-Plane Game for Facial Disjunctive Programs
• A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
• On the generation of deep disjunctive cutting planes
• Technical Note—On the Generalized Lattice Point Problem and Nonlinear Programming
• Variations on a cutting plane method for solving concave minimization problems with linear constraints
• On the Group Problem and a Subadditive Approach to Integer Programming
• Disjunctive Programming
• The Generalized Lattice-Point Problem
• Extreme Point Mathematical Programming
• Convexity Cuts and Cut Search