On the convergence of cone splitting algorithms with \(\omega\)-subdivisions (Q5947265)

The authors consider a minimization problem where the objective function is concave and the feasible region is a full--dimensional polytope in \({\mathbb R}^n.\) The convergence of the revisited version of the Tuy cone splitting algorithm and of its branch--and--bound variant is proved. The idea consists in considering at each iteration a new hyperplane supporting the whole polytope instead of only the portion contained in the cone, but which leads to the same point \(\omega\).