A finite algorithm for solving the generalized lattice point problem

DOI10.1016/0377-2217(91)90256-UzbMath0744.90067OpenAlexW1977502780MaRDI QIDQ1179205

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

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

Cites Work

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

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