Abstract
An approximate dual is proposed for a multiobjective optimization problem. The approximate dual has a finite feasible set, and is constructed without using a perturbation. An approximate weak duality theorem and an approximate strong duality theorem are obtained, and also an approximate variational inequality condition for efficient multiobjective solutions.

This publication has 2 references indexed in Scilit: