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 24 Jun '15, 12:05

ztoz's gravatar image

accept rate: 0%

Be the first one to answer this question!
toggle preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here



Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text]( "Title")
  • image?![alt text](/path/img.jpg "Title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported



Asked: 24 Jun '15, 12:05

Seen: 334 times

Last updated: 24 Jun '15, 12:05

OR-Exchange! Your site for questions, answers, and announcements about operations research.