Originally posted by: sandeepsinghchauhan

How can i handle my objective ?

dvar float+ X[DV];

dvar boolean Z[DV];

dvar boolean Rw[PrS]; // PrS data in <pl,s> form where pl in int,s in string

dvar float+ RP[PrRS]; //  PrRS data in <pl,r,s> form where pl in int, r in string, s in string

dexpr float XCost[a in DV] = sum(s in RS)( slope[<a.p,a.l,a.t,s>] * X[a] + intercept[<a.p,a.l,a.t,s>] * Z[a]);

dexpr float Profit =sum(a in DV, s in supplier) Rw[<a.p,s>] * XCost[a] ;

maximize Profit;

constraints
{

(some constarints)

forall(RRo in PrS){
Rw[RRo] == minl(1,sum(t in TYPE) RP[<RRo.p,t,RRo.s>]);
}

}

Error
CPLEX Error 5002: Q in objective is not positive semi-definite.  

please help

Hi,

have you had a look at https://www.ibm.com/developerworks/community/forums/html/topic?id=030954ee-12b0-41e1-a4fe-8215d62f5209&ps=25 ?

regards

Originally posted by: sandeepsinghchauhan

I am not sure i am calling DV currectly. please help

dvar float+ X[DV];

dvar boolean Z[DV];

dvar float NewVariable[DV];

dvar boolean Rw[PrS]; // PrS data in <pl,s> form where pl in int,s in string

dvar float+ RP[PrRS]; //  PrRS data in <pl,r,s> form where pl in int, r in string, s in string

dexpr float XCost[a in DV] = sum(s in RS)( slope[<a.p,a.l,a.t,s>] * X[a] + intercept[<a.p,a.l,a.t,s>] * Z[a]);

dexpr float Profit =sum(a in DV) NewVariable[a];

maximize Profit;

constraints
{

(some constarints)

forall(a in DV){

(NewVariable[a] == 0) == (sum(t in TYPE) RP[<dv.p,t,dv.s>] == 0);

(NewVariable[a] == sum(a in DV)XCost[a]) == (sum(t in TYPE) RP[<dv.p,t,dv.s>] == 1);
}

}

Error
Out of memory

please help

Hi

out of memory is better than the previous error.

Can you attach .mod and .dat so that other people could help you ?

regards

Originally posted by: sandeepsinghchauhan

tuple TD
{
  int a;
  int b;
  int c;
}
{TD} ABC = ...;

dvar float X[ABC];

constraint:

forall(dv in ABC){
sum(r in ABC) (X[r] == Cost[<dv.p,dv.l>];

}

Any efficient way to use sum(r in ABC) since i am calling in ABC loop.