[Symphony] biobjective problems

[Papis Wongchaisuwat]

     I want to have multiple solutions which form a pareto frontier. I do understand that I should run the solver several times.However, I thought Symphony has that function built in. I tried MCKP (bicriteria knapsack problems) application and it works. I also want to run other bicriteria problems which I don't know how to do that. 
Thanks,Papis

> Date: Wed, 11 Sep 2013 11:28:19 -0500
> From: hennebry at web.cs.ndsu.nodak.edu
> To: papis_31 at hotmail.com
> CC: symphony at list.coin-or.org
> Subject: Re: [Symphony] biobjective problems
> 
> On Wed, 11 Sep 2013, Papis Wongchaisuwat wrote:
> 
> > Dear all,      I am trying to run biobjective problems e.g. set cover, set pack problem. I searched the previous posting and it seems like  biobjective MILPs does not work with gmpl file. What is the easiest way to run these problems?  I am using linux but I am a new learner. It will be very helpful if someone can tell me exactly what I need to do (i.e. like step-by-step).
> 
> MILP solvers are designed to give one a single solution.
> Biobjective problems generally do not have a single soluion.
> You will need to run the solver multiple times.
> To say much more would require knowing what you regard as a solution.
> 
> -- 
> Michael   hennebry at web.cs.ndsu.NoDak.edu
> "On Monday, I'm gonna have to tell my kindergarten class,
> whom I teach not to run with scissors,
> that my fiance ran me through with a broadsword."  --  Lily
 		 	   		  
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.coin-or.org/pipermail/symphony/attachments/20130912/bb0100c6/attachment.html>