A Multiplier Rule for Multiobjective Programming Problems with Continuous Data
From MaRDI portal
Recommendations
- A multiplier rule for stable problems in vector optimization
- On the multiplier rules
- A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints
- Multiplier rules for weak pareto optimization problems
- Second-order optimality conditions for \(C^1\) multiobjective programming problems
Cited in
(25)- Optimality and duality for weak quasi efficiency of multiobjective fractional problems via convexificators
- Convexifactors, generalized convexity and vector optimization
- Optimality and duality for nonsmooth multiobjective fractional programming with mixed constraints
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- Convexificators and necessary conditions for efficiency
- First and second order optimality conditions using approximations for nonsmooth vector optimization in Banach spaces
- Optimality conditions for nonsmooth multiobjective optimization using Hadamard directional derivatives
- Convexificators and strong Kuhn-Tucker conditions
- Existence and boundedness of the Kuhn-Tucker multipliers in nonsmooth multiobjective optimization
- Optimality conditions for \(C^{1,1}\) constrained multiobjective problems
- Order-preserving transformations and applications
- Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints
- Chain rules for approximate Jacobians of continuous functions
- Mixed Duality without Constraint Qualification for Nonsmooth Fractional Programming
- Equi-surjective systems of linear operators and applications
- Necessary and sufficient conditions for efficiency via convexificators
- Optimality conditions for nonsmooth semidefinite programming via convexificators
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization
- Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators
- Scalar multiplier rules in set-valued optimization
- Optimality conditions in optimization problems with convex feasible set using convexificators
- On nonsmooth mathematical programs with equilibrium constraints using generalized convexity
- Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
- Convexificators and boundedness of the Kuhn-Tucker multipliers set
- Scalar Lagrange multiplier rules for set-valued problems in infinite-dimensional spaces
This page was built for publication: A Multiplier Rule for Multiobjective Programming Problems with Continuous Data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785874)
