How to evaluate the hardness of a Multiobjective Optimization problem?

From: jing.ai@xxxxxxxxx (saisai)
Date: 17 Apr 2005 12:42:11 -0700

Is it the concept of NP-complete still applied on the MOP
(Multiobjective Optimization)?

I do not know how to decribe decision version of the Multiobjective
Optimization problem even if we have two objectives say, A and B.

Could you give me an example?

Since a MOP can be usually formulated as an Integer Programming, it is
at least NP-hard, right?

Thanks for any advice!
.

Follow-Ups:
- Re: How to evaluate the hardness of a Multiobjective Optimization problem?
  - From: Ying-Chun Liu

Prev by Date: In want know about one algorithm (k-node) and how to converted distributed algorithm for link failure?.
Next by Date: Satisfiability problem compiler
Previous by thread: Network Flow
Next by thread: Re: How to evaluate the hardness of a Multiobjective Optimization problem?
Index(es):
- Date
- Thread