Optimality conditions for directionally differentiable multi-objective programming problems

DOI10.1007/BF00939951zbMath0793.90065OpenAlexW1984899479MaRDI QIDQ1321138

Y. Ishizuka

Publication date: 27 April 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00939951

zbMATH Keywords

optimality conditionsdirectional derivativesweakly efficient solutionsproperly efficient solutionsnonsmooth and nonconvex but directionally differentiable objective and constraint functionsoptimality for multi- objective programming

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonsmooth analysis (49J52)

Related Items (14)

Qualification conditions for multivalued functions in Banach spaces with applications to nonsmooth vector optimization problems ⋮ Strong Kuhn-Tucker conditions and constraint qualifications in locally Lipschitz multiobjective optimization problems ⋮ On constraint qualifications in directionally differentiable multiobjective optimization problems ⋮ Directionally differentiable multiobjective optimization involving discrete inclusions ⋮ Dual approach to minimization on the set of Pareto-optimal solutions ⋮ Nonsmooth multiobjective programming: strong Kuhn-Tucker conditions ⋮ Dini and Hadamard directional derivatives in multiobjective optimization: an overview of some results ⋮ On directionally differentiable multiobjective programming problems with vanishing constraints ⋮ Necessary optimality conditions of an optimization problem governed by a double phase PDE ⋮ Lagrange multipliers for multiobjective programs with a general preference ⋮ Existence of Lagrange Multipliers under Gâteaux Differentiable Data with Applications to Stochastic Optimal Control Problems ⋮ Karush-Kuhn-Tucker Optimality Conditions and Duality for Multiobjective Semi-Infinite Programming Via Tangential Subdifferentials ⋮ Multiobjective optimal control of a non-smooth semilinear elliptic partial differential equation ⋮ Proximal point algorithm for differentiable quasi-convex multiobjective optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Theory of multiobjective optimization
• Farkas' theorem of nonconvex type and its application to a min-max problem
• Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
• On proper and improper efficient solutions of optimal problems with multicriteria
• Necessary conditions for optimality of nondifferentiable convex multiobjective programming
• Weak Pareto-optimal necessary conditions in a nondifferentiable multiobjective program on a Banach space
• Characterization theorems for constrained approximation problems via optimization theory
• Proper efficiency and the theory of vector maximization
• Necessary and sufficient conditions for the efficient solutions of nondifferentiable multiobjective problems
• Directional differentiability of the optimal value function in a nonlinear programming problem
• Optimization and nonsmooth analysis
• Optimality Conditions for Quasi-Differentiable Programs with Application to Two-Level Optimization

This page was built for publication: Optimality conditions for directionally differentiable multi-objective programming problems