A Multiplier Rule for Multiobjective Programming Problems with Continuous Data
From MaRDI portal
Publication:4785874
DOI10.1137/S1052623400378286zbMath1055.90063OpenAlexW4248537094MaRDI QIDQ4785874
Publication date: 5 January 2003
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623400378286
Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Nonsmooth analysis (49J52)
Related Items (25)
Necessary optimality conditions in terms of convexificators in Lipschitz optimization ⋮ Equi-surjective systems of linear operators and applications ⋮ Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case ⋮ Convexificators and boundedness of the Kuhn–Tucker multipliers set ⋮ First and second order optimality conditions using approximations for nonsmooth vector optimization in Banach spaces ⋮ Optimality conditions in optimization problems with convex feasible set using convexificators ⋮ Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints ⋮ Optimality conditions for \(C^{1,1}\) constrained multiobjective problems ⋮ Scalar Lagrange multiplier rules for set-valued problems in infinite-dimensional spaces ⋮ Order-preserving transformations and applications ⋮ 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 ⋮ Optimality conditions for nonsmooth multiobjective optimization using Hadamard directional derivatives ⋮ Convexificators and necessary conditions for efficiency ⋮ Necessary and sufficient conditions for efficiency via convexificators ⋮ Convexifactors, generalized convexity and vector optimization ⋮ Convexificators and strong Kuhn-Tucker conditions ⋮ Unnamed Item ⋮ Scalar multiplier rules in set-valued optimization ⋮ Chain rules for approximate Jacobians of continuous functions ⋮ Mixed Duality without Constraint Qualification for Nonsmooth Fractional Programming ⋮ Existence and boundedness of the Kuhn-Tucker multipliers in nonsmooth multiobjective optimization ⋮ Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators ⋮ On nonsmooth mathematical programs with equilibrium constraints using generalized convexity ⋮ Optimality conditions for nonsmooth semidefinite programming via convexificators
This page was built for publication: A Multiplier Rule for Multiobjective Programming Problems with Continuous Data
