Lagrange multipliers for multiobjective programs with a general preference
From MaRDI portal
Recommendations
- On Lagrance-Kuhn-Tucker Mulitipliers for Muliobjective Optimization Problems
- Lagrange multipliers and saddle points in multiobjective programming
- Multiobjective programming problems under generalized convexity
- scientific article; zbMATH DE number 500378
- scientific article; zbMATH DE number 2123492
- Duality and Lagrange multipliers for nonsmooth multiobjective programming
- scientific article; zbMATH DE number 1134656
- Lagrange multiplier theorem of multiobjective programming problems with set functions
- A generalization of the optimality for multicriterion problems
- On Lagrangian duality for multiparametric programs
Cites work
- scientific article; zbMATH DE number 124646 (Why is no real title available?)
- A Fritz John optimality condition using the approximate subdifferential
- A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
- A subdifferential condition for calmness of multifunctions
- Approximate subdifferentials and applications 3: the metric theory
- Approximate subdifferentials and applications II
- Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
- Differential characterizations of covering, metric regularity, and Lipschitzian properties of multifunctions between Banach spaces
- Directional Behaviour of Optimal Solutions in Nonlinear Mathematical Programming
- Directional differentiability of the optimal value function in a nonlinear programming problem
- Epi-Lipschitz-like sets in Banach space: theorems and examples
- Extensions Of Subdifferential Calculus Rules in Banach Spaces
- Hamiltonian Necessary Conditions for a Multiobjective Optimal Control Problem with Endpoint Constraints
- Intersection formulae and the marginal function in Banach spaces
- Lagrange multiplers for pareto nonsmooth programming problems in banach spaces
- Metric regularity for strongly compactly Lipschitzian mappings
- Multiobjective optimization problem with variational inequality constraints
- Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- Necessary Optimality Conditions in Multiobjective Dynamic Optimization
- Necessary conditions for extremality and separation theorems with applications to multiobjective optimization
- On Subdifferentials of Optimal Value Functions
- On a class of compactly epi-Lipschitzian sets
- On conditions to have bounded multipliers in locally lipschitz programming
- On the Calmness of a Class of Multifunctions
- On the variational principle
- Optimality conditions for directionally differentiable multi-objective programming problems
- Optimization and nonsmooth analysis
- Proximal Analysis and Boundaries of Closed Sets in Banach Space, Part I: Theory
- Qualification conditions for multivalued functions in Banach spaces with applications to nonsmooth vector optimization problems
- Regularity and stability for the mathematical programming problem in Banach spaces
- Subdifferential Conditions for Calmness of Convex Constraints
- Subdifferentials of compactly Lipschitzian vector-valued functions
- Tangential approximations
- The approximate subdifferential of composite functions
- The role of locally compact cones in nonsmooth analysis.
- Variational Analysis
- Variational Analysis and Generalized Differentiation I
- Weak Pareto-optimal necessary conditions in a nondifferentiable multiobjective program on a Banach space
Cited in
(10)- Prices and Pareto optima
- scientific article; zbMATH DE number 124656 (Why is no real title available?)
- scientific article; zbMATH DE number 2091949 (Why is no real title available?)
- Scalarization in geometric and functional vector optimization revisited
- Extremal systems for sets and multifunctions in multiobjective optimization with variable ordering structures
- Optimality conditions for nonsmooth multiobjective bilevel optimization problems
- Subdifferential necessary conditions in set-valued optimization problems with equilibrium constraints
- Infinite-dimensional vector optimization and a separation theorem
- Necessary conditions for εe-minimizers in vector optimization with empty interior ordering sets
- Characterizations of the free disposal condition for nonconvex economies on infinite dimensional commodity spaces
This page was built for publication: Lagrange multipliers for multiobjective programs with a general preference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q931421)