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

DOI10.1007/BF02591860zbMath0562.90076OpenAlexW2005960214MaRDI 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 programsconvergence of cutting plane algorithmsGeneralized Lattice Point Problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items (12)

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

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

This page was built for publication: On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs