Generalized convexity and duality for multiobjective optimization problems
By considering the following multiobjective generalized convex optimization problems of the type (MOP): Minimize \(f(x)\), subject to \(x\in X=\{x\in R^ n: g(x)\leq 0\}\), the author obtains a necessary and a sufficient condition for properly efficient solutions and establishes some duality connections between (MOP) and the Mond-Weir type dual (Wolfe type dual) problem associated with (MOP) under \(F\)-convex conditions, as defined by \textit{M. A. Hanson} and \textit{B. Mond} [J. Inf. Optimization Sci. 3, 25-32 (1982; Zbl 0475.90069)].
- Efficiency and generalized convex duality for multiobjective programs
- Duality for generalized convex multiobjective programming without a constraint qualification
- The \(F\)-objective function method for differentiable interval-valued vector optimization problems
- scientific article; zbMATH DE number 1322882 (Why is no real title available?)
- scientific article; zbMATH DE number 572159 (Why is no real title available?)
- scientific article; zbMATH DE number 851569 (Why is no real title available?)
- scientific article; zbMATH DE number 5018510 (Why is no real title available?)
- Duality for a kind of multiobjective optimization problem under generalized convexity
- scientific article; zbMATH DE number 960923 (Why is no real title available?)
- Efficiency and generalized convex duality for nondifferentiable multiobjective programs
This page was built for publication: Generalized convexity and duality for multiobjective optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5286932)