Tell me more ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.
up vote 0 down vote favorite

I am trying to answer questions of a combinatorial nature about

  1. the number of hyperplanes we draw in an LP type problem such as finding the center point of a given point set P having n points.
  2. The number of faces of the convex polyhedron that we get finally as the feasible region.
  3. Detecting a point inside this region.

I would like to discuss the proofs of these questions on stackexchange. Kindly help.

share|improve this question

Know someone who can answer? Share a link to this question via email, Google+, Twitter, or Facebook.

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.