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

DOI10.1051/RO/1994280403991MaRDI QIDQ4887134zbMATH OpenOpenAlexFDO

Authors

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)

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

Cited in

(8)

• Optimality conditions for Pareto nonsmooth nonconvex programming in Banach spaces
• scientific article; zbMATH DE number 1159456 (Why is no real title available?)
• scientific article; zbMATH DE number 4162667 (Why is no real title available?)
• Two approaches toward constrained vector optimization and identity of the solutions
• Sufficient Fritz John optimality conditions and duality for nonlinear programming problems
• Enhanced Fritz John Conditions for Convex Programming
• Duality theorem of nondifferentiable convex multiobjective programming
• On the Fritz John saddle point problem for differentiable multiobjective optimization

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)