On duality for nonsmooth Lipschitz optimization problems
We present some duality theorems for a non-smooth Lipschitz vector optimization problem. Under generalized invexity assumptions on the functions the duality theorems do not require constraint qualifications.
Main Authors: | Preda Vasile, Beldiman Miruna, Bătătorescu Antoan |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Belgrade
2009-01-01
|
Series: | Yugoslav Journal of Operations Research |
Subjects: | |
Online Access: | http://www.doiserbia.nb.rs/img/doi/0354-0243/2009/0354-02430901041P.pdf |
Similar Items
-
Optimality and Duality Theorems in Nonsmooth Multiobjective Optimization
by: Bae Kwan, et al.
Published: (2011-01-01) -
Optimality and duality for a class of nondifferentiable minimax fractional programming problems
by: Bătătorescu Antoan, et al.
Published: (2009-01-01) -
Generalized (Phi, Rho)-convexity in nonsmooth vector optimization over cones
by: Malti Kapoor, et al.
Published: (2016-01-01) -
Optimality and duality for nonsmooth semi-infinite multiobjective programming with support functions
by: Singh Yadvendra, et al.
Published: (2017-01-01) -
Sufficient optimality conditions and duality for nonsmooth multiobjective optimization problems via higher order strong convexity
by: Upadhyay Balendu B., et al.
Published: (2017-01-01)