Quasi-Duality Result and Linearization in Multiobjective Quasiconvex Programming
Abstract
In this paper, multiobjective optimization problems with nondifferentiable quasiconvex functions are considered. We obtain some duality results and a linear representation for the considered problems. Since the well-known strong duality result is not valid for the problems, we present a weaker form of it, named quasi-strong duality result.
Keywords
Quasiconvex optimization; Duality results; Linearization; subdifferential; Multiobjective programming.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.