Given a Polytope from a linear program. Select one Vertex from the polytop and look at the cone which comes from the corresponding hyperplanes which intersect at the Vertex. How can one find an integer point inside the cone, which minimize the distance to the edge in a given norm. (i.e. 1-Norm, 2-Norm, max-Norm). Is this for any norm in polynom time possible? If not is it possible in polynom time to find an abitraty integer point inside the cone?
asked
ztoz |