Pages that link to "Item:Q4269761"
From MaRDI portal
The following pages link to Sensitivity in multi-objective programming under homogeneity assumptions (Q4269761):
Displaying 15 items.
- Some geometrical aspects of the efficient line in vector optimization (Q706931) (← links)
- Sensitivity of Pareto solutions in multiobjective optimization (Q852108) (← links)
- Conic set-valued maps in vector optimization (Q878244) (← links)
- A natural extension of the classical envelope theorem in vector differential programming (Q897053) (← links)
- Sensitivity analysis in convex programming (Q979946) (← links)
- Sensitivity in multiobjective optimization: The generalized envolvent theorem (Q999588) (← links)
- Sensitivity analysis in multiobjective optimization (Q1090247) (← links)
- Duality theory for infinite-dimensional multiobjective linear programming (Q1309919) (← links)
- Sensitivity analysis in differential programming through the Clarke derivative (Q1758634) (← links)
- On sensitivity in linear multiobjective programming (Q1841576) (← links)
- Duality theory and slackness conditions in multiobjective linear programming (Q1962983) (← links)
- Paratingent derivative applied to the measure of the sensitivity in multiobjective differential programming (Q2319132) (← links)
- Sensitivity analysis in convex optimization through the circatangent derivative (Q2346913) (← links)
- Sensitivity analysis in multiobjective differential programming (Q2426010) (← links)
- The envelope theorem for multiobjective convex programming via contingent derivatives (Q2637941) (← links)