Guest wrote:Decision variables = [tex]x_{1 }[/tex],........ x_{10} for number of boxes of each size
Say a_{1 },.....a_{10 } = cost for shipping each box size
Obj Function
Min a_{1 }x_{1 }+.....+a_{10 }x_{10 }
Guest wrote:n1,n2,....,n10 = number of boxes of each size
c1,c2,...,c10 = cost of shipping each size
x1,x2,...,x10 = binary for decision to use box
y1,y2,...,y10 = number of items taht will fit in each of 10 boxes
Obj func Min c1.n1.x1 + c2.n2.x2 +..... +c10.n10.x10
Constraints
x1,x2,...x10 = {0,1} 0 = do not use box, 1 = use box
x1 + x2 +... + x10 = 3 so only 3 box sizes are used
n1 + n2 +.... +n10 = 1000 so all items have boxes
n1 <= y1
n2 <= y1 + y2
.
.
.
.
n10 <= y1 + y2 +... +y10
x1,x2....,x10,y1,y2,...,y10,n1,n2,...,n10 >=0
Return to Programming and Algorithms
Users browsing this forum: No registered users and 1 guest