Re: Finding the feasible region
- From: GJB <nietorigineel@xxxxxxxxx>
- Date: Tue, 1 Aug 2006 09:27:00 -0400
Seems to me (granted, after a very quick glance) all you need is
enough patience. Take a large number of x's, and put those through
the first inequality. Keep only those that render that inequality
true, and proceed with the next inequality, untill either none of the
remaining x's suffice, or no more unequality are left.
GJB
Octav wrote:
.
Hi John,
I have a set of inequalities of the form:
d(a,x) <= d(a,b) + d(b,x)
the distance is the Lp norm. I know the distances d(a,b) and
d(b,x).
So, I want to find a feasible x that satiesfies all inequalities.
-- Octav
- References:
- Finding the feasible region
- From: Octav
- Re: Finding the feasible region
- From: Octav
- Finding the feasible region
- Prev by Date: suppressing data type warnings with accelerator
- Next by Date: Problems with GUIDE
- Previous by thread: Re: Finding the feasible region
- Next by thread: Re: Finding the feasible region
- Index(es):
Relevant Pages
|
Loading