Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!uunet!husc6!bloom-beacon!gatech!hubcap!"Paul
From: DIETZ%sdr.slb.com@RELAY.CS.NET (Paul F. Dietz)
Newsgroups: comp.hypercube
Subject: Calculating the volume of a LP-feasible region
Message-ID: <535@hubcap.UUCP>
Date: Mon, 5-Oct-87 08:08:18 EDT
Article-I.D.: hubcap.535
Posted: Mon Oct  5 08:08:18 1987
Date-Received: Thu, 8-Oct-87 01:53:05 EDT
Sender: fpst@hubcap.UUCP
Lines: 13
Approved: hypercube@hubcap.clemson.edu

[ This was on theory-net.  I thought there might be some interest or
  results usable.
	- Steve
]

I'd like to know if there is a fast algorithm for calculating the
volume of a convex region in n dimensions defined by the intersection
of m half-spaces.  A related problem I'd also like solved is to
generate a random point, uniformly distributed, from inside such a
convex region.

Paul F. Dietz
dietz@sdr.slb.com