Thread Subject: linprog

Subject: linprog

From: Vilma Ramada

Date: 6 Jan, 2006 11:43:44

Message: 1 of 6

I try solving :
 
min c'x
st. Ax <= b
    Aeqx = beq
    x<=ub

When I using the function 'linprog' ,I got the following information
:

Exiting:One or more of the residuals, duality gap, or total relative
error
has grown 100000 times greater than its minimum value so
far:
the primal appears to be infeasible (and the dual
unbounded).
(The dual residual < TolFun=1.00e-008.)

Can anyone help me to see What the problem is??
How can I resolve this problem?
Thanks a lot.

Subject: linprog

From: Marcus M. Edvall

Date: 21 Jan, 2006 20:35:41

Message: 2 of 6

Hi Vilma,

TOMLAB /CPLEX will tell you exactly what the problem is - potentially
also solve it. The infeasibility finder needs to be activated.

Best wishes, Marcus
Tomlab Optimization Inc.
 <http://tomlab.biz>

Vilma Ramada wrote:
>
>
> I try solving :
>
> min c'x
> st. Ax <= b
> Aeqx = beq
> x<=ub
>
> When I using the function 'linprog' ,I got the following
> information
> :
>
> Exiting:One or more of the residuals, duality gap, or total
> relative
> error
> has grown 100000 times greater than its minimum value so
> far:
> the primal appears to be infeasible (and the dual
> unbounded).
> (The dual residual < TolFun=1.00e-008.)
>
> Can anyone help me to see What the problem is??
> How can I resolve this problem?
> Thanks a lot.

Subject: linprog

From: Evdokia

Date: 13 May, 2011 10:05:05

Message: 3 of 6

Hi Marcus,

could you tell me how I can activate the infeasibility finder?

Thanx,
Eva

"Marcus M. Edvall" <medvREMall@tomREMlab.biREMz> wrote in message <ef22c0a.0@webx.raydaftYaTP>...
> Hi Vilma,
>
> TOMLAB /CPLEX will tell you exactly what the problem is - potentially
> also solve it. The infeasibility finder needs to be activated.
>
> Best wishes, Marcus
> Tomlab Optimization Inc.
> <http://tomlab.biz>
>
> Vilma Ramada wrote:
> >
> >
> > I try solving :
> >
> > min c'x
> > st. Ax <= b
> > Aeqx = beq
> > x<=ub
> >
> > When I using the function 'linprog' ,I got the following
> > information
> > :
> >
> > Exiting:One or more of the residuals, duality gap, or total
> > relative
> > error
> > has grown 100000 times greater than its minimum value so
> > far:
> > the primal appears to be infeasible (and the dual
> > unbounded).
> > (The dual residual < TolFun=1.00e-008.)
> >
> > Can anyone help me to see What the problem is??
> > How can I resolve this problem?
> > Thanks a lot.

Subject: linprog

From: Torsten

Date: 13 May, 2011 10:30:13

Message: 4 of 6

On 13 Mai, 12:05, "Evdokia " <evdoki...@hotmail.com> wrote:
> Hi Marcus,
>
> could you tell me how I can activate the infeasibility finder?
>
> Thanx,
> Eva
>
> "Marcus M. Edvall" <medvREM...@tomREMlab.biREMz> wrote in message <ef22c0...@webx.raydaftYaTP>...
>
>
>
> > Hi Vilma,
>
> > TOMLAB /CPLEX will tell you exactly what the problem is - potentially
> > also solve it. The infeasibility finder needs to be activated.
>
> > Best wishes, Marcus
> > Tomlab Optimization Inc.
> >  <http://tomlab.biz>
>
> > Vilma Ramada wrote:
>
> > > I try solving :
>
> > > min c'x
> > > st. Ax <= b
> > > Aeqx = beq
> > > x<=ub
>
> > > When I using the function 'linprog' ,I got the following
> > > information
> > > :
>
> > > Exiting:One or more of the residuals, duality gap, or total
> > > relative
> > > error
> > > has grown 100000 times greater than its minimum value so
> > > far:
> > > the primal appears to be infeasible (and the dual
> > > unbounded).
> > > (The dual residual < TolFun=1.00e-008.)
>
> > > Can anyone help me to see What the problem is??
> > > How can I resolve this problem?
> > > Thanks a lot.- Zitierten Text ausblenden -
>
> - Zitierten Text anzeigen -

You want to activate the infeasibility finder in CPLEX ? Because MATAB
does not have this feature ...

Best wishes
Torsten.

Subject: linprog

From: Matt J

Date: 13 May, 2011 13:15:21

Message: 5 of 6

"Vilma Ramada" <vilma.cristina.ramada@marinha.pt> wrote in message <ef22c0a.-1@webx.raydaftYaTP>...
> I try solving :
>
> min c'x
> st. Ax <= b
> Aeqx = beq
> x<=ub
=================

MATLAB thinks there exists no x satisfying your constraints. The easiest thing would be if you already know at least one x that is supposed to be feasible. You could then test the constraints Ax*b, etc... to see which one isn't satisfied as it should be.

Subject: linprog

From: Derya Ozyurt

Date: 13 May, 2011 16:02:07

Message: 6 of 6

Hi Vilma,
Here are two suggestions:
* Increase TolFun to 1e-6 and rerun.
* Try primal simplex algorithm, i.e.
 X =
linprog(f,A,b,Aeq,beq,LB,UB,X0,optimset('LargeScale','off','Simplex','on')).

Do these give you a better outcome. If you still have problems, you could
send me your problem and I can have a look.

Regards,
Derya


"Evdokia " <evdokia02@hotmail.com> wrote in message
news:iqivoh$h0t$1@newscl01ah.mathworks.com...
> Hi Marcus,
>
> could you tell me how I can activate the infeasibility finder?
>
> Thanx,
> Eva
>
> "Marcus M. Edvall" <medvREMall@tomREMlab.biREMz> wrote in message
> <ef22c0a.0@webx.raydaftYaTP>...
>> Hi Vilma,
>>
>> TOMLAB /CPLEX will tell you exactly what the problem is - potentially
>> also solve it. The infeasibility finder needs to be activated.
>>
>> Best wishes, Marcus
>> Tomlab Optimization Inc.
>> <http://tomlab.biz>
>>
>> Vilma Ramada wrote:
>> >
>> >
>> > I try solving :
>> >
>> > min c'x
>> > st. Ax <= b
>> > Aeqx = beq
>> > x<=ub
>> >
>> > When I using the function 'linprog' ,I got the following
>> > information
>> > :
>> >
>> > Exiting:One or more of the residuals, duality gap, or total
>> > relative
>> > error
>> > has grown 100000 times greater than its minimum value so
>> > far:
>> > the primal appears to be infeasible (and the dual
>> > unbounded).
>> > (The dual residual < TolFun=1.00e-008.)
>> >
>> > Can anyone help me to see What the problem is??
>> > How can I resolve this problem?
>> > Thanks a lot.

Tags for this Thread

Add a New Tag:

Separated by commas
Ex.: root locus, bode

What are tags?

A tag is like a keyword or category label associated with each thread. Tags make it easier for you to find threads of interest.

Anyone can tag a thread. Tags are public and visible to everyone.

rssFeed for this Thread

Contact us at files@mathworks.com