Optimality via generalized approximate convexity and quasiefficiency

DOI10.1007/s11590-011-0402-3zbMath1283.90029OpenAlexW1971788985MaRDI QIDQ1936801

Anjana Gupta, Davinder Bhatia, Pooja Arora

Publication date: 7 February 2013

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-011-0402-3

zbMATH Keywords

Clarke subdifferentialefficient solutionvector optimization problemLipschitz functionquasi efficient solution

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29)

Related Items (10)

On vector variational-like inequalities involving right upper-Dini-derivative functions ⋮ On Minty variational principle for nonsmooth vector optimization problems with generalized approximate convexity ⋮ Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems ⋮ Vector critical points and generalized quasi-efficient solutions in nonsmooth multi-objective programming ⋮ Some relations between vector variational inequality problems and nonsmooth vector optimization problems using quasi efficiency ⋮ On relations between nonsmooth interval-valued multiobjective programming problems and generalized Stampacchia vector variational inequalities ⋮ Approximate quasi efficiency of set-valued optimization problems via weak subdifferential ⋮ Vector variational inequalities on Riemannian manifolds with approximate geodesic star-shaped functions ⋮ On local quasi efficient solutions for nonsmooth vector optimization problems ⋮ On the Applications of Nonsmooth Vector Optimization Problems to Solve Generalized Vector Variational Inequalities Using Convexificators

Cites Work

• Pareto optimality, game theory and equilibria
• Efficiency and generalized convex duality for multiobjective programs
• Efficiency conditions and duality for a class of multiobjective fractional programming problems
• \(\varepsilon\)-optimality for multiobjective programming on a Banach space
• \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
• A survey of recent developments in multiobjective optimization
• ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
• Approximate convexity in vector optimisation
• Necessary and sufficient conditions in constrained optimization
• On generalised convex mathematical programming
• Generalized (F, ρ)-convexity and duality for non smooth multi-objective programs
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimality via generalized approximate convexity and quasiefficiency