|
From: | Marcos Roberto Silva |
Subject: | Re: [Help-glpk] facility location problem |
Date: | Wed, 08 Dec 2004 09:12:22 -0200 |
User-agent: | Mozilla/5.0 (X11; U; Linux i686; pt-BR; rv:1.6) Gecko/20040413 Debian/1.6-5 |
Dear Pedro,You can solve the parametrized sigle objective problem with GLPK and find the "supported efficient solutions", i.e., the solutions on the lower-left boundary of the convex hull of the search space.
Other way is to solve with the E-constraints method. Best regards, Marcos Roberto Silva Pedro Ivo Dantas wrote:
Hello, I'm trying to solve the facility location problem (flp) with glpk, but i'm stuck. Since this problem has two objectives, minimizing the number of conections between facilitys and clients and the number of open facilitys, how can i model it? Any help would be appreciated. Thanks Pedro Ivo Dantas _______________________________________________ Help-glpk mailing list address@hidden http://lists.gnu.org/mailman/listinfo/help-glpk
[Prev in Thread] | Current Thread | [Next in Thread] |