i********c
发帖数: 54 | 1 is it possible to solve the optimization problem if the objective function
cannot be described directly as f(x)?
i.e.,
there are 6 balls (1,2, 3, 4, 5, 6) whose weight are 10, 10, 20, 20, 30, 30,
kg. the objective is to put them into 3 bags such that the balls in each bag
has the same weight. The solution is obvious: put 1&2 in bag A, 3&4 in bag B,
5&6 in bag C. Is it possible to do so in GAMS?
define
W(i) = /1, 1, 2, 2, 3, 3/ (weight of each ball)
WAvg(j) = average weight of balls in the |
|
