Sensitivity in multiobjective optimization: The generalized envolvent theorem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 417882 (Why is no real title available?)
- scientific article; zbMATH DE number 1360760 (Why is no real title available?)
- Duality of nonscalarized multiobjective linear programs: dual balance, level sets, and dual clusters of optimal vectors.
- Equivalence of balance points and Pareto solutions in multiple-objective programming
- Nonscalarized multiobjective global optimization
- On the envolvent theorem in multiobjective programming
- Pareto analysis vis-à-vis balance space approach in multiobjective global optimization
- Retrieval and use of the balance set in multiobjective global optimization
- Sensitivity analysis in vector optimization
- Sensitivity analysis using the tangent derivative
Cited in
(6)- A natural extension of the classical envelope theorem in vector differential programming
- Sensitivity Analysis In Multi Objective Optimization
- The envelope theorem for multiobjective convex programming via contingent derivatives
- Sensitivity of Pareto solutions in multiobjective optimization
- On FGP approach to multiobjective quadratic fractional programming problem
- scientific article; zbMATH DE number 1858031 (Why is no real title available?)
This page was built for publication: Sensitivity in multiobjective optimization: The generalized envolvent theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q999588)