Location Problem

[Eriska Prasetiowati]

I am new to ampl. I need your help to review this constraint. I am going to explain a part of the problem :

n  i : set of demand site

n  j : set of candidate site

n  k : set of type station  (large, medium, small)

var 

var X {i in DemandSites, j in Sites} binary; #location that would be build

var Xjk {j in Sites, k in Types} binary; #type of the station would be build

I would like to optimize location model to minimize cost.

minimize Total_Cost:

    sum {i in DemandSites, j in Sites, k in Types} F[k} * Xjk[j,k];

subject to Constraint_coverage {i in DemandSites} :

    sum {j in Sites} d[i,j] * X [i,j] >= demand[i];

Can you help me review that constraint.

Thanks..

[AMPL Google Group]

Your question has been moved to our new user forum at discuss.ampl.com, and a response has been posted. To see the response, use this link:

https://discuss.ampl.com/t/ampl-25000-location-problem/998/2?u=4er

To reply, click the red "Reply" button that follows the response. (Do not send an email reply to this message.)

--
Robert Fourer

We're switching to a new, enhanced user forum.
Join it now at discuss.ampl.com.

{#HS:2540937293-123017#}