A finite algorithm for solving the Generalized Lattice Point Problem

A finite algorithm for solving the Generalized Lattice Point Problem

0.00 Avg rating0 Votes
Article ID: iaor1993754
Country: Netherlands
Volume: 51
Issue: 2
Start Page Number: 270
End Page Number: 281
Publication Date: Mar 1991
Journal: European Journal of Operational Research
Authors:
Abstract:

The paper deals with the nonconvex program called Generalized Lattice Point Problem. Here, a linear function is to be minimized over such points of a polyhedron which belong to the at most q-dimensional faces of another polyhedron. The paper presents a finite cutting plane algorithm for solving the considered problem. Computational experience is also provided.

Reviews

Required fields are marked *. Your email address will not be published.