Hi all,

Is there any command that can solve multi objective model directly? I mean, without using weighted sum or epsilon constraint methods, can we solve multi objective model in gams?

Many thanks!

## Is it possible to solve bi-objective model directly in GAMS? Topic is solved

### Re: Is it possible to solve bi-objective model directly in GAMS?

Richard,

Your post raises an interesting question. What exactly is a bi-objective model? The name seems self-explanatory and self-contradictory at the same time (e.g. "We need to both minimize costs and maximize production.")

To be complete a definition would include some characterization of what it means to solve such a model.

-Steve

Your post raises an interesting question. What exactly is a bi-objective model? The name seems self-explanatory and self-contradictory at the same time (e.g. "We need to both minimize costs and maximize production.")

To be complete a definition would include some characterization of what it means to solve such a model.

-Steve

### Re: Is it possible to solve bi-objective model directly in GAMS?

Dear Steve,

Thanks very much for your answer.

I have a bi-objective model for nursing home location and allocation problem. I heard cplex have a feature that can solve multi-objective model directly, and GAMS supported this feature too.

Is this true?

I searched a lot, but I didn't find anything.

Many thanks!

Thanks very much for your answer.

I have a bi-objective model for nursing home location and allocation problem. I heard cplex have a feature that can solve multi-objective model directly, and GAMS supported this feature too.

Is this true?

I searched a lot, but I didn't find anything.

Many thanks!

### Re: Is it possible to solve bi-objective model directly in GAMS?

Richard,

Your last post gave lots of specifics related to the algebra of your model, but my question was more basic: what does it mean to say that a point is a solution?

For example, a point xbar solves a uni-objective model min z = f(x) if xbar is feasible and f(xbar) <= f(x) for all feasible x.

-Steve

Your last post gave lots of specifics related to the algebra of your model, but my question was more basic: what does it mean to say that a point is a solution?

For example, a point xbar solves a uni-objective model min z = f(x) if xbar is feasible and f(xbar) <= f(x) for all feasible x.

-Steve

### Re: Is it possible to solve bi-objective model directly in GAMS?

Dear Steve,

If you want the truth, I'm just looking for a good solution And nothing special in my mind.

Thanks so much!

Richard

If you want the truth, I'm just looking for a good solution And nothing special in my mind.

Thanks so much!

Richard

### Re: Is it possible to solve bi-objective model directly in GAMS?

Richard,

If we exclude the EMP model type from the discussion (that's a whole other story), then GAMS does not have a multi-objective model type.

The model you describe seems to be a good representative example. You have two objectives - distance traveled and construction costs - and you'd like a solution that does a good job of balancing the two. This is quite reasonable in practice, but mathematically it is not very complete. With GAMS, it's easy to build the basic model and then write some GAMS code to:

1. Optimize a weighted sum of the two objectives. By varying the weights you can generate different solutions to get a feel for the possibilities.

2. Constrain one objective and optimize the other.

3. Construct a sort of "efficient frontier" - a set of non-dominated solutions that show the best you can do as you shift the emphasis from minimizing construction cost to minimizing distance traveled.

-Steve

If we exclude the EMP model type from the discussion (that's a whole other story), then GAMS does not have a multi-objective model type.

The model you describe seems to be a good representative example. You have two objectives - distance traveled and construction costs - and you'd like a solution that does a good job of balancing the two. This is quite reasonable in practice, but mathematically it is not very complete. With GAMS, it's easy to build the basic model and then write some GAMS code to:

1. Optimize a weighted sum of the two objectives. By varying the weights you can generate different solutions to get a feel for the possibilities.

2. Constrain one objective and optimize the other.

3. Construct a sort of "efficient frontier" - a set of non-dominated solutions that show the best you can do as you shift the emphasis from minimizing construction cost to minimizing distance traveled.

-Steve

### Re: Is it possible to solve bi-objective model directly in GAMS?

Steve Thanks very much for your answer!