A finite algorithm for solving the generalized lattice point problem

DOI10.1016/0377-2217(91)90256-UMaRDI QIDQ1179205zbMATH OpenOpenAlexFDO

Authors János Fülöp

Publication date 26 June 1992

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(91)90256-u

zbMATH Keywords

finite cutting plane algorithm

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Nonconvex programming, global optimization (90C26)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 4185404
• Finite algorithm for generalized linear multiplicative programming
• On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs
• scientific article; zbMATH DE number 4127006
• Algorithm for maximizing a linear function on the set of integral points of a convex polyhedron

Cites work

• A branch and bound algorithm for extreme point mathematical programming problems
• A disjunctive cutting plane algorithm for the extreme point mathematical programming problem
• A finite cutting plane method for solving linear programs with an additional reverse convex constraint
• A finite procedure to generate feasible points for the extreme point mathematical programming problem
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• An extreme-point-ranking algorithm for the extreme-point mathematical programming problem
• Critical Path Problem under Assignment Constraint—An Application of an Extreme Point Mathematical Programming Problom
• Disjunctive Programming
• Extreme Point Mathematical Programming
• scientific article; zbMATH DE number 3323651 (Why is no real title available?)
• scientific article; zbMATH DE number 3350057 (Why is no real title available?)
• On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs
• Optimization with disjunctive constraints
• Quasi-concave minimization subject to linear constraints
• Strong-Cut Enumerative procedure for Extreme point Mathematical Programming Problems
• Technical Note—On the Generalized Lattice Point Problem and Nonlinear Programming
• The Generalized Lattice-Point Problem
• Theorems on the dimensions of convex sets

Cited in

(1)

• scientific article; zbMATH DE number 3869065 (Why is no real title available?)

This page was built for publication: A finite algorithm for solving the generalized lattice point problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1179205)