Linear programming?
- From: "Scott" <scbender@xxxxxxxxxxxxxx>
- Date: Tue, 10 Apr 2007 20:35:02 -0400
I am trying to create a linear program with sets of constraints, but I only
need one set of constraints to be true.
For example, I have N constraints in standard form (<=0). Suppose I
partition the constraints into equal size groups size N/k. I only want the
constraints in one of the k partitions to have to be true.
Something like this:
(x1 <= 0) and (x2 <= 0) and (x3 <= 0)
OR
(x4 <= 0) and (x5 <= 0) and (x6 <= 0)
I can use absolute value functions combined with a nonlinear constraint to
build the constraint I want:
set1 = x1+x2+x3 + abs(x1+x2+x3) //zero iff x1,x2,x3 all <= 0
set2 = x4+x5+x6 + abs(x4+x5+x6)
set1*set2 = 0 //true if at least one of them is zero
This should extend out to however many sets.
But this is obviously no longer a linear program.
Is it possible to make this into a standard linear program? If not is there
a way to solve such an optimization problem in polynomial time?
Thanks,
-Scott
.
- Follow-Ups:
- Re: Linear programming?
- From: ST
- Re: Linear programming?
- From: Jukka Kohonen
- Re: Linear programming?
- From: Radosław Hofman
- Re: Linear programming?
- From: A . L .
- Re: Linear programming?
- Prev by Date: Re: Category Theory of Algorithms
- Next by Date: Re: Linear programming?
- Previous by thread: Theoretical Computer Science Search Engine
- Next by thread: Re: Linear programming?
- Index(es):
Relevant Pages
|