scientific article; zbMATH DE number 7620762

zbMATH Open1498.90170MaRDI QIDQ5052072FDOQ5052072

Authors: Thanatchaporn Sirichunwijit, Rabian Wangkeeree 

Publication date: 18 November 2022

Full work available at URL: http://yokohamapublishers.jp/online2/opjnca/vol23/p251.html

Title of this publication is not available (Why is that?)

Recommendations

• Characterizations of approximate duality and saddle point theorems for nonsmooth robust vector optimization
• Approximate optimality conditions for robust convex optimization without convexity of constraints
• Approximate optimality conditions and approximate duality conditions for robust multiobjective optimization problems
• Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
• scientific article; zbMATH DE number 6508503
• On approximate efficiency for nonsmooth robust vector optimization problems
• On approximate optimality conditions for robust multi-objective convex optimization problems
• Optimality and duality in nonsmooth conic vector optimization
• Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization
• Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs

zbMATH Keywords

approximate optimality condition(weak) robust \(e\)-quasi efficient solutionrobust nonsmooth conic vector optimization problem

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)

Cited In (8)

• Approximate solutions in nonsmooth robust optimization with locally Lipschitz constraints
• Characterizations of approximate duality and saddle point theorems for nonsmooth robust vector optimization
• On some efficiency conditions for vector optimization problems with uncertain cone constraints: a robust approach via set-valued inclusions
• On approximate solutions for nonsmooth robust multiobjective optimization problems
• Robust duality for generalized convex nonsmooth vector programs with uncertain data in constraints
• On approximate efficiency for nonsmooth robust vector optimization problems
• Approximate optimality and approximate duality in nonsmooth composite vector optimization
• Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs

This page was built for publication:

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