Fritz John's type conditions and associated duality forms in convex non differentiable vector-optimization

DOI10.1051/RO/1994280403991zbMATH Open0857.90115OpenAlexW2523393019MaRDI QIDQ4887134FDOQ4887134

Author name not available (Why is that?)

Publication date: 1 August 1996

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105092

zbMATH Keywords

subdifferentialsaddle pointsubgradientnecessary and sufficient conditionsvector-valued Lagrangianconvex non-differentiable constrained multicriteria optimizationWolfe's type duality

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29) Nonsmooth analysis (49J52) Programming in abstract spaces (90C48)

Cited In (5)

• Optimality conditions for Pareto nonsmooth nonconvex programming in Banach spaces
• Title not available (Why is that?)
• Two approaches toward constrained vector optimization and identity of the solutions
• Sufficient Fritz John optimality conditions and duality for nonlinear programming problems
• Duality theorem of nondifferentiable convex multiobjective programming

   Recommendations

• Duality theorem of nondifferentiable convex multiobjective programming 👍 👎
• Fritz-John optimality and duality for non-convex programs 👍 👎
• Optimality conditions in quasidifferentiable vector optimization 👍 👎
• Sufficient Fritz John optimality conditions and duality for nonlinear programming problems 👍 👎
• Sufficiency and duality in nondifferentiable multiobjective programming 👍 👎

This page was built for publication: Fritz John's type conditions and associated duality forms in convex non differentiable vector-optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4887134)