A finite algorithm for solving the generalized lattice point problem (Q1179205)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 24123
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A finite algorithm for solving the generalized lattice point problem |
scientific article; zbMATH DE number 24123 |
Statements
A finite algorithm for solving the generalized lattice point problem (English)
0 references
26 June 1992
0 references
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.
0 references
finite cutting plane algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7953452467918396
0 references
0.7915433645248413
0 references
