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

DOI10.1007/BF01068359zbMATH Open0625.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

Recommendations

• Publication:4206571
• scientific article; zbMATH DE number 3896667
• scientific article
• 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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A new algorithm for solving the discrete programming problem

Cited In (12)

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

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)