Duality for generalized convex multiobjective programming without a constraint qualification
From MaRDI portal
Some weak and strong duality results for a pair of multiobjective nonlinear programming problems without a constraint qualification are presented. These results transpose in the context of multiobjective programming some duality results given by Weir and Mond in generalized convex programming.
Recommendations
- scientific article; zbMATH DE number 3934789
- Duality without constraint qualification for multiobjective programming
- scientific article; zbMATH DE number 1416303
- Duality for a kind of multiobjective optimization problem under generalized convexity
- Generalized convexity and duality for multiobjective optimization problems
- scientific article; zbMATH DE number 515354
- Generalised convexity and duality in multiple objective programming
- On generalized convexity and duality in multiobjective programming problems
- scientific article; zbMATH DE number 14317
- Duality for multiobjective optimization problems with convex objective functions and D.C. constraints
Cited in
(7)- scientific article; zbMATH DE number 3847230 (Why is no real title available?)
- scientific article; zbMATH DE number 3934789 (Why is no real title available?)
- scientific article; zbMATH DE number 12754 (Why is no real title available?)
- Duality without constraint qualification for multiobjective programming
- scientific article; zbMATH DE number 1552795 (Why is no real title available?)
- scientific article; zbMATH DE number 2156835 (Why is no real title available?)
- scientific article; zbMATH DE number 232392 (Why is no real title available?)
This page was built for publication: Duality for generalized convex multiobjective programming without a constraint qualification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1322044)
