Algorithm for maximizing a linear function on the set of integral points of a convex polyhedron

DOI10.1007/BF01068359zbMATH0625.90057OpenAlexW2069631132MaRDI QIDQ3028720FDOQ3028720

Authors Nguen Ngok Tyu

Publication date 1986

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01068359

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Integer programming (90C10)

Recommendations

• Publication:4206571
• scientific article; zbMATH DE number 3896667
• scientific article; zbMATH DE number 4209913
• scientific article; zbMATH DE number 3922374
• An algorithm for determining the minimal convex subset that contains all the integer points of a convex polyhedral set

Cites work

• scientific article; zbMATH DE number 3748755 (Why is no real title available?)
• A new algorithm for solving the discrete programming problem

Cited in

(12)

• An algorithm for maximizing a convex function over a simple set
• Algorithm for solving partially - linear optimization problems obtained by getting maximum of functions
• Description of the optimal solution set of the linear programming problem and the dimension formula
• Integral boundary points of convex polyhedra
• Linear algorithm to find the largest intriangles of a planar convex polygon
• scientific article; zbMATH DE number 3858830 (Why is no real title available?)
• scientific article; zbMATH DE number 3858855 (Why is no real title available?)
• scientific article; zbMATH DE number 3896667 (Why is no real title available?)
• The integer hull of a convex rational polytope
• Algorithmes de poursuite pour la résolution de programmes (linéaires) en nombres entiers
• An algorithm to find a maximum of a multilinear map over a product of spheres
• An algorithm for determining the minimal convex subset that contains all the integer points of a convex polyhedral set

This page was built for publication: Algorithm for maximizing a linear function on the set of integral points of a convex polyhedron

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