A finite algorithm for solving the generalized lattice point problem (Q1179205): Difference between revisions

A nonconvex programming problem called `generalized lattice point problem' is investigated. The problem consists in minimizing a linear objective function over a set \(Q\cap F_ q\), where \(Q\) is a convex polyhedron and \(F_ q\) is the set of points belonging to the at most \(q\)-dimensional faces of another polyedron. The author suggests a finite cutting plane algorithm for solving this problem. Some computational experience with the suggested algorithm is presented.