> Second ,if I want to solve the least-absolute-deviation problem using
> gusek,how should I convert the objective function.My objective function
> is following:
>
> sum{a in A,c in C}|(sum{i in I,j in J}
> pl[i,j,a,c]*d[i,j]-col[a,c])|
>
> +sum{a in A,b in B,c in C}|(sum{i in I,j in J}
> pls[i,j,a,b,c]*d[i,j]-cot[a,b,c])|
>
> +sum{i in I,j in J}|(d[i,j]-dt[i,j])|.
>
You may look at some examples included in the glpk distribution, namely,
cf12a.mod, cf12b.mod, cflsq.mod, qfit.mod, xyacfs.mod, and yacfs.mod.
_______________________________________________
Help-glpk mailing list
[email protected]
https://lists.gnu.org/mailman/listinfo/help-glpk
