The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
2000 Mathematics Subject Classification: Primary 90C29; Secondary 49K30.
In this paper, we establish necessary optimality conditions and
sufficient optimality conditions for D.C. vector optimization problems under
D.C. constraints. Under additional conditions, some results of [9] and [15]
are also recovered.
Dans ce papier, nous caractérisons l’ensemble des points efficients d’un problème de programmation multicritère quadratique convexe. Nous ramenons ainsi le problème de la minimisation d’une fonction linéaire sur l’ensemble des points efficients à la résolution d’un problème de programmation fractionnaire.
Download Results (CSV)