Generalized convexity in multiobjective programming
From MaRDI portal
The so-called weighting problem, the k-th objective Lagrangian problem and the k-th objective constraint problem associated with a multiobjective nonlinear optimization problem are considered. The relationship between the solutions of these three problems and the noninferior solutions of the multiobjective optimization problem are studied as well as weaker types of convexities as e.g. quasiconvexity and pseudoconvexity. Also duality results are included.
Recommendations
- Multiobjective programming problems under generalized convexity
- On generalized convexity and duality in multiobjective programming problems
- Generalised convexity and duality in multiple objective programming
- scientific article; zbMATH DE number 1092139
- Generalized pseudoconvex functions and multiobjective programming
Cited in
(13)- Invex functions and generalized convexity in multiobjective programming
- Generalized pseudoconvex functions and multiobjective programming
- On generalized trade-off directions in nonconvex multiobjective optimization
- Multiobjective programming problems with (G,C,)-convexity
- Perturbing convex multiobjecttve programs
- Selective convexity in extended GDEA model
- scientific article; zbMATH DE number 3956826 (Why is no real title available?)
- On generalized-convex constrained multi-objective optimization
- scientific article; zbMATH DE number 5018510 (Why is no real title available?)
- Generalized asymptotic functions in nonconvex multiobjective optimization problems
- The weighting method and multiobjective programming under new concepts of generalized (\phi,\rho)-invexity
- scientific article; zbMATH DE number 960923 (Why is no real title available?)
- Generalized polarity and weakest constraint qualifications in multiobjective optimization
This page was built for publication: Generalized convexity in multiobjective programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5916441)
