Perturbing convex multiobjecttve programs
From MaRDI portal
Recommendations
- Multiobjective programming problems under generalized convexity
- Generalized convexity in multiobjective programming
- Generalized convexity in multiobjective programming
- scientific article; zbMATH DE number 5631218
- scientific article; zbMATH DE number 1664577
- Multiobjective programming with semilocally convex functions
- Convex composite multi-objective nonsmooth programming
- Perturbed cones for analysis of uncertain multi-criteria optimization problems
- On generalised convex multi-objective nonsmooth programming
- Optimization of a convex program with a polynomial perturbation
Cites work
- Exposing Constraints
- Linear multicriteria sensitivity and shadow costs
- Nondifferentiable optimization by smooth approximations
- Nonsmooth multiobjective programming
- On sensitivity analysis for multicriteria optimization
- On the Identification of Active Constraints
- Optimization and nonsmooth analysis
- Optimization with set-functions described by functions
- Strong stability of stationary solutions and Karush-Kuhn-Tucker points in nonlinear optimization
Cited in
(6)- Perturbed cones for analysis of uncertain multi-criteria optimization problems
- scientific article; zbMATH DE number 1559423 (Why is no real title available?)
- On some global implicit function theorems for set-valued inclusions with applications to parametric vector optimization
- scientific article; zbMATH DE number 5631218 (Why is no real title available?)
- Convex optimization problems with arbitrary right-hand side perturbations
- Conditions for the stability of ideal efficient solutions in parametric vector optimization via set-valued inclusions
This page was built for publication: Perturbing convex multiobjecttve programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2709444)
